Completing any low-rank matrix, provably

Journal of Machine Learning Research

Volumn 16, Issue , 2015, Pages 2999-3034

  Chen, Yudong ^a   Bhojanapalli, Srinadh ^b   Sanghavi, Sujay ^b   Ward, Rachel ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

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

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Coherence; Leverage score; Matrix completion; Nuclear norm; Weighted nuclear norm

Indexed keywords

COHERENT LIGHT; PROBABILITY DISTRIBUTIONS; RECOVERY;

LEVERAGE SCORE; MATRIX COMPLETION; NUCLEAR NORM; SAMPLING PROCEDURES; SAMPLING STRATEGIES; STRUCTURAL CONSTRAINTS; TWO-PHASE SAMPLINGS; WEIGHTED NUCLEAR NORM;

KNOWLEDGE MANAGEMENT;

EID: 84961755668     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (33)

1. D. Achlioptas and F. McSherry. Fast computation of low-rank matrix approximations. Journal of the ACM, 54(2):9, 2007.
2. D. Achlioptas, Z. Karnin, and E. Liberty. Matrix entry-wise sampling: simple is best. http://cs-www.cs. yale. edu/homes/el327/papers/matrixSampling. pdf, 2013.
3. S. Arora, E. Hazan, and S. Kale. A fast random sampling algorithm for sparsifying matrices. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pages 272-279. Springer, 2006.
4. C. Boutsidis, M. Mahoney, and P. Drineas. An improved approximation algorithm for the column subset selection problem. In Proceedings of the Symposium on Discrete Algorithms, pages 968-977, 2009.
5. N. Burq, S. Dyatlov, R. Ward, and M. Zworski. Weighted eigenfunction estimates with applications to compressed sensing. SIAM Journal on Mathematical Analysis, 44(5):3481-3501, 2012.
6. J. Cai, E. Candès, and Z. Shen. A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization, 20(4):1956-1982, 2010.
7. E. Candès and Y. Plan. Matrix completion with noise. Proceedings of the IEEE, 98(6):925-936, 2010.
8. E. Candès and B. Recht. Exact matrix completion via convex optimization. Foundations of Computational mathematics, 9(6):717-772, 2009.
9. E. Candès and T. Tao. The power of convex relaxation: Near-optimal matrix completion. IEEE Transactions on Information Theory, 56(5):2053-2080, 2010.
10. E. Candès, X. Li, Y. Ma, and J. Wright. Robust principal component analysis? Journal of the ACM, 58(3):11, 2011.
11. V. Chandrasekaran, S. Sanghavi, P. Parrilo, and A. Willsky. Rank-sparsity incoherence for matrix decomposition. SIAM Journal on Optimization, 21(2):572-596, 2011.
12. S. Chatterjee and A. Hadi. Influential observations, high leverage points, and outliers in linear regression. Statistical Science, 1(3):379-393, 1986.
13. Y. Chen. Incoherence-optimal matrix completion. IEEE Transactions on Information Theory, 61(5):2909-2923, 2015.
14. Y. Chen, A. Jalali, S. Sanghavi, and C. Caramanis. Low-rank matrix recovery from errors and erasures. IEEE Transactions on Information Theory, 59(7):4324-4337, 2013.
15. P. Drineas and A. Zouzias. A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality. Information Processing Letters, 111(8):385-389, 2011.
16. P. Drineas, M. Magdon-Ismail, M. Mahoney, and D. Woodruff. Fast approximation of matrix coherence and statistical leverage. Journal of Machine Learning Research, 13:3475-3506, 2012.
17. M. Fazel. Matrix Rank Minimization with Applications. PhD thesis, Stanford University, 2002.
18. R. Foygel, O. Shamir, N. Srebro, and R. Salakhutdinov. Learning with the weighted tracenorm under arbitrary sampling distributions. In Advances in Neural Information Processing Systems 24, pages 2133-2141. 2011.
19. D. Gross. Recovering low-rank matrices from few coefficients in any basis. IEEE Transactions on Information Theory, 57(3):1548-1566, 2011.
20. P. Jain, P. Netrapalli, and S. Sanghavi. Low-rank matrix completion using alternating minimization. In Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing, pages 665-674. ACM, 2013.
21. R. H. Keshavan, A. Montanari, and S. Oh. Matrix completion from a few entries. IEEE Transactions on Information Theory, 56(6):2980-2998, 2010.
22. F. Krahmer and R. Ward. Stable and robust sampling strategies for compressive imaging. IEEE Transactions on Image Processing, 23(2):612-622, 2014.
23. A. Krishnamurthy and A. Singh. Low-rank matrix and tensor completion via adaptive sampling. In Advances in Neural Information Processing Systems 26, pages 836-844, 2013.
24. A. Krishnamurthy and A. Singh. On the power of adaptivity in matrix completion and approximation. arXiv preprint arXiv:1407.3619, 2014.
25. Z. Lin, M. Chen, L. Wu, and Y. Ma. The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices. UIUC Technical Report UILU-ENG-09-2215, 2009.
26. M. Mahoney. Randomized algorithms for matrices and data. Foundations and Trends in Machine Learning, 3(2):123-224, 2011.
27. S. Negahban and M. Wainwright. Restricted strong convexity and weighted matrix completion: Optimal bounds with noise. Journal of Machine Learning Research, 13:1665-1697, 2012.
28. 2-minimization. Journal of Approximation Theory, 164(5):517-533, 2012.
29. B. Recht. A simpler approach to matrix completion. Journal of Machine Learning Research, 12:3413-3430, 2011.
30. D. Spielman and N. Srivastava. Graph sparsification by effective resistances. SIAM Journal on Computing, 40(6):1913-1926, 2011.
31. N. Srebro and R. Salakhutdinov. Collaborative filtering in a non-uniform world: Learning with the weighted trace norm. In Advances in Neural Information Processing Systems, pages 2056-2064, 2010.
32. J. Tropp. User-friendly tail bounds for sums of random matrices. Foundations of Computational Mathematics, 12(4):389-434, 2012.
33. X. Yang and G. Karniadakis. Reweighted h minimization method for stochastic elliptic differential equations. Journal of Computational Physics, 248:87-108, 2013.