Fetching the paper…
Reading the bibliography…
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entries.
Adaptive estimation of a quadratic functional by model selection
B. Laurent and P. Massart · 2000
Earlier work this paper cites.
On large random almost Euclidean bases
R. Vershynin · 2000
Earlier work this paper cites.
Database-friendly random projections: Johnson-Lindenstrauss with binary coins
D. Achlioptas · 2003
Earlier work this paper cites.
Lambertian reflectance and linear subspaces
R. Basri and D.W. Jacobs · 2003
Earlier work this paper cites.
Decoding by linear programming
E. J. Candès and T. Tao · 2005
Earlier work this paper cites.
Stable signal recovery from incomplete and inaccurate measurements
E.J. Candès, J.K. Romberg, and T. Tao · 2006
Earlier work this paper cites.
Math 280 lecture notes, 2007
R. Vershynin · 2006
Earlier work this paper cites.
The Dantzig selector: statistical estimation when
E. J. Candès and T. Tao · 2007
Earlier work this paper cites.
Guaranteed minimum rank solutions of matrix equations via nuclear norm minimization
B. Recht, M. Fazel, and P. Parrilo · 2007
Earlier work this paper cites.
A singular value thresholding algorithm for matrix completion
J-F. Cai, E. J. Candès, and Z. Shen · 2008
Cited alongside, same era.
Compressed sensing and robust recovery of low rank matrices
M. Fazel, E. Candes, B. Recht, and P. Parrilo · 2008
Cited alongside, same era.
Simultaneous analysis of Lasso and Dantzig selector
P. Bickel, Y. Ritov, and A. Tsybakov · 2009
Cited alongside, same era.
Robust principal component analysis?
E. J. Candès, X. Li, Y. Ma, and J. Wright · 2009
Cited alongside, same era.
The power of convex relaxation: Near-optimal matrix completion
E. J. Candès and T. Tao · 2009
Cited alongside, same era.
Matrix completion with noise
E.J. Candès and Y. Plan · 2009
Cited alongside, same era.
Recovering low-rank matrices from few coefficients in any basis, 2009
D. Gross · 2009
Later among the works it cites.
Quantum state tomography via compressed sensing
D. Gross, Y.K. Liu, S.T. Flammia, S. Becker, and J. Eisert · 2009
Later among the works it cites.
Guaranteed rank minimization via singular value projection
R.M.P. Jain and I.S. Dhillon · 2009
Later among the works it cites.
Matrix completion from a few entries
R.H. Keshavan, S. Oh, and A. Montanari · 2009
Later among the works it cites.
Admira: Atomic decomposition for minimum rank approximation
K. Lee, Y. Bresler, H. Munthe-Kaas, A. Lundervold, S. Gaubert, M. Sharify, CJ Cotter, M. Colombeau, M. Hutzenthaler, A. Jentzen, et al · 2009
Later among the works it cites.
Fixed point and Bregman iterative methods for matrix rank minimization
S. Ma, D. Goldfarb, and L. Chen · 2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Exact matrix completion via convex optimization
E.J. Candes and B. Recht · 2009
Cited alongside, same era.
SET: an algorithm for consistent matrix completion
W. Dai and O. Milenkovic · 2009
Cited alongside, same era.
Stability and instance optimality for Gaussian measurements in compressed sensing
P. Wojtaszczyk · 2009
Later among the works it cites.
Matrix completion from noisy entries
R.H. Keshavan, A. Montanari, and S. Oh · 2027
Closest in time.