Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4605392 | Applied and Computational Harmonic Analysis | 2011 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Analysis