Low-rank matrix completion with noisy observations: A quantitative comparison

2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009

Volumn , Issue , 2009, Pages 1216-1222

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

^a Stanford University   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COLLABORATIVE FILTERING; DATA MATRICES; EFFICIENT ALGORITHM; LOW-RANK MATRICES; MATRIX COMPLETION; MATRIX COMPLETION PROBLEMS; NOISY OBSERVATIONS; NUMERICAL RESULTS; OBSERVED SAMPLES; PRACTICAL IMPORTANCE; QUANTITATIVE COMPARISON; SIMULATION PLATFORM;

ALGORITHMS; COMPUTER VISION; NUMERICAL ANALYSIS; WIRELESS SENSOR NETWORKS;

MATRIX ALGEBRA;

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

References (16)

1. "Netflix prize," http://www.netflixprize.com/.
2. P. Chen and D. Suter, "Recovering the missing components in a large noisy low-rank matrix: application to sfm," Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol. 26, no. 8, pp. 1051-1063, Aug. 2004.
3. S. Oh, , A.Karbasi, and A. Montanari, "Sensor network localization from local connectivity : performance analysis for the MDS-MAP algorithm," 2009, submitted.
4. E. J. Candès and B. Recht, "Exact matrix completion via convex optimization," 2008, arxiv:0805.4471.
5. R. H. Keshavan, A. Montanari, and S. Oh, "Matrix completion from a few entries," January 2009, arXiv:0901.3150.
6. E. J. Candès and T. Tao, "The power of convex relaxation: Near-optimal matrix completion," 2009, arXiv:0903.1476.
7. E. J. Candès and Y. Plan, "Matrix completion with noise," 2009, arXiv:0903.3131.
8. R. H. Keshavan, A. Montanari, and S. Oh, "Matrix completion from noisy entries," June 2009, arXiv:0906.2027.
9. K. Toh and S. Yun, "An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems," 2009, http://www.math.nus.edu.sg/~matys.
10. S. Ma, D. Goldfarb, and L. Chen, "Fixed point and Bregman iterative methods for matrix rank minimization," 2009, arXiv:0905.1643.
11. K. Lee and Y. Bresler, "Admira: Atomic decomposition for minimum rank approximation," 2009, arXiv:0905.0044.
12. D. Needell and J. A. Tropp, "Cosamp: Iterative signal recovery from incomplete and inaccurate samples," Applied and Computational Harmonic Analysis, vol. 26, no. 3, pp. 301-321, Apr 2008. [Online]. Available: http://arxiv.org/abs/0803.2392
13. Z. Wang, S. Zheng, S. Boyd, and Y. Ye, "Further relaxations of the sdp approach to sensor network localization," Tech. Rep., 2006.
14. "Jester jokes," http://eigentaste.berkeley.edu/user/index.php.
15. "Movielens," http://www.movielens.org.
16. K. Goldberg, T. Roeder, D. Gupta, and C. Perkins, "Eigentaste: A constant time collaborative filtering algorithm," pp. 133-151, July 2001.