Fetching the paper…
Reading the bibliography…
We consider the problem of recovering a low-rank matrix when some of its entries, whose locations are not known a priori, are corrupted by errors of arbitrarily large magnitude.
C. Eckart and G. Young, “The approximation of one matrix by another of lower rank,”
1936
Earlier work this paper cites.
I. Jolliffe, “Principal component analysis,” 1986
1986
Earlier work this paper cites.
C. Papadimitriou, P. Raghavan, H. Tamaki, and S. Vempala, “Latent semantic indexing: A probabilistic analysis,”
2000
Earlier work this paper cites.
2001
Earlier work this paper cites.
M. Fazel, H. Hindi, and S. Boyd, “Rank minimization and applications in system theory,” in
2004
Earlier work this paper cites.
R. Vershynin, “Math 280 lecture notes,” 2007, available at
2007
Cited alongside, same era.
E. Candès and B. Recht, “Exact matrix completion via convex optimzation,”
2008
Cited alongside, same era.
J. Wright and Y. Ma, “Dense error correction via
2008
Cited alongside, same era.
J. Wright, A. Yang, A. Ganesh, Y. Ma, and S. Sastry, “Robust face recognition via sparse representation,”
2009
Cited alongside, same era.
E. Candès, X. Li, Y. Ma, and J. Wright, “Robust principal component analysis?”
2009
Cited alongside, same era.
V. Chandrasekaran, S. Sanghavi, P. Parrilo, and A. Willsky, “Sparse and low-rank matrix decompositions,” in
2009
Later among the works it cites.
E. Candès and T. Tao, “The power of convex relaxation: Near-optimal matrix completion,”
2009
Later among the works it cites.
D. Gross, “Recovering low-rank matrices from few coefficients in any basis,”
2009
Later among the works it cites.
Z. Lin, M. Chen, L. Wu, and Y. Ma, “The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices,”
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…