Matrix completion from noisy entries

Journal of Machine Learning Research

Volumn 11, Issue , 2010, Pages 2057-2078

  Keshavan, Raghunandan H ^a,b   Montanari, Andrea ^a   Oh, Sewoong ^a  

^a Stanford University   (United States)

^b Department of Statistics ^*  (United States)

Author keywords

Low rank matrices; Manifold optimization; Matrix completion; Spectral methods

Indexed keywords

COLLABORATIVE FILTERING; LOW COMPLEXITY ALGORITHM; LOW-RANK MATRICES; MANIFOLD OPTIMIZATION; MATRIX; MATRIX COMPLETION; NOISY OBSERVATIONS; PERFORMANCE GUARANTEES; RANDOM SUBSETS; SPECTRAL METHODS; SPECTRAL TECHNIQUES; STRUCTURE FROM MOTION;

SPECTROSCOPY;

OPTIMIZATION;

EID: 77956909553     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (22)

1. P.-A. Absil, R. Mahony, and R. Sepulchrer. Optimization Algorithms on Matrix Manifolds. Princeton University Press, 2008.
2. D. Achlioptas and F. McSherry. Fast computation of low-rank matrix approximations. J. ACM, 54(2):9, 2007.
3. J-F Cai, E. J. Candes, and Z. Shen. A singular value thresholding algorithm for matrix completion. arXiv:0810.3286, 2008.
4. E. J. Candès and Y. Plan. Matrix completion with noise. arXiv: 0903.3131, 2009.
5. E. J. Candès and B. Recht. Exact matrix completion via convex optimization, arxiv: 0805.4471, 2008.
6. E. J. Candes and T. Tao. The power of convex relaxation: Near-optimal matrix completion. arXiv:0903.1476, 2009.
7. A. Edelman, T. A. Arias, and S. T. Smith. The geometry of algorithms with orthogonality constraints. SIAMJ. Matr. Anal. Appl, 20:303-353, 1999.
8. M. Fazel. Matrix Rank Minimization with Applications. PhD thesis, Stanford University, 2002.
9. A. Frieze, R. Kannan, and S. Vempala. Fast monte-carlo algorithms for finding low-rank approximations. J. ACM, 51(6):1025-1041, 2004. ISSN 0004-5411.
10. R. H. Keshavan and S. Oh. Optspace: A gradient descent algorithm on the grassman manifold for matrix completion. arXiv: 0910. 5260, 2009.
11. R. H. Keshavan, A. Montanari, and S. Oh. Matrix completion from a few entries. IEEE Trans. Inform. Theory, 56(6):2980-2998, June 2010.
12. K. Lee and Y. Bresler. Admira: Atomic decomposition for minimum rank approximation. arXiv:0905.0044, 2009.
13. S. Ma, D. Goldfarb, and L. Chen. Fixed point and Bregman iterative methods for matrix rank minimization. arXiv: 0905.1643, 2009.
14. B. Recht, M. Fazel, and P. Parrilo. Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization. arxiv: 0706.413 8, 2007.
15. R. Salakhutdinov and A. Mnih. Probabilistic matrix factorization. In Advances in Neural Information Processing Systems, volume 20, 2008.
16. R. Salakhutdinov and N. Srebro. Collaborative filtering in a non-uniform world: Learning with the weighted trace norm. arXiv:1002.2780, 2010.
17. R. Salakhutdinov, A. Mnih, and G. Hinton. Restricted Boltzmann machines for collaborative filtering. In Proceedings of the International Conference on Machine Learning, volume 24, pages 791-798, 2007.
18. Y. Seginer. The expected norm of random matrices. Comb. Probab. Comput, 9:149-166, March 2000. ISSN 0963-5483. doi: 10.1017/S096354830000420X. URL http://portal.acm.org/citation. cfm?id=971471.971475.
19. N. Srebro and T. S. Jaakkola. Weighted low-rank approximations. In In 20th International Conference on Machine Learning, pages 720-727. AAAI Press, 2003.
20. N. Srebro, J. D. M. Rennie, and T. S. Jaakola. Maximum-margin matrix factorization. In Advances in Neural Information Processing Systems 17, pages 1329-1336. MIT Press, 2005.
21. M. Talagrand. A new look at independence. The Annals of Probability, 24(1):1-34, 1996. ISSN 00911798. URL http://www.jstor.org/stable/2244830.
22. K. Toh and S. Yun. An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems. http://www.math.nus.edu.sg/~matys, 2009.