arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1006.2195cs.ITmath.IT
收藏

低秩矩阵完备化的子空间演化与转移算法(SET)

Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion

Wei Dai, Olgica Milenkovic, Ely Kerman

摘要:

我们描述了一个新的算法,称为子空间演化和转移(SET),解决低秩矩阵完成问题。该算法以一个低秩矩阵的元素子集作为输入,输出一个与给定观测值一致的低秩矩阵。完成任务是通过搜索格拉斯曼流形上的一个列空间,匹配不完整的意见。SET算法由子空间演化和子空间转移两部分组成。在演化部分,我们使用了一个梯度下降方法的格拉斯曼流形上,以改善我们的估计的列空间。由于梯度下降算法不能保证收敛,由于沿搜索路径的障碍的存在,我们设计了一个新的机制,用于检测障碍和转移估计的列空间跨越障碍。该机制构成了该算法传输步骤的核心。SET算法在高采样率和低采样率两种情况下都表现出优异的经验性能。

英文摘要:

We describe a new algorithm, termed subspace evolution and transfer (SET), for solving low-rank matrix completion problems. The algorithm takes as its input a subset of entries of a low-rank matrix, and outputs one low-rank matrix consistent with the given observations. The completion task is accomplished by searching for a column space on the Grassmann manifold that matches the incomplete observations. The SET algorithm consists of two parts -- subspace evolution and subspace transfer. In the evolution part, we use a gradient descent method on the Grassmann manifold to refine our estimate of the column space. Since the gradient descent algorithm is not guaranteed to converge, due to the existence of barriers along the search path, we design a new mechanism for detecting barriers and transferring the estimated column space across the barriers. This mechanism constitutes the core of the transfer step of the algorithm. The SET algorithm exhibits excellent empirical performance for both high and low sampling rate regimes.

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

↑