过采样
理论(学习稳定性)
计算机科学
数学
机器学习
电信
带宽(计算)
作者
Taejun Park,Yuji Nakatsukasa
出处
期刊:Cornell University - arXiv
日期:2024-05-10
标识
DOI:10.48550/arxiv.2405.06375
摘要
This work investigates the accuracy and numerical stability of CUR decompositions with oversampling. The CUR decomposition approximates a matrix using a subset of columns and rows of the matrix. When the number of columns and the rows are the same, the CUR decomposition can become unstable and less accurate due to the presence of the matrix inverse in the core matrix. Nevertheless, we demonstrate that the CUR decomposition can be implemented in a numerical stable manner and illustrate that oversampling, which increases either the number of columns or rows in the CUR decomposition, can enhance its accuracy and stability. Additionally, this work devises an algorithm for oversampling motivated by the theory of the CUR decomposition and the cosine-sine decomposition, whose competitiveness is illustrated through experiments.
科研通智能强力驱动
Strongly Powered by AbleSci AI