A simpler approach to matrix completion

Journal of Machine Learning Research

Volumn 12, Issue , 2011, Pages 3413-3430

  Recht, Benjamin ^a  

^a University of Wisconsin   (United States)

Author keywords

Compressed sensing; Convex optimization; Low rank matrices; Matrix completion; Nuclear norm minimization; Operator chernoff bound; Random matrices

Indexed keywords

CHERNOFF BOUNDS; COMPRESSED SENSING; LOW-RANK MATRICES; MATRIX COMPLETION; RANDOM MATRICES;

CONVEX OPTIMIZATION; INFORMATION THEORY; QUANTUM OPTICS;

SINGULAR VALUE DECOMPOSITION;

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

References (29)

1. Rudolf Ahlswede and Andreas Winter. Strong converse for identification via quantum channels. IEEE Transactions on Information Theory, 48(3):569-579, 2002. (Pubitemid 34239788)
2. Andreas Argyriou, Charles A. Micchelli, and Massimiliano Pontil. Convex multi-task feature learning. Machine Learning, 2008. Published online first at http://www.springerlink.com/.
3. Carolyn Beck and Raffaello D'Andrea. Computational study and comparisons of LFT reducibility methods. In Proceedings of the American Control Conference, 1998.
4. Emmanuel Candès and Benjamin Recht. Exact matrix completion via convex optimization. Foundations of Computational Mathematics, 9(6):717-772, 2009.
5. Emmanuel J. Candès and Yaniv Plan. Matrix completion with noise. Proceedings of the IEEE, 98(6):925-936, 2009.
6. Emmanuel J. Candès and Terence Tao. The power of convex relaxation: Near-optimal matrix completion. IEEE Transactions on Information Theory, 56(5):2053-2080, 2009.
7. Emmanuel J. Candés, Justin Romberg, and Terence Tao. Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory, 52(2):489-509, 2006. ISSN 0018-9448. (Pubitemid 43174093)
8. Alexander L. Chistov and Dima Yu. Grigoriev. Complexity of quantifier elimination in the theory of algebraically closed fields. In Proceedings of the 11th Symposium on Mathematical Foundations of Computer Science, volume 176 of Lecture Notes in Computer Science, pages 17-31. Springer Verlag, 1984.
9. Victor H. de la Peña and Stephen J. Montgomery-Smith. Decoupling inequalities for the tail probabilities of multivariate U-statistics. Annals of Probability, 23(2):806-816, 1995. ISSN 0091-1798.
10. Maryam Fazel. Matrix Rank Minimization with Applications. PhD thesis, Stanford University, 2002.
11. Maryam Fazel, Haitham Hindi, and Stephen Boyd. A rank minimization heuristic with application to minimum order system approximation. In Proceedings of the American Control Conference, 2001.
12. Jean Jacques Fuchs. On sparse representations in arbitrary redundant bases. IEEE Transactions on Information Theory, 50:1341-1344, 2004.
13. Sideny Golden. Lower bounds for the Helmholtz function. Physical Review, 137 B (4):B1127-1128, 1965.
14. Gaston H. Gonnet. Expected length of the longest probe sequence in hash code searching. Journal of the Association for Computing Machinery, 28(2):289-304, 1981.
15. David Gross. Recovering low-rank matrices from few coefficients in any basis. IEEE Transactions on Information Theory, 57:1548-1566, 2011.
16. David Gross, Yi-Kai Liu, Steven T. Flammia, Stephen Becker, and Jens Eisert. Quantum state tomography via compressed sensing. Physical Review Letters, 105(15):150401, 2010.
17. Torben Hagerup and Christine Rüb. A guided tour of Chernoff bounds. Information Processing Letters, 33:305-308, 1990.
18. Raghunandan H. Keshavan, Andrea Montanari, and Sewoong Oh. Matrix completion from a few entries. IEEE Transactions on Information Theory, 56(6):2980-2998, 2009.
19. Yehuda Koren, Robert Bell, and Chris Volinsky. Matrix factorization techniques for recommender systems. Computer, 42(8):30-37, 2009.
20. Nathan Linial, Eran London, and Yuri Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15:215-245, 1995.
21. Mehran Mesbahi and George P. Papavassilopoulos. On the rank minimization problem over a positive semidefinite linear matrix inequality. IEEE Transactions on Automatic Control, 42(2):239-243, 1997. (Pubitemid 127760583)
22. Guillaume Obozinski, Ben Taskar, and Michael I. Jordan. Joint covariate selection and joint subspace selection for multiple classification problems. Statistics and Computing, pages 1-22, 2009.
23. Dmitry Panchenko. MIT 18.465: Statistical Learning Theory. MIT Open Courseware http://ocw.mit.edu/OcwWeb/Mathematics/18-465Spring-2007/CourseHome/, 2007.
24. Benjamin Recht, Maryam Fazel, and Pablo Parrilo. Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization. SIAM Review, 52(3):471-501, 2010.
25. Jason D. M. Rennie and Nathan Srebro. Fast maximum margin matrix factorization for collaborative prediction. In Proceedings of the International Conference of Machine Learning, 2005.
26. Anthony Man-Cho So and Yinyu Ye. Theory of semidefinite programming for sensor network localization. Mathematical Programming, Series B, 109:367-384, 2007. (Pubitemid 46197861)
27. Nathan Srebro. Learning with Matrix Factorizations. PhD thesis, Massachusetts Institute of Technology, 2004.
28. Colin J. Thompson. Inequality with applications in statistical mechanics. Journal of Mathematical Physics, 6(11):1812-1823, 1965.
29. Kilian Q. Weinberger and Lawrence K. Saul. Unsupervised learning of image manifolds by semidefinite programming. International Journal of Computer Vision, 70(1):77-90, 2006. (Pubitemid 43855868)