Matrix completion from a few entries

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 324-328

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

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENT ALGORITHM; MASSIVE DATA SETS; MATRIX COMPLETION; N-MATRIX; RANDOM MATRICES; RANDOM SUBSETS; RECONSTRUCTION ALGORITHMS; ROOT MEAN SQUARE ERRORS;

ALGORITHMS;

INFORMATION THEORY;

EID: 70449469955     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205567     Document Type: Conference Paper

References (16)

1. "Netflix prize." [Online]. Available: http://www.netflixprize. com/
2. M. W. Berry, Z. Drmać, and E. R. Jessup, "Matrices, vector spaces, and information retrieval," SIAM Review, vol. 41, no. 2, pp. 335-362, 1999.
3. E. J. Candès and B. Recht, "Exact matrix completion via convex optimization," 2008, arxiv: 0805 . 4471.
4. 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.
5. R. H. Keshavan, A. Montanari, and S. Oh, "Matrix completion from a few entries," January 2009, arXiv:0901.3150.
6. -, "Learning low rank matrices from O(n) entries," in Proc. of the Allerton Conf. on Commun., Control and Computing, September 2008.
7. M. Fazel, "Matrix rank minimization with applications," Ph.D. dissertation, Stanford University, 2002.
8. D. L. Donoho, "Compressed Sensing," IEEE Trans. on Inform. Theory, vol. 52, pp. 1289-1306, 2006.
9. E. J. Candes, J. K. Romberg, and T. Tao, "Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information," IEEE Trans. on Inform. Theory, vol. 52, pp. 489-509, 2006.
10. B. Recht, M. Fazel, and P. Parrilo, "Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization," 2007, arxiv: 0706.4138.
11. J.-F. Cai, E. J. Candès, and Z. Shen, "A singular value thresholding algorithm for matrix completion," 2008, arXiv: 0810 . 3286.
12. E. J. Candès and T. Tao, "The power of convex relaxation: Near-optimal matrix completion," 2009, arXiv: 0903 . 1476.
13. A. Singer and M. Cucuringu, "Uniqueness of low-rank matrix completion by rigidity theory," January 2009, arXiv: 0902 . 3846.
14. E. J. Candès and Y. Plan, "Matrix completion with noise," 2009, arXiv: 0903 . 3131.
15. J. Friedman, J. Kahn, and E. Szemerédi, "On the second eigenvaluein random regular graphs," in Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing. Seattle, Washington,USA: ACM, may 1989, pp. 587-598.
16. U. Feige and E. Ofek, "Spectral techniques applied to sparse random graphs," Random Struct. Algorithms, vol. 27, no. 2, pp. 251-275, 2005.