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

CUR分解、近似与扰动

CUR Decompositions, Approximations, and Perturbations

Department of Mathematics, University of Arizona, Tucson, AZ 85719 USA(亚利桑那大学数学系,图森,亚利桑那州,85719 USA);Department of Mathematics, Vanderbilt University, Nashville, TN 37240 USA(范德比尔特大学数学系,纳什维尔,田纳西州,37240 USA)

Keaton Hamm, Longxiu Huang

AI总结:

本文探讨了用于降维和低秩矩阵近似的CUR分解方法,综述并比较了文献中的不同观点,提出了一种新的精确CUR分解特征,并对噪声低秩矩阵的CUR近似进行了新颖的扰动分析,同时给出了新的列和行采样结果,证明了低秩矩阵的CUR分解在高概率下得以实现,并展示了这些采样方法在之前研究的扰动下的稳定性以及相关方法和界限的数值示例。

摘要:

本文讨论了用于降维和低秩矩阵近似的CUR分解这一有用的工具。文献中关于该方法的各种观点被综合并进行比较和对比;其中包括对精确CUR分解的新特征。对噪声低秩矩阵的CUR近似的新型扰动分析被进行,该分析将这些近似与底层低秩部分的潜在CUR分解进行比较。此外,我们给出了新的列和行采样结果,允许得出结论:低秩矩阵的CUR分解以高概率获得。然后,我们展示了这些采样方法在之前研究的扰动下的稳定性,并提供了所讨论的方法和界限的数值示例。

英文摘要:

This article discusses a useful tool in dimensionality reduction and low-rank matrix approximation called the CUR decomposition. Various viewpoints of this method in the literature are synergized and are compared and contrasted; included in this is a new characterization of exact CUR decompositions. A novel perturbation analysis is performed on CUR approximations of noisy versions of low-rank matrices, which compares them with the putative CUR decomposition of the underlying low-rank part. Additionally, we give new column and row sampling results which allow one to conclude that a CUR decomposition of a low-rank matrix is attained with high probability. We then illustrate the stability of these sampling methods under the perturbations studied before, and provide numerical illustrations of the methods and bounds discussed.

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

↑