arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.04223math.NAcs.NA
收藏

低秩近似的迭代细化与过采样

Iterative Refinement and Oversampling for Low Rank Approximation

Victor Y. Pan, Qi Luan, Soo Go

AI总结:

本文将迭代细化扩展到矩阵低秩近似(LRA),发现其与过采样技术的关联;结合稀疏草图矩阵的算法可亚线性成本实现VLRA,后续过采样能将特定矩阵谱范数精度提升至近最优。

摘要:

迭代细化在方程组数值求解中尤为流行。我们将其扩展到矩阵低秩近似(LRA),并观察到所得算法与随机LRA算法常用的过采样技术密切相关。我们详细阐述这一关联,重新审视过采样及部分高效随机LRA算法。结合稀疏草图矩阵应用时,它们运行速度显著加快,尤其能以亚线性成本实现极低秩近似(VLRA),所用标量和浮点运算数远少于输入矩阵的元素数。这以输出精度下降为代价,但根据我们的理论和实证研究,后续过采样可将奇异值谱快速衰减的大类矩阵在谱范数下的精度提升至近最优水平。

英文摘要:

Iterative refinement is particularly popular for numerical solution of linear systems of equations. We extend it to Low Rank Approximation of a matrix (LRA) and observe close link of the resulting algorithm to oversampling techniques, commonly used in randomized LRA algorithms. We elaborate upon this link and revisit oversampling and some efficient randomized LRA algorithms. Applied with sparse sketch matrices they run significantly faster and in particular yield Very Low Rank Approximation (VLRA) at sublinear cost, using much fewer scalars and flops than the input matrix has entries. This is achieved at the price of deterioration of output accuracy, but according to our formal and empirical study subsequent oversampling improves accuracy to near-optimal level under the spectral norm for a large sub-class of matrices with fast decaying spectra of singular values.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑