Fetching the paper…
Reading the bibliography…
Matrix completion is a basic machine learning problem that has wide applications, especially in collaborative filtering and recommender systems.
Neural networks and principal component analysis: Learning from examples without local minima
Pierre Baldi and Kurt Hornik · 1989
Earlier work this paper cites.
Nonconvergence to unstable points in urn models and stochastic approximations
Robin Pemantle · 1990
Earlier work this paper cites.
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Samuel Burer and Renato DC Monteiro · 2003
Earlier work this paper cites.
Maximum-margin matrix factorization
Nathan Srebro, Rennie, and Tommi S Jaakkola · 2004
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.
Rank, trace-norm and max-norm
Nathan Srebro and Adi Shraibman · 2005
Earlier work this paper cites.
Cubic regularization of Newton method and its global performance
Yurii Nesterov and Boris T Polyak · 2006
Earlier work this paper cites.
Uncovering shared structures in multiclass classification
Yonatan Amit, Michael Fink, Nathan Srebro, and Shimon Ullman · 2007
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 bellkor solution to the netflix grand prize
Yehuda Koren · 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.
Sums of random Hermitian matrices and an inequality by Rudelson
R. Imbuzeiro Oliveira · 2010
Earlier work this paper cites.
Matrix completion from a few entries
Raghunandan H Keshavan, Andrea Montanari, and Sewoong Oh · 2010
Earlier work this paper cites.
Matrix completion from noisy entries
Raghunandan H Keshavan, Andrea Montanari, and Sewoong Oh · 2010
Earlier work this paper cites.
Spectral regularization algorithms for learning large incomplete matrices
Rahul Mazumder, Trevor Hastie, and Robert Tibshirani · 2010
Cited alongside, same era.
Robust principal component analysis?
Emmanuel J Candès, Xiaodong Li, Yi Ma, and John Wright · 2011
Cited alongside, same era.
A simpler approach to matrix completion
Benjamin Recht · 2011
Cited alongside, same era.
A tail inequality for quadratic forms of subgaussian random vectors
Daniel Hsu, Sham M Kakade, and Tong Zhang · 2012
Cited alongside, same era.
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
Sahand Negahban and Martin J Wainwright · 2012
Cited alongside, same era.
Low-rank matrix completion using alternating minimization
Prateek Jain, Praneeth Netrapalli, and Sujay Sanghavi · 2013
Cited alongside, same era.
Escaping from saddle points—online stochastic gradient for tensor decomposition
Rong Ge, Furong Huang, Chi Jin, and Yang Yuan · 2015
Later among the works it cites.
Fast exact matrix completion with finite samples
Prateek Jain and Praneeth Netrapalli · 2015
Later among the works it cites.
Regularized m-estimators with nonconvexity: statistical and algorithmic theory for local optima
Po-Ling Loh and Martin J. Wainwright · 2015
Later among the works it cites.
Guaranteed matrix completion via nonconvex factorization
Ruoyu Sun and Zhi-Quan Luo · 2015
Later among the works it cites.
When are nonconvex problems not scary?
Ju Sun, Qing Qu, and John Wright · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Weighted low-rank approximations
Nathan Srebro and Tommi Jaakkola · 2013
Cited alongside, same era.
1-bit matrix completion
Mark A Davenport, Yaniv Plan, Ewout van den Berg, and Mary Wootters · 2014
Cited alongside, same era.
Understanding alternating minimization for matrix completion
Moritz Hardt · 2014
Cited alongside, same era.
Matrix completion and low-rank svd via fast alternating least squares
Trevor Hastie, Rahul Mazumder, Jason , and Reza Zadeh · 2014
Cited alongside, same era.
Fast matrix completion without the condition number
Moritz Hardt and Mary Wootters · 2014
Cited alongside, same era.
Support recovery without incoherence: A case for nonconvex regularization
Po-Ling Loh and Martin J Wainwright · 2014
Cited alongside, same era.
Global convergence of stochastic gradient descent for some non-convex matrix problems
Christopher De Sa, Christopher Ré, and Kunle Olukotun · 2015
Later among the works it cites.
Low-rank solutions of linear matrix equations via procrustes flow
Stephen Tu, Ross Boczar, Mahdi Soltanolkotabi, and Benjamin Recht · 2015
Later among the works it cites.
A nonconvex optimization framework for low rank matrix estimation
Tuo Zhao, Zhaoran Wang, and Han Liu · 2015
Later among the works it cites.
Afonso S Bandeira, Nicolas Boumal, and Vladislav Voroninski · 2016
Closest in time.
Global Optimality of Local Search for Low Rank Matrix Recovery
S. Bhojanapalli, B. Neyshabur, and N. Srebro · 2016
Closest in time.
Recovery guarantee of weighted low-rank approximation via alternating minimization
Yuanzhi Li, Yingyu Liang, and Andrej Risteski · 2016
Closest in time.
Gradient descent converges to minimizers
Jason D Lee, Max Simchowitz, Michael I Jordan, and Benjamin Recht · 2016
Closest in time.
Qinqing Zheng and John Lafferty · 2016
Closest in time.