论文标题
等级矩阵完成的交流最小化的渐近收敛速率
Asymptotic Convergence Rate of Alternating Minimization for Rank One Matrix Completion
论文作者
论文摘要
我们在最简单的设置中研究了矩阵完成的交替最小化：从条目的显示子集中完成排名一号矩阵。我们通过可逆共识问题的特征值的变异表征来结合渐近收敛速率。这导致多项式上限以节点数量以及最大程度的显示条目的渐近率上的多项式上限。
We study alternating minimization for matrix completion in the simplest possible setting: completing a rank-one matrix from a revealed subset of the entries. We bound the asymptotic convergence rate by the variational characterization of eigenvalues of a reversible consensus problem. This leads to a polynomial upper bound on the asymptotic rate in terms of number of nodes as well as the largest degree of the graph of revealed entries.
