Fetching the paper…
Reading the bibliography…
Matrix completion, i.e., the exact and provable recovery of a low-rank matrix from a small subset of its elements, is currently only known to be possible if the matrix satisfies a restrictive structural constraint---known as {\em incoherence}---on its row and column spaces.
Influential observations, high leverage points, and outliers in linear regression
S. Chatterjee and A. Hadi · 1986
Earlier work this paper cites.
Matrix rank minimization with applications
M. Fazel · 2002
Earlier work this paper cites.
A fast random sampling algorithm for sparsifying matrices
S. Arora, E. Hazan, and S. Kale · 2006
Earlier work this paper cites.
Fast computation of low-rank matrix approximations
D. Achlioptas and F. Mcsherry · 2007
Earlier work this paper cites.
An improved approximation algorithm for the column subset selection problem
C. Boutsidis, M. Mahoney, and P. Drineas · 2009
Earlier work this paper cites.
Exact matrix completion via convex optimization
E. Candès and B. Recht · 2009
Earlier work this paper cites.
The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices, October 2009
M. Chen and A. Ganesh · 2009
Earlier work this paper cites.
A simpler approach to matrix completion
B. Recht · 2009
Earlier work this paper cites.
A singular value thresholding algorithm for matrix completion
J. Cai, E. Candès, and Z. Shen · 2010
Earlier work this paper cites.
Matrix completion with noise
E. Candès and Y Plan · 2010
Earlier work this paper cites.
The power of convex relaxation: Near-optimal matrix completion
E. Candès and T. Tao · 2010
Earlier work this paper cites.
Matrix completion from a few entries
R. H. Keshavan, A. Montanari, and S. Oh · 2010
Cited alongside, same era.
Collaborative filtering in a non-uniform world: Learning with the weighted trace norm
R. Salakhutdinov and N. Srebro · 2010
Cited alongside, same era.
Robust principal component analysis?
E. Candès, X. Li, Y. Ma, and J. Wright · 2011
Cited alongside, same era.
Rank-sparsity incoherence for matrix decomposition
V. Chandrasekaran, S. Sanghavi, P. Parrilo, and A. Willsky · 2011
Cited alongside, same era.
A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality
P. Drineas and A. Zouzias · 2011
Cited alongside, same era.
Learning with the weighted trace-norm under arbitrary sampling distributions
Low-rank matrix completion using alternating minimization
P. Jain, P. Netrapalli, and S. Sanghavi · 2012
Later among the works it cites.
Beyond incoherence: Stable and robust sampling strategies for compressive imaging
F. Krahmer and R. Ward · 2012
Later among the works it cites.
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
S. Negahban and M. Wainwright · 2012
Later among the works it cites.
Sparse Legendre expansions via ℓ 1 \ell_{1} -minimization
H. Rauhut and R. Ward · 2012
Later among the works it cites.
User-friendly tail bounds for sums of random matrices
J. Tropp · 2012
Later among the works it cites.
Matrix entry-wise sampling: Simple is best
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Foygel, R. Salakhutdinov, O. Shamir, and N. Srebro · 2011
Cited alongside, same era.
Recovering low-rank matrices from few coefficients in any basis
D. Gross · 2011
Cited alongside, same era.
Randomized algorithms for matrices and data
M. Mahoney · 2011
Cited alongside, same era.
Graph sparsification by effective resistances
D. Spielman and N. Srivastava · 2011
Cited alongside, same era.
Weighted eigenfunction estimates with applications to compressed sensing
N. Burq, S. Dyatlov, R. Ward, and M. Zworski · 2012
Cited alongside, same era.
Fast approximation of matrix coherence and statistical leverage
P. Drineas, M. Magdon-Ismail, M. Mahoney, and D. Woodruff · 2012
Cited alongside, same era.
D. Achlioptas, Z. Karnin, and E. Liberty · 2013
Closest in time.
Incoherence-optimal matrix completion
Y. Chen · 2013
Closest in time.
Low-rank matrix recovery from errors and erasures
Y. Chen, A. Jalali, S. Sanghavi, and C. Caramanis · 2013
Closest in time.
Low-rank matrix and tensor completion via adaptive sampling
A. Krishnamurthy and A. Singh · 2013
Closest in time.
Reweighted ℓ 1 \ell_{1} minimization method for stochastic elliptic differential equations
X. Yang and G. Karniadakis · 2013
Closest in time.