Exact low-rank matrix completion via convex optimization

46th Annual Allerton Conference on Communication, Control, and Computing

Volumn , Issue , 2008, Pages 806-812

  Candès, Emmanuel J ^a   Recht, Benjamin ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSED SENSING; CONVEX PROGRAMMING PROBLEMS; LIMITED INFORMATIONS; LOW-RANK MATRICES; MATRIXES; RANDOM SUBSETS; TECHNIQUES USED;

CONVEX OPTIMIZATION;

EID: 64549090250     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2008.4797640     Document Type: Conference Paper

References (22)

1. J. Abernethy, F. Bach, T. Evgeniou, and J.-P. Vert, "Low-rank matrix factorization with attributes," Ecole des Mines de Paris, Tech. Rep. N24/06/MM, 2006.
2. Proceedings of KDD Cup and Workshop. ACM SIGKDD and Netflix, 2007, proceedings available online at http://www.cs.uic.edu/~liub/KDD-cup-2007/ proceedings.html.
3. Y. Amit, M. Fink, N. Srebro, and S. Ullman, "Uncovering shared structures in multiclass classification," in Proceedings of the Twenty-fourth International Conference on Machine Learning, 2007.
4. A. Argyriou, T. Evgeniou, and M. Pontil, "Multi-task feature learning," in Neural Information Processing Systems, 2007.
5. C. Beck and R. D'Andrea, "Computational study and comparisons of LFT reducibility methods," in Proceedings of the American Control Conference, 1998.
6. E. J. Candès and J. Romberg, "Sparsity and incoherence in compressive sampling," Inverse Problems, vol. 23, no. 3, pp. 969-985, 2007. [Online]. Available: http://stacks.iop.org/0266-5611/23/969
7. E. J. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inform. Theory, vol. 52, no. 2, pp. 489-509, 2006.
8. E. J. Candès and T. Tao, "Decoding by linear programming," IEEE Transactions on Information Theory, vol. 51, no. 12, pp. 4203-4215, 2005.
9. E. J. Candès and T. Tao, "Near optimal signal recovery from random projections: Universal encoding strategies?" IEEE Trans. Inform. Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006.
10. E. J. Candès and B. Recht, "Exact matrix completion via convex optimization," 2008, submitted for publication. Preprint available at http://lanl.arxiv.org/abs/0805.4471.
11. A. L. Chistov and D. Y. Grigoriev, "Complexity of quantifier elimination in the theory of algebraically closed fields," in Proceedings of the 11th Symposium on Mathematical Foundations of Computer Science, ser. Lecture Notes in Computer Science, vol. 176. Springer Verlag, 1984, pp. 17-31.
12. V. H. de la Peña, "Decoupling and Khintchine's inequalities for U-statistics," Ann. Probab., vol. 20, no. 4, pp. 1877-1892, 1992.
13. V. H. de la Peña and S. J. Montgomery-Smith, "Decoupling inequalities for the tail probabilities of multivariate U-statistics, " Ann. Probab., vol. 23, no. 2, pp. 806-816, 1995.
14. D. L. Donoho, "Compressed sensing," IEEE Trans. Inform. Theory, vol. 52, no. 4, pp. 1289-1306, 2006.
15. M. Fazel, "Matrix rank minimization with applications," Ph. D. dissertation, Stanford University, 2002.
16. N. Linial, E. London, and Y. Rabinovich, "The geometry of graphs and some of its algorithmic applications," Combinatorica, vol. 15, pp. 215-245, 1995.
17. M. Mesbahi and G. P. Papavassilopoulos, "On the rank minimization problem over a positive semidefinite linear matrix inequality," IEEE Transactions on Automatic Control, vol. 42, no. 2, pp. 239-243, 1997.
18. B. Recht, M. Fazel, and P. Parrilo, "Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization," 2007, submitted to SIAM Review.
19. J. D. M. Rennie and N. Srebro, "Fast maximum margin matrix factorization for collaborative prediction," in Proceedings of the International Conference of Machine Learning, 2005.
20. A. M.-C. So and Y. Ye, "Theory of semidefinite programming for sensor network localization," Mathematical Programming, Series B, vol. 109, 2007.
21. N. Srebro, "Learning with matrix factorizations," Ph. D. dissertation, Massachusetts Institute of Technology, 2004.
22. L. Vandenberghe and S. P. Boyd, "Semidefinite programming," SIAM Review, vol. 38, no. 1, pp. 49-95, 1996.