Fetching the paper…
Reading the bibliography…
We consider the problem of reconstructing a low-rank matrix from a small subset of its entries.
Minimization of functions having lipschitz continuous first partial derivatives
L. Armijo · 1966
Earlier work this paper cites.
The geometry of algorithms with orthogonality constraints
A. Edelman, T. A. Arias, and S. T. Smith · 1999
Earlier work this paper cites.
Eigentaste: A constant time collaborative filtering algorithm, July 2001
K. Goldberg, T. Roeder, D. Gupta, and C. Perkins · 2001
Earlier work this paper cites.
Recovering the missing components in a large noisy low-rank matrix: application to sfm
P. Chen and D. Suter · 2004
Earlier work this paper cites.
Further relaxations of the sdp approach to sensor network localization
Z. Wang, S. Zheng, S. Boyd, and Y. Ye · 2006
Earlier work this paper cites.
Optimization Algorithms on Matrix Manifolds
P.-A. Absil, R. Mahony, and R. Sepulchrer · 2008
Earlier work this paper cites.
A singular value thresholding algorithm for matrix completion
J-F Cai, E. J. Candès, and Z. Shen · 2008
Earlier work this paper cites.
Exact matrix completion via convex optimization
E. J. Candès and B. Recht · 2008
Earlier work this paper cites.
Learning low rank matrices from O ( n ) O(n) entries
R. H. Keshavan, A. Montanari, and S. Oh · 2008
Earlier work this paper cites.
Cosamp: Iterative signal recovery from incomplete and inaccurate samples
D. Needell and J. A. Tropp · 2008
Earlier work this paper cites.
A remark on global positioning from local distances
A. Singer · 2008
Cited alongside, same era.
Iterative hard thresholding for compressed sensing
T. Blumensath and M. E. Davies · 2009
Cited alongside, same era.
E. J. Candès and Y. Plan · 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.
Rank-sparsity incoherence for matrix decomposition
V. Chandrasekaran, S. Sanghavi, P. A. Parrilo, and A. S. Willsky · 2009
Cited alongside, same era.
Admira: Atomic decomposition for minimum rank approximation
K. Lee and Y. Bresler · 2009
Closest in time.
Fixed point and Bregman iterative methods for matrix rank minimization
S. Ma, D. Goldfarb, and L. Chen · 2009
Closest in time.
Spectral regularization algorithms for learning large incomplete matrices
R. Mazumder, T. Hastie, and R. Tibshirani · 2009
Closest in time.
Guaranteed rank minimization via singular value projection
R. Meka, P. Jain, and I. S. Dhillon · 2009
Closest in time.
Sensor network localization from local connectivity : performance analysis for the MDS-MAP algorithm
S. Oh, , A. Karbasi, and A. Montanari · 2009
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Set: an algorithm for consistent matrix completion
W. Dai and O. Milenkovic · 2009
Cited alongside, same era.
Recovering low-rank matrices from few coefficients in any basis
D. Gross · 2009
Cited alongside, same era.
Quantum state tomography via compressed sensing
D. Gross, Y. Liu, S. T. Flammia, S. Becker, and J. Eisert · 2009
Cited alongside, same era.
Matrix completion from a few entries
R. H. Keshavan, A. Montanari, and S. Oh · 2009
Cited alongside, same era.
Matrix completion from noisy entries
R. H. Keshavan, A. Montanari, and S. Oh · 2009
Cited alongside, same era.
http://eigentaste.berkeley.edu/user/index.php
Jester jokes
Cited in the paper.
http://www.movielens.org
Movielens
Cited in the paper.
A simpler approach to matrix completion
B. Recht · 2009
Closest in time.
Uniqueness of low-rank matrix completion by rigidity theory
A. Singer and M. Cucuringu · 2009
Closest in time.
An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems
K. Toh and S. Yun · 2009
Closest in time.
Robust principal component analysis: Exact recovery of corrupted low-rank matrices
J. Wright, A. Ganesh, S. Rao, and Y. Ma · 2009
Closest in time.