Fetching the paper…
Reading the bibliography…
The analysis of nonconvex matrix completion has recently attracted much attention in the community of machine learning thanks to its computational convenience.
The rotation of eigenvectors by a perturbation. iii
Chandler Davis and William Morton Kahan · 1970
Earlier work this paper cites.
Perturbation bounds for the polar decomposition
Roy Mathias · 1993
Earlier work this paper cites.
Kernel matrix completion by semidefinite programming
Thore Graepel · 2002
Earlier work this paper cites.
Completely bounded maps and operator algebras , volume 78
Vern Paulsen · 2002
Earlier work this paper cites.
Fast maximum margin matrix factorization for collaborative prediction
Jasson DM Rennie and Nathan Srebro · 2005
Earlier work this paper cites.
Exact matrix completion via convex optimization
Emmanuel J Candès and Benjamin Recht · 2009
Earlier work this paper cites.
The power of convex relaxation: Near-optimal matrix completion
Emmanuel J Candès and Terence Tao · 2010
Earlier work this paper cites.
A nonparametric Bayesian model for kernel matrix completion
John Paisley and Lawrence Carin · 2010
Earlier work this paper cites.
Rank aggregation via nuclear norm minimization
David F Gleich and Lek-heng Lim · 2011
Earlier work this paper cites.
Recovering low-rank matrices from few coefficients in any basis
David Gross · 2011
Earlier work this paper cites.
A simpler approach to matrix completion
Benjamin Recht · 2011
Earlier work this paper cites.
On robust regression with high-dimensional predictors
Noureddine El Karoui, Derek Bean, Peter J Bickel, Chinghway Lim, and Bin Yu · 2013
Earlier work this paper cites.
Low-rank matrix completion using alternating minimization
Prateek Jain, Praneeth Netrapalli, and Sujay Sanghavi · 2013
Earlier work this paper cites.
Universal matrix completion
Srinadh Bhojanapalli and Prateek Jain · 2014
Earlier work this paper cites.
Understanding alternating minimization for matrix completion
Moritz Hardt · 2014
Cited alongside, same era.
Fast matrix completion without the condition number
Moritz Hardt and Mary Wootters · 2014
Cited alongside, same era.
Phase retrieval via wirtinger flow: Theory and algorithms
Emmanuel J Candes, Xiaodong Li, and Mahdi Soltanolkotabi · 2015
Cited alongside, same era.
Incoherence-optimal matrix completion
Yudong Chen · 2015
Cited alongside, same era.
Yudong Chen and Martin J Wainwright · 2015
Cited alongside, same era.
An introduction to matrix concentration inequalities
Joel A Tropp et al · 2015
Cited alongside, same era.
Fast algorithms for robust PCA via gradient descent
Xinyang Yi, Dohyung Park, Yudong Chen, and Constantine Caramanis · 2016
Later among the works it cites.
Qinqing Zheng and John Lafferty · 2016
Later among the works it cites.
Entrywise eigenvector analysis of random matrices with low expected rank
Emmanuel Abbe, Jianqing Fan, Kaizheng Wang, and Yiqiao Zhong · 2017
Later among the works it cites.
No spurious local minima in nonconvex low rank problems: A unified geometric analysis
Rong Ge, Chi Jin, and Yi Zheng · 2017
Later among the works it cites.
Implicit regularization in matrix factorization
Suriya Gunasekar, Blake E Woodworth, Srinadh Bhojanapalli, Behnam Neyshabur, and Nati Srebro · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A nonconvex optimization framework for low rank matrix estimation
Tuo Zhao, Zhaoran Wang, and Han Liu · 2015
Cited alongside, same era.
A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements
Qinqing Zheng and John Lafferty · 2015
Cited alongside, same era.
Sharp nonasymptotic bounds on the norm of random matrices with independent entries
Afonso S Bandeira, Ramon Van Handel, et al · 2016
Cited alongside, same era.
Optimal rates of convergence for noisy sparse phase retrieval via thresholded wirtinger flow
T Tony Cai, Xiaodong Li, Zongming Ma, et al · 2016
Cited alongside, same era.
Matrix completion has no spurious local minimum
Rong Ge, Jason D Lee, and Tengyu Ma · 2016
Cited alongside, same era.
Recovery guarantee of weighted low-rank approximation via alternating minimization
Yuanzhi Li, Yingyu Liang, and Andrej Risteski · 2016
Cited alongside, same era.
Cong Ma, Kaizheng Wang, Yuejie Chi, and Yuxin Chen · 2017
Later among the works it cites.
A Unified Computational and Statistical Framework for Nonconvex Low-rank Matrix Estimation
Lingxiao Wang, Xiao Zhang, and Quanquan Gu · 2017
Later among the works it cites.
The global optimization geometry of nonsymmetric matrix factorization and sensing
Zhihui Zhu, Qiuwei Li, Gongguo Tang, and Michael B Wakin · 2017
Later among the works it cites.
Gradient descent with random initialization: Fast global convergence for nonconvex phase retrieval
Yuxin Chen, Yuejie Chi, Jianqing Fan, and Cong Ma · 2018
Later among the works it cites.
The leave-one-out approach for matrix completion: Primal and dual analysis
Lijun Ding and Yudong Chen · 2018
Later among the works it cites.
A geometric analysis of phase retrieval
Ju Sun, Qing Qu, and John Wright · 2018
Later among the works it cites.
A simple SVD algorithm for finding hidden partitions
Van Vu · 2018
Later among the works it cites.
Model-free nonconvex matrix completion: Local minima analysis and applications in memory-efficient kernel PCA
Ji Chen and Xiaodong Li · 2019
Closest in time.
Matrix completion from noisy entries
Raghunandan H Keshavan, Andrea Montanari, and Sewoong Oh · 2078
Closest in time.