Matrix completion with noise

Proceedings of the IEEE

Volumn 98, Issue 6, 2010, Pages 925-936

  Candes, Emmanuel J ^a   Plan, Yaniv ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Compressed sensing; Duality in optimization; Low rank matrices; Matrix completion; Nuclear norm minimization; Oracle inequalities; Semidefinite programming

Indexed keywords

COLLABORATIVE FILTERING; COMPRESSED SENSING; CONVEX OPTIMIZATION; RECOVERY; REMOTE SENSING;

DUALITY IN OPTIMIZATION; LOW-RANK MATRICES; MATRIX COMPLETION; NUCLEAR NORM MINIMIZATIONS; ORACLE INEQUALITIES; SEMI-DEFINITE PROGRAMMING;

MATRIX ALGEBRA;

EID: 77952741387     PISSN: 00189219     EISSN: None     Source Type: Journal    
DOI: 10.1109/JPROC.2009.2035722     Document Type: Article

References (35)

1. National Climatic Data Center. [Online]. Available: http://www.ncdc.noaa. gov/oa/ncdc.html
2. IEEE Signal Processing Mag. (Special Issue on Sensing, Sampling, and Compression), vol.25, Mar. 2008.
3. Y. Amit, M. Fink, N. Srebro, and S. Ullman, "Uncovering shared structures in multiclass classification," in Proc. 24th Int. Conf. Machine Learn., 2007. (Pubitemid 47275044)
4. A. Argyriou, T. Evgeniou, and M. Pontil, "Multi-task feature learning," Neural Inf. Process. Syst., 2007.
5. Y. Azar, A. Fiat, A. Karlin, F. McSherry, and J. Saia, "Spectral analysis of data," in Proc. 33rd Annu. ACM Symp. Theory Comput., New York, 2001, pp. 619-626. (Pubitemid 32865779)
6. C. Beck and R. D'Andrea, "Computational study and comparisons of LFT reducibility methods," in Proc. Amer. Contr. Conf., 1998.
7. P. Biswas, T.-C. Lian, T.-C. Wang, and Y. Ye, "Semidefinite programming based algorithms for sensor network localization," ACM Trans. Sens. Netw., vol.2, no.2, pp. 188-220, 2006. (Pubitemid 44188494)
8. J.-F. Cai, E. J. Cand̀es, and Z. Shen, "A singular value thresholding algorithm for matrix completion," submitted for publication.
9. J.-F. Cai, E. J. Cand̀es, and Z. Shen. (2008). A singular value thresholding algorithm for matrix completion, Tech. Rep. [Online]. Available: http://arxiv.org/abs/0810.3286
10. E. J. Cand̀es and B. Recht, "Exact matrix completion via convex optimization," Found. Comput. Math., to be published.
11. E. J. Cand̀es, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol.52, no.2, pp. 489-509, 2006. (Pubitemid 43174093)
12. E. J. Cand̀es and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol.51, no.12, pp. 4203-4215, 2005. (Pubitemid 41800353)
13. E. J. Cand̀es and T. Tao, "The Dantzig selector: Statistical estimation when p is much larger than n," Ann. Statist., vol.35, 2007.
14. E. J. Candès and T. Tao. (2009). The power of convex relaxation: Near-optimal matrix completion, Tech. Rep., submitted for publication. [Online]. Available: http://arxiv. org/abs/0903.1476
15. P. Chen and D. Suter, "Recovering the missing components in a large noisy low-rank matrix: Application to SFM source," IEEE Trans. Pattern Anal. Machine Intell., vol.26, no.8, pp. 1051-1063, 2004.
16. A. L. Chistov and D. Y. Grigoriev, "Complexity of quantifier elimination in the theory of algebraically closed fields," in Proc. 11th Symp. Math. Found. Comput. Sci., vol.176, Lecture Notes in Computer Science, 1984, pp. 17-31.
17. D. Donoho, "For most large underdetermined systems of linear equations, the minimal L1-norm solution is also the sparsest solution," Commun. Pure Appl. Math., vol.59, no.6, Jun. 2006. (Pubitemid 43667226)
18. D. L. Donoho and J. Tanner, "Counting faces of randomly-projected polytopes when the projection radically lowers dimension," J. Amer. Math. Soc., to be published.
19. M. Fazel, "Matrix rank minimization with applications," Ph.D. dissertation, Stanford Univ., Stanford, CA, 2002.
20. M. Fazel, E. Candès, B. Recht, and P. Parrilo, "Compressed sensing and robust recovery of low rank matrices," in Proc. 2008 42nd Asilomar Conf. Signals, Syst. Comput., Pacific Grove, CA, Oct. 2008.
21. M. Fazel, H. Hindi, and S. Boyd, "Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices," in Proc. Amer. Contr. Conf., Jun. 2003.
22. A. Gilbert, S. Muthukrishnan, and M. Strauss, "Improved time bounds for near-optimal sparse Fourier representation," in Proc. Wavelets XI SPIE Opt. Photon., San Diego, CA, 2005. (Pubitemid 43105323)
23. D. Goldberg, D. Nichols, B. M. Oki, and D. Terry, "Using collaborative filtering to weave an information tapestry," Commun. ACM, vol. 35, pp. 61-70, 1992.
24. R. Keshavan, S. Oh, and A. Montanari, "Matrix completion from a few entries," in Proc. ISIT'09, 2009, submitted for publication.
25. R. H. Keshavan, A. Montanari, and S. Oh. (2009). Matrix completion from noisy entries. [Online]. Available: http://arxiv.org/abs/0906.2027
26. Z. Liu and L. Vandenberghe, "Interior-point method for nuclear norm approximation with application to system identification," submitted for publication.
27. S. Ma, D. Goldfarb, and L. Chen, "Fixed point and Bregman iterative methods for matrix rank minimization," Tech. Rep., 2008.
28. M. Mesbahi and G. P. Papavassilopoulos, "On the rank minimization problem over a positive semidefinite linear matrix inequality," IEEE Trans. Autom. Control, vol.42, no.2, pp. 239-243, 1997. (Pubitemid 127760583)
29. B. Recht, M. Fazel, and P. Parrilo, "Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization," submitted for publication.
30. R. O. Schmidt, "Multiple emitter location and signal parameter estimation," IEEE Trans. Antennas Propag., vol.34, no.3, pp. 276-280, 1986. (Pubitemid 16613653)
31. A. Singer, "A remark on global positioning from local distances," Proc. Nat. Acad. Sci. USA, vol.105, no.28, pp. 9507-9511, 2008. (Pubitemid 352031330)
32. A. Singer and M. Cucuringu, "Uniqueness of low-rank matrix completion by rigidity theory," submitted for publication.
33. C. Tomasi and T. Kanade, "Shape and motion from image streams under orthography: A factorization method," Int. J. Computer. Vision, vol.9, no.2, pp. 137-154, 1992. (Pubitemid 23621943)
34. M. Vetterli, P. Marziliano, and T. Blu, "Sampling signals with finite rate of innovation," IEEE Trans. Signal Process., vol.50, no.6, pp. 1417-1428, 2002. (Pubitemid 34822552)
35. C. C. Weng and P. P. Vaidyanathan, "Matrix completion for DOA estimation," Unpublished.