Leave-one-out Approach for Matrix Completion: Primal and Dual Analysis

C. Davis and W. M. Kahan, “The rotation of eigenvectors by a perturbation. III,” SIAM Journal on Numerical Analysis , vol. 7, no. 1, pp. 1–46, 1970

1970

Earlier work this paper cites.

R.-C. Li, “Relative perturbation theory: II. Eigenspace and singular subspace variations,” SIAM Journal on Matrix Analysis and Applications , vol. 20, no. 2, pp. 471–492, 1998

1998

Earlier work this paper cites.

H. Kushner and G. G. Yin, Stochastic approximation and recursive algorithms and applications . Springer Science & Business Media, 2003, vol. 35

2003

Earlier work this paper cites.

E. J. Candès and B. Recht, “Exact matrix completion via convex optimization,” Foundations of Computational mathematics , vol. 9, no. 6, p. 717, 2009

2009

Earlier work this paper cites.

E. J. Candès and T. Tao, “The power of convex relaxation: Near-optimal matrix completion,” IEEE Transactions on Information Theory , vol. 56, no. 5, pp. 2053–2080, 2010

2010

Earlier work this paper cites.

P. Jain, R. Meka, and I. S. Dhillon, “Guaranteed rank minimization via singular value projection,” in Advances in Neural Information Processing Systems , 2010, pp. 937–945

2010

Earlier work this paper cites.

R. H. Keshavan, A. Montanari, and S. Oh, “Matrix completion from a few entries,” IEEE Transactions on Information Theory , vol. 56, no. 6, pp. 2980–2998, 2010

2010

Earlier work this paper cites.

B. Recht, M. Fazel, and P. A. Parrilo, “Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,” SIAM review , vol. 52, no. 3, pp. 471–501, 2010

2010

Earlier work this paper cites.

E. J. Candès, X. Li, Y. Ma, and J. Wright, “Robust principal component analysis?” Journal of the ACM (JACM) , vol. 58, no. 3, p. 11, 2011

2011

Earlier work this paper cites.

D. Gross, “Recovering low-rank matrices from few coefficients in any basis,” IEEE Transactions on Information Theory , vol. 57, no. 3, pp. 1548–1566, 2011

2011

Earlier work this paper cites.

B. Recht, “A simpler approach to matrix completion,” Journal of Machine Learning Research , vol. 12, no. Dec, pp. 3413–3430, 2011

2011

Earlier work this paper cites.

J. A. Tropp, “User-friendly tail bounds for sums of random matrices,” Foundations of computational mathematics , vol. 12, no. 4, pp. 389–434, 2012

2012

Earlier work this paper cites.

Y. Chen, A. Jalali, S. Sanghavi, and C. Caramanis, “Low-rank matrix recovery from errors and erasures,” IEEE Transactions on Information Theory , vol. 59, no. 7, pp. 4324–4337, 2013

2013

Cited alongside, same era.

N. El Karoui, D. Bean, P. J. Bickel, C. Lim, and B. Yu, “On robust regression with high-dimensional predictors,” Proceedings of the National Academy of Sciences , vol. 110, no. 36, pp. 14 557–14 562, 2013

2013

Cited alongside, same era.

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 , 2013, pp. 665–674

2013

Cited alongside, same era.

V. Q. Vu and J. Lei, “Minimax sparse principal subspace estimation in high dimensions,” The Annals of Statistics , vol. 41, no. 6, pp. 2905–2947, 2013

2013

Cited alongside, same era.

E. Abbe, J. Fan, K. Wang, and Y. Zhong, “Entrywise eigenvector analysis of random matrices with low expected rank,” arXiv preprint arXiv:1709.09565 , 2017

Original

2017

Later among the works it cites.

Y. Chen, J. Fan, C. Ma, and K. Wang, “Spectral method and regularized MLE are both optimal for top- k k ranking,” arXiv preprint arXiv:1707.09971 , 2017

Original

2017

Later among the works it cites.

J. Fan, D. Wang, K. Wang, and Z. Zhu, “Distributed estimation of principal eigenspaces,” arXiv preprint arXiv:1702.06488 , 2017

Original

2017

Later among the works it cites.

R. Ge, C. Jin, and Y. Zheng, “No spurious local minima in nonconvex low rank problems: A unified geometric analysis,” arXiv preprint arXiv:1704.00708 , 2017

Original

2017

Later among the works it cites.