Matrix completion from a few entries

IEEE Transactions on Information Theory

Volumn 56, Issue 6, 2010, Pages 2980-2998

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

^a Stanford University   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Gradient descent; Low rank; Manifold optimization; Matrix completion; Phase transition; Spectral methods

Indexed keywords

GRADIENT DESCENT; LOW RANK; MANIFOLD OPTIMIZATION; MATRIX COMPLETION; SPECTRAL METHODS;

ALGORITHMS; OPTIMIZATION; SPECTROSCOPY;

PHASE TRANSITIONS;

EID: 77956897560     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2046205     Document Type: Article

References (34)

1. Y. Azar, A. Fiat, A. Karlin, F. McSherry, and J. Saia, "Spectral analysis of data," in Proc. 33rd Annu. ACM Symp. Theory of Computing, New York, 2001, pp. 619-626.
2. D. Achlioptas and F. McSherry, "Fast computation of low-rank matrix approximations," J. ACM, vol.54, no.2, p. 9, 2007.
3. L. Armijo, "Minimization of functions having Lipschitz continuous first partial derivatives," Pacific J. Math., vol.16, no.1, pp. 1-3, 1966.
4. M. W. Berry, Z. Drmać, and E. R. Jessup, "Matrices, vector spaces, and information retrieval," SIAM Rev., vol.41, no.2, pp. 335-362, 1999.
5. M. W. Berry, "Large scale sparse singular value computations," Int. J. Supercomput. Appl., vol.6, pp. 13-49, 1992.
6. B. Bollobás, Graph Theory: An Introductory Course. New York: Springer-Verlag, 1979.
7. J.-F. Cai, E. J. Candès, and Z. Shen, A Singular Value Thresholding Algorithm for Matrix Completion, 2008 [Online]. Available: arXiv:0810.3286
8. E. J. Candès and Y. Plan, Matrix Completion with Noise, 2009 [Online]. Available: arXiv:0903.3131
9. E. J. Candès and B. Recht, Exact Matrix Completion via Convex Optimization, 2008 [Online]. Available: arxiv:0805.4471
10. E. J. Candès, J. K. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol.52, pp. 489-509, 2006.
11. P. Chen and D. Suter, "Recovering the missing components in a large noisy low-rank matrix: Application to sfm," IEEE Trans. Pattern Anal. Mach. Intell., vol.26, no.8, pp. 1051-1063, Aug. 2004.
12. E. J. Candès and T. Tao, The Power of Convex Relaxation: Near-Optimal Matrix Completion, 2009 [Online]. Available: arXiv:0903.1476
13. W. Dai and O. Milenkovic, Set: An Algorithm for Consistent Matrix Completion, 2009 [Online]. Available: arXiv:0909.2705
14. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol.52, pp. 1289-1306, 2006.
15. A. Edelman, T. A. Arias, and S. T. Smith, "The geometry of algorithms with orthogonality constraints," SIAM J. Matr. Anal. Appl., vol.20, pp. 303-353, 1999.
16. M. Fazel, "Matrix Rank Minimization with Applications," Ph.D. dissertation, Stanford Univ., Stanford, CA, 2002.
17. J. Friedman, J. Kahn, and E. Szemerédi, "On the second eigenvalue in random regular graphs," in Proc. 21st Annu. ACM Symp. Theory of Computing, Seattle, WA, May 1989, pp. 587-598.
18. A. Frieze, R. Kannan, and S. Vempala, "Fast monte-carlo algorithms for finding low-rank approximations," J. ACM, vol.51, no.6, pp. 1025-1041, 2004.
19. U. Feige and E. Ofek, "Spectral techniques applied to sparse random graphs," Random Struct. Alg., vol.27, no.2, pp. 251-275, 2005.
20. R. H. Keshavan, A. Montanari, and S. Oh, "Learning low rank matrices from O(n) entries," presented at the Allerton Conf. on Commun., Control and Computing, Sep. 2008.
21. R. H. Keshavan, A. Montanari, and S. Oh, Matrix Completion from a Few Entries, 2009 [Online]. Available: arXiv:0901.3150
22. R. H. Keshavan, A. Montanari, and S. Oh, Matrix Completion from Noisy Entries, 2009 [Online]. Available: arXiv:0906.2027
23. R. H. Keshavan and S. Oh, A Gradient Descent Algorithm on the Grassmann Manifold for Matrix Completion, 2009 [Online]. Available: arXiv:0910.5260
24. K. Lee and Y. Bresler, Admira: Atomic Decomposition for Minimum Rank Approximation, 2009 [Online]. Available: arXiv:0905.0044
25. T. Luczak, "On the equivalence of two basic models of random graphs," in Proc. 3rd Int. Seminar on Random Graphs and Probabilistic Methods in Combinatorics, 1990, pp. 151-157.
26. S. Ma, D. Goldfarb, and L. Chen, Fixed Point and Bregman Iterative Methods for Matrix Rank Minimization, 2009 [Online]. Available: arXiv:0905.1643
27. R. Mazumder, T. Hastie, and R. Tibshirani, Spectral Regularization Algorithms for Learning Large Incomplete Matrices, 2009 [Online]. Available: http://www-stat.stanford.edu/~hastie/Papers/SVD-JMLR.pdf
28. R. Meka, P. Jain, and I. S. Dhillon, Guaranteed Rank Minimization via Singular Value Projection, 2009 [Online]. Available: arXiv:0909.5457
29. Netflix Prize [Online]. Available: http://www.netflixprize.com/
30. B. Recht, M. Fazel, and P. Parrilo, Guaranteed Minimum Rank Solutions of Matrix Equations via Nuclear Norm Minimization, 2007 [Online]. Available: arxiv:0706.4138
31. A. Singer and M. Cucuringu, Uniqueness of Low-Rank Matrix Completion by Rigidity Theory, 2009 [Online]. Available: arXiv:0902.3846
32. Y. Seginer, "The expected norm of random matrices," Combin., Probab., Comput., vol.9, pp. 149-166, 2000.
33. K. Toh and S. Yun, An Accelerated Proximal Gradient Algorithm for Nuclear Norm Regularized Least Squares Problems 2009 [Online]. Available: http://www.math.nus.edu.sg/~matys
34. Z.Wang, S. Zheng, S. Boyd, and Y. Ye, Further Relaxations of the sdp Approach to Sensor Network Localization, Tech. Rep. 2006.