Matrix completion from noisy entries

Advances in Neural Information Processing Systems 22 - Proceedings of the 2009 Conference

Volumn , Issue , 2009, Pages 952-960

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

^a Stanford University   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

LOW COMPLEXITY ALGORITHM; MATRIX; MATRIX COMPLETION; NETFLIX; NOISY OBSERVATIONS; OPTIMISATIONS; PERFORMANCE GUARANTEES; RANDOM SUBSETS; SPECTRAL TECHNIQUES; STRUCTURE FROM MOTION;

COLLABORATIVE FILTERING;

EID: 84858742642     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. R. H. Keshavan, A. Montanari, and S. Oh. Matrix completion from a few entries. arXiv:0901.3150, January 2009.
2. A. Frieze, R. Kannan, and S. Vempala. Fast monte-carlo algorithms for finding low-rank approximations. J. ACM, 51(6):1025-1041, 2004.
3. E. J. Candès and B. Recht. Exact matrix completion via convex optimization. arxiv:0805.4471, 2008.
4. M. Fazel. Matrix Rank Minimization with Applications. PhD thesis, Stanford University, 2002.
5. E. J. Candès and T. Tao. The power of convex relaxation: Near-optimal matrix completion. arXiv:0903.1476, 2009.
6. J-F Cai, E. J. Candès, and Z. Shen. A singular value thresholding algorithm for matrix completion. arXiv:0810.3286, 2008.
7. S. Ma, D. Goldfarb, and L. Chen. Fixed point and Bregman iterative methods for matrix rank minimization. arXiv:0905.1643, 2009.
8. 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.
9. J. Wright, A. Ganesh, S. Rao, and Y. Ma. Robust principal component analysis: Exact recovery of corrupted low-rank matrices. arXiv:0905.0233, 2009.
10. K. Lee and Y. Bresler. Admira: Atomic decomposition for minimum rank approximation. arXiv:0905.0044, 2009.
11. E. J. Candès and Y. Plan. Matrix completion with noise. arXiv:0903.3131, 2009.
12. A. Edelman, T. A. Arias, and S. T. Smith. The geometry of algorithms with orthogonality constraints. SIAM J. Matr. Anal. Appl., 20:303-353, 1999.
13. P.-A. Absil, R. Mahony, and R. Sepulchrer. Optimization Algorithms on Matrix Manifolds. Princeton University Press, 2008.
14. D. Achlioptas and F. McSherry. Fast computation of low-rank matrix approximations. J. ACM, 54(2):9, 2007.