Information theoretic bounds for low-rank matrix completion

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 1508-1512

  Vishwanath, Sriram ^a  

^a The University of Texas at Austin   (United States)

Author keywords

The netflix prize

Indexed keywords

ACHIEVABILITY; COMMUNICATION PROBLEMS; COMPLETION PROBLEM; ERASURE CHANNELS; INFORMATION THEORETIC BOUNDS; LOW-RANK MATRICES; OPTIMAL BOUNDS; THE NETFLIX PRIZE; UNCODED;

INFORMATION THEORY;

COMMUNICATION;

EID: 77955704563     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513545     Document Type: Conference Paper

References (12)

1. A. Singer and M. Cucuringu, "Uniqueness of Low-Rank Matrix Completion by Rigidity Theory", submitted 2009. arXiv:0902.3846.
2. J-F. Cai, E. J. Candès, and Z. Shen, "A singular value thresholding algorithm for matrix completion", Technical report, 2008. arXiv:0810.3286.
3. B. Recht, M. Fazel, and P. A. Parrilo, "Guaranteed minimum rank solutions to linear matrix equations via nuclear norm minimization", preprint (2007), submitted to SIAM Review. arXiv:0706.4138.
4. E. J. Candès and T. Tao, "The power of convex relaxation: Near-optimal matrix completion", IEEE Trans. Inform. Theory, to appear. arXiv:0903.1476.
5. M. Fazel, E. Candès, B. Recht, and P. Parrilo, "Compressed sensing and robust recovery of low rank matrices", Proc. Asilomar Conference, Pacific Grove, CA, October 2008.
6. E. J. Candès and Y. Plan, "Matrix completion with noise," Proceedings of the IEEE, to appear. arXiv:0903.3131.
7. R. Keshavan, A. Montanari and S. Oh "Learning low rank matrices from O(n) entries," Proc. Allerton Conference, 2008. arXiv:0812.2599.
8. T. Cover and J. Thomas, "Elements of Information Theory", Wiley 1991.
9. P. H. Algoet and T. Cover, "A Sandwich Proof of the Shannon-McMillan-Breiman Theorem", The Annals of Probability, Vol. 16, No. 2, pp. 899-909, 1988.
10. A. J. Thomasian, "An Elementary Proof of the AEP of Information Theory", The Annals of Mathematical Statistics, Vol. 31, No. 2, pp. 452-456, 1960.
11. T. Ho, R. Koetter, M. Medard, D. R. Karger and M. Effros, "The Benefits of Coding over Routing in a Randomized Setting", Proc. IEEE International Symposium on Information Theory, 2003.
12. J. Bourgain, V. Vu and P. Wood, "On the singularity probability of discrete random matrices", arXiv:0905.0461.