Fetching the paper…
Reading the bibliography…
In this paper we study the problem of recovering a low-rank matrix from linear measurements.
Numerical computation of principal components when several observations are missing
A. Ruhe · 1974
Earlier work this paper cites.
Matrix Rank Minimization with Applications
M. Fazel · 2002
Earlier work this paper cites.
Decoding by linear programming
E. J. Candès and T. Tao · 2005
Earlier work this paper cites.
Fast maximum margin matrix factorization for collaborative prediction
J. Rennie and N. Srebro · 2005
Earlier work this paper cites.
Netflix update: Try this at home, December 2006
S. Funk · 2006
Earlier work this paper cites.
Fast computation of low-rank matrix approximations
D. Achlioptas and F. McSherry · 2007
Earlier work this paper cites.
Signal recovery from random measurements via orthogonal matching pursuit
J. A. Tropp and A. C. Gilbert · 2007
Earlier work this paper cites.
The restricted isometry property and its implications for compressed sensing
E. J. Candès · 2008
Earlier work this paper cites.
Iterative hard thresholding for compressed sensing
T. Blumensath and M. E. Davies · 2009
Earlier work this paper cites.
Exact matrix completion via convex optimization
E. J. Candès and B. Recht · 2009
Earlier work this paper cites.
Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property
R. Garg and R. Khandekar · 2009
Earlier work this paper cites.
Guaranteed rank minimization via singular value projection
R. Meka, P. Jain, and I. S. Dhillon · 2009
Earlier work this paper cites.
CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
D. Needell and J. A. Tropp · 2009
Earlier work this paper cites.
Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
D. Needell and R. Vershynin · 2009
Cited alongside, same era.
A singular value thresholding algorithm for matrix completion
J. F. Cai, E. J. Candès, and Z. Shen · 2010
Cited alongside, same era.
Matrix completion from a few entries
R. H. Keshavan, A. Montanari, and S. Oh · 2010
Cited alongside, same era.
Practical large-scale optimization for max-norm regularization
J. Lee, B. Recht, N. Srebro, J. A. Tropp, and R. Salakhutdinov · 2010
Cited alongside, same era.
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
B. Recht, M. Fazel, and P. A. Parrilo · 2010
Cited alongside, same era.
Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements
E. J. Candès and Y. Plan · 2011
Understanding alternating minimization for matrix completion
Moritz Hardt · 2014
Later among the works it cites.
Algorithms and Theory for Clustering and Nonconvex Quadratic Programming
M. Soltanolkotabi · 2014
Later among the works it cites.
Dropping convexity for faster semi-definite optimization
S. Bhojanapalli, A. Kyrillidis, and S. Sanghavi · 2015
Closest in time.
Optimal rates of convergence for noisy sparse phase retrieval via thresholded Wirtinger flow
T. T. Cai, X. Li, and Z. Ma · 2015
Closest in time.
Phase retrieval via wirtinger flow: Theory and algorithms
E. J. Candès, X. Li, and M. Soltanolkotabi · 2015
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Recovering low-rank matrices from few coefficients in any basis
D. Gross · 2011
Cited alongside, same era.
A simpler approach to matrix completion
B. Recht · 2011
Cited alongside, same era.
Efficient algorithms for collaborative filtering
R. H. Keshavan · 2012
Cited alongside, same era.
Low-rank matrix completion using alternating minimization
P. Jain, P. Netrapalli, and S. Sanghavi · 2013
Cited alongside, same era.
Parallel stochastic gradient algorithms for large-scale matrix completion
B. Recht and C. Ré · 2013
Cited alongside, same era.
Phase retrieval from coded diffraction patterns
E. J. Candès, X. Li, and M. Soltanolkotabi · 2014
Cited alongside, same era.
Y. Chen and M. J. Wainwright · 2015
Closest in time.
Sharp time-data tradeoffs for linear inverse problems
S. Oymak, B. Recht, and M. Soltanolkotabi · 2015
Closest in time.
Guaranteed matrix completion via non-convex factorization
R. Sun and Z. Luo · 2015
Closest in time.
Global convergence of stochastic gradient descent for some nonconvex matrix problems
C. De Sa, K. Olukotun, and C. Ré · 2015
Closest in time.
A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements
Q. Zheng and J. Lafferty · 2015
Closest in time.
Nonconvex low rank matrix factorization via inexact first order oracle, 2015
T. Zhao, Z. Wang, and H. Liu · 2015
Closest in time.
An overview of low-rank matrix recovery from incomplete observations
M. A. Davenport and J. Romberg · 2016
Closest in time.