A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm
A lower bound guaranteeing exact matrix completion via singular value thresholding algorithm
复制标题
通过奇异值阈值算法保证精确矩阵完成的下界
DOI:
10.1016/j.acha.2011.04.004
复制
发表时间:
2011-11
影响因子:
2.5
通讯作者:
成礼智
中科院分区:
文献类型:
--
作者:
张慧;成礼智
In this paper, we give a lower bound guaranteeing exact matrix completion via singular value thresholding (SVT) algorithm. The analysis shows that when the parameter in SVT algorithm is beyond some finite scalar, one can recover some unknown low-rank matrices exactly with high probability by solving a strictly convex optimization problem. Furthermore, we give an explicit expression for such a finite scalar. This result in the paper not only has theoretical interests, but also guides us to choose suitable parameters in the SVT algorithm.
登录
查看更多内容
影响因子:
22.7
作者:
Candes, Emmanuel;Recht, Benjamin
通讯作者:
Recht, Benjamin
影响因子:
20.6
作者:
Candes, Emmanuel J.;Plan, Yaniv
通讯作者:
Plan, Yaniv
DOI:
10.4310/cms.2010.v8.n1.a6
发表时间:
2011-04
期刊:
ArXiv
影响因子:
--
作者:
S. Osher;Yu Mao;Bin Dong;W. Yin
通讯作者:
S. Osher;Yu Mao;Bin Dong;W. Yin
影响因子:
3
作者:
Candes, Emmanuel J.;Recht, Benjamin
通讯作者:
Recht, Benjamin
DOI:
10.1137/090760350
发表时间:
2010-12
期刊:
SIAM J. Imaging Sci.
影响因子:
--
作者:
W. Yin
通讯作者:
W. Yin