Fetching the paper…
Reading the bibliography…
This paper is about a curious phenomenon.
Analysis of a complex of statistical variables into principal components
H. Hotelling · 1933
Earlier work this paper cites.
The approximation of one matrix by another of lower rank
C. Eckart and G. Young · 1936
Earlier work this paper cites.
Robust estimates, residuals, and outlier detection with multiresponse data
R. Gnanadesikan and J. Kettenring · 1972
Earlier work this paper cites.
Splitting algorithms for the sum of two nonlinear operators
P. Lions and B. Mercier · 1979
Earlier work this paper cites.
Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography
M. Fischler and R. Bolles · 1981
Earlier work this paper cites.
Robust Statistics
P. Huber · 1981
Earlier work this paper cites.
Constrained Optimization and Lagrange Multiplier Method
D.P. Bertsekas · 1982
Earlier work this paper cites.
A method of solving a convex programming problem with convergence rate
Y. Nesterov · 1983
Earlier work this paper cites.
Principal Component Analysis
I. Jolliffe · 1986
Earlier work this paper cites.
A variable-penalty alternating direction method for convex optimization
S. Kontogiorgis and R. Meyer · 1989
Earlier work this paper cites.
Indexing by latent semantic analysis
S. Dewester, S. Dumains, T. Landauer, G. Furnas, and R. Harshman · 1990
Earlier work this paper cites.
Latent semantic indexing, a probabilistic analysis
C. Papadimitriou, P. Rghavan, H. Tamaki, and S. Vempala · 2000
Earlier work this paper cites.
A global geometric framework for nonlinear dimensionality reduction
J. Tenenbaum, V. de Silva, and J. Langford · 2000
Earlier work this paper cites.
Atomic decomposition by basis pursuit
S. Chen, D. Donoho, and M. Saunders · 2001
Earlier work this paper cites.
From few to many: Illumination cone models for face recognition under variable lighting and pose
A. Georghiades, P. Belhumeur, and D. Kriegman · 2001
Earlier work this paper cites.
The Concentration of Measure Phenomenon
M. Ledoux · 2001
Earlier work this paper cites.
Lambertian reflectance and linear subspaces
R. Basri and D. Jacobs · 2003
Earlier work this paper cites.
Laplacian eigenmaps for dimensionality reduction and data representation
M. Belkin and P. Niyogi · 2003
Cited alongside, same era.
Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices
M. Fazel, H. Hindi, and S. Boyd · 2003
Cited alongside, same era.
A framework for robust subspace learning
F. De La Torre and M. Black · 2003
Cited alongside, same era.
Statistical modeling of complex backgrounds for foreground object detection
L. Li, W. Huang, I. Gu, and Q. Tian · 2004
Cited alongside, same era.
Smooth minimization of non-smooth functions
Y. Nesterov · 2005
Cited alongside, same era.
An iterative regularization method for total variation-based image restoration
S. Osher, M. Burger, D. Goldfarb, J. Xu, and W. Yin · 2005
Cited alongside, same era.
The power of convex relaxation: Near-optimal matrix completion
E. J. Candès and T. Tao · 2009
Closest in time.
Compressive sensing for background subtraction
V. Cevher, A. Sankaranarayanan, M. Duarte, D. Reddy, R. Baraniuk, and R. Chellappa · 2009
Closest in time.
Rank-sparsity incoherence for matrix decomposition
V. Chandrasekaran, S. Sanghavi, P. Parrilo, and A. Willsky · 2009
Closest in time.
Convergence of fixed point continuation algorithms for matrix rank minimization
D. Goldfarb and S. Ma · 2009
Closest in time.
CVX: Matlab software for disciplined convex programming (web page and software)
M. Grant and S. Boyd · 2009
Closest in time.
Recovering low-rank matrices from few coefficients in any basis
D. Gross · 2009
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
E. J. Candès, J. Romberg, and T. Tao · 2006
Cited alongside, same era.
Gradient methods for minimizing composite objective functions
Y. Nesterov · 2007
Cited alongside, same era.
Math 280 lecture notes
R. Vershynin · 2007
Cited alongside, same era.
A singular value thresholding algorithm for matrix completion
J. Cai, E. J. Candès, and Z. Shen · 2008
Cited alongside, same era.
Guaranteed minimum rank solution of matrix equations via nuclear norm minimization
B. Recht, M. Fazel, and P. Parillo · 2008
Cited alongside, same era.
Fixed-point continuation for
W. Yin, E. Hale, and Y. Zhang · 2008
Cited alongside, same era.
Closest in time.
Quantum state tomography via compressed sensing
D. Gross, Y-K. Liu, S. T. Flammia, S. Becker, and J. Eisert · 2009
Closest in time.
The Fourth Paradigm: Data-Intensive Scientific Discovery
T. Hey, S. Tansley, and K. Tolle · 2009
Closest in time.
The augmented Lagrange multiplier method for exact recovery of a corrupted low-rank matrices
Z. Lin, M. Chen, L. Wu, and Y. Ma · 2009
Closest in time.
Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix
Z. Lin, A. Ganesh, J. Wright, L. Wu, M. Chen, and Y. Ma · 2009
Closest in time.
Interior-point method for nuclear norm approximation with application to system identification
Z. Liu and L. Vandenberge · 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.
Matrix completion from a few entries
A. Montanari R. Keshavan and S. Oh · 2009
Closest in time.
A simpler approach to matrix completion
B. Recht · 2009
Closest in time.
Sparse and low-rank matrix decomposition via alternating direction methods
X. Yuan and J. Yang · 2009
Closest in time.
Face recognition with contiguous occlusion using Markov random fields
Z. Zhou, A. Wagner, H. Mobahi, J. Wright, and Y. Ma · 2009
Closest in time.