Fetching the paper…
Reading the bibliography…
The truncated singular value decomposition (SVD) of the measurement matrix is the optimal solution to the_representation_ problem of how to best approximate a noisy measurement matrix using a low-rank matrix.
The approximation of one matrix by another of lower rank
C. Eckart and G. Young · 1936
Earlier work this paper cites.
Locally asymptotically normal families of distributions: certain approximations to families of distributions and their use in the theory of estimation and testing hypotheses
L. M. Le Cam · 1960
Earlier work this paper cites.
Symmetric gauge functions and unitarily invariant norms
L. Mirsky · 1960
Earlier work this paper cites.
Distribution of eigenvalues for some sets of random matrices
V. A. Marchenko and L. A. Pastur · 1967
Earlier work this paper cites.
The singular value decomposition: Its computation and some applications
V. C. Klema and A. Laub · 1980
Earlier work this paper cites.
A generalization of the Eckart-Young-Mirsky matrix approximation theorem
G. H. Golub, A. Hoffman, and G. W. Stewart · 1987
Earlier work this paper cites.
Iterated toeplitz approximation of covariance matrices
D. M. Wikes and M. H. Hayes · 1988
Earlier work this paper cites.
Enhanced rational signal modeling
J. A. Cadzow and D. M. Wilkes · 1991
Earlier work this paper cites.
Topics in matrix analysis
R. A. Horn and C. R. Johnson · 1991
Earlier work this paper cites.
The svd and reduced rank signal processing
L. L. Scharf · 1991
Earlier work this paper cites.
Signal detection via spectral theory of large dimensional random matrices
P. L. Combettes and J. W. Silverstein · 1992
Earlier work this paper cites.
Estimation of a signal waveform from noisy data using low-rank approximation to a data matrix
D. W. Tufts and A. A. Shah · 1993
Earlier work this paper cites.
Better subset regression using the nonnegative garrote
L. Breiman · 1995
Earlier work this paper cites.
Analysis of the limiting spectral distribution of large dimensional random matrices
J. W. Silverstein and S.-I. Choi · 1995
Earlier work this paper cites.
A parameter estimation scheme for damped sinusoidal signals based on low-rank Hankel approximation
Y. Li, K. J. R. Liu, and J. Razavilar · 1997
Earlier work this paper cites.
Learning mixtures of gaussians
S. Dasgupta · 1999
Earlier work this paper cites.
Mixtures of probabilistic principal component analyzers
M. E. Tipping and C. M. Bishop · 1999
Earlier work this paper cites.
On the distribution of the largest eigenvalue in principal components analysis
I. M. Johnstone · 2001
Earlier work this paper cites.
Learning mixtures of arbitrary gaussians
A. Sanjeev and R. Kannan · 2001
Earlier work this paper cites.
Principal component analysis
I. T. Jolliffe · 2002
Earlier work this paper cites.
A note on universality of the distribution of the largest eigenvalues in certain sample covariance matrices
A. Soshnikov · 2002
Earlier work this paper cites.
A spectral algorithm for learning mixtures of distributions
S. Vempala and G. Wang · 2002
Earlier work this paper cites.
Low-rank approximations with sparse factors I: Basic algorithms and error analysis
Z. Zhang, H. Zha, and H. Simon · 2002
Earlier work this paper cites.
Structured low rank approximation
M. T. Chu, R. E. Funderlic, and R. J. Plemmons · 2003
Earlier work this paper cites.
Weighted low-rank approximations
N. Srebro and T. Jaakkola · 2003
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.
Optimality, computation, and interpretation of nonnegative matrix factorizations
M. T. Chu, F. Diele, R. Plemmons, and S. Ragni · 2004
Earlier work this paper cites.
Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices
J. Baik, G. Ben Arous, and S. Péché · 2005
Earlier work this paper cites.
The spectral method for general mixture models
R. Kannan, H. Salmasian, and S. Vempala · 2005
Earlier work this paper cites.
Some estimates of norms of random matrices
R. Latała · 2005
Earlier work this paper cites.
Eigenvalues of large sample covariance matrices of spiked population models
J. Baik and J. W. Silverstein · 2006
Cited alongside, same era.
Fast monte carlo algorithms for matrices ii: Computing a low-rank approximation to a matrix
P. Drineas, R. Kannan, and M. W. Mahoney · 2006
Cited alongside, same era.
High dimensional statistical inference and random matrices
I. M. Johnstone · 2006
Cited alongside, same era.
Initializations for the nonnegative matrix factorization
A. N. Langville, C. D. Meyer, R. Albright, J. Cox, and D. Duling · 2006
Cited alongside, same era.
Sparse principal component analysis
H. Zou, T. Hastie, and R. Tibshirani · 2006
Cited alongside, same era.
Tracy–widom limit for the largest eigenvalue of a large class of complex sample covariance matrices
N. El Karoui · 2007
Determining the number of factors from empirical distribution of eigenvalues
A. Onatski · 2010
Later among the works it cites.
Robust principal component analysis?
E. J. Candès, X. Li, Y. Ma, and J. Wright · 2011
Later among the works it cites.
Rank-sparsity incoherence for matrix decomposition
V. Chandrasekaran, S. Sanghavi, P. A.Parrilo, and A. S. Willsky · 2011
Later among the works it cites.
Budget-optimal crowdsourcing using low-rank matrix approximations
D. R. Karger, S. Oh, and D. Shah · 2011
Later among the works it cites.
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
V. Koltchinskii, K. Lounici, and A. B. Tsybakov · 2011
Later among the works it cites.
Exploiting random matrix theory to improve noisy low-rank matrix approximation
R. R. Nadakuditi · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Asymptotics of sample eigenstructure for a large dimensional spiked covariance model
D. Paul · 2007
Cited alongside, same era.
SVD based initialization: A head start for nonnegative matrix factorization
C. Boutsidis and E. Gallopoulos · 2008
Cited alongside, same era.
Optimal solutions for sparse principal component analysis
A. d’Aspremont, F. Bach, and L. El Ghaoui · 2008
Cited alongside, same era.
Compressed sensing and robust recovery of low rank matrices
M. Fazel, E. j. Candes, B. Recht, and P. Parrilo · 2008
Cited alongside, same era.
Determining the number of components in a factor model from limited noisy data
S. Kritchman and B. Nadler · 2008
Cited alongside, same era.
Structured low-rank approximation and its applications
I. Markovsky · 2008
Cited alongside, same era.
Finding dense clusters via “low rank+ sparse” decomposition
S. Oymak and B. Hassibi · 2011
Later among the works it cites.
Universality of covariance matrices
N. S. Pillai and J. Yin · 2011
Later among the works it cites.
Estimation of high-dimensional low-rank matrices
A. Rohde and A. B. Tsybakov · 2011
Later among the works it cites.
Recovering low-rank and sparse components of matrices from incomplete and noisy observations
M. Tao and X. Yuan · 2011
Later among the works it cites.
The singular values and vectors of low rank perturbations of large rectangular random matrices
F. Benaych-Georges and R. R. Nadakuditi · 2012
Later among the works it cites.
Minimax bounds for sparse pca with noisy high-dimensional data
A. Birnbaum, I. M. Johnstone, B. Nadler, and D. Paul · 2012
Later among the works it cites.
Local Marchenko-Pastur law at the hard edge of sample covariance matrices
C. Cacciapuoti, A. Maltsev, and B. Schlein · 2012
Later among the works it cites.
Matrix estimation by universal singular value thresholding
S. Chatterjee · 2012
Later among the works it cites.
Risk estimation for matrix recovery with spectral regularization
C.-A. Deledalle, S. Vaiter, G. Peyré, J. Fadili, and C. Dossal · 2012
Later among the works it cites.
Universality of local spectral statistics of random matrices
L. Erdős and H.-T. Yau · 2012
Later among the works it cites.
A subspace estimator for fixed rank perturbations of large random matrices
W. Hachem, P. Loubaton, X. Mestre, J. Najim, and P. Vallet · 2012
Later among the works it cites.
Learning gaussian mixture models: Moment methods and spectral decompositions
D. Hsu and S. M. Kakade · 2012
Later among the works it cites.
Regularization techniques for learning with matrices
S. M. Kakade, S. Shalev-Shwartz, and A. Tewari · 2012
Later among the works it cites.
Graph spectra and the detectability of community structure in networks
R. R. Nadakuditi and M. E. J. Newman · 2012
Later among the works it cites.
On determining the number of spikes in a high-dimensional spiked population model
D. Passemier and J.-F. Yao · 2012
Later among the works it cites.
Diagonal and low-rank matrix decompositions, correlation matrices, and ellipsoid fitting
J. Saunderson, V. Chandrasekaran, P. A. Parrilo, and A. S. Willsky · 2012
Later among the works it cites.
Topics in random matrix theory
T. Tao · 2012
Later among the works it cites.
Sparse PCA: Convex relaxations, algorithms and applications
Y. Zhang, A. d’Aspremont, and L. El Ghaoui · 2012
Later among the works it cites.
Extreme gaps between eigenvalues of random matrices
G. Ben Arous and P. Bourgade · 2013
Closest in time.
Concentration Inequalities: A Nonasymptotic Theory of Independence, Oxford University Press, 2013
S. Boucheron, G. Lugosi and P. Massart · 2013
Closest in time.
When are the most informative components for inference also the principal components?
R. R. Nadakuditi · 2013
Closest in time.
Spectra of random graphs with arbitrary expected degrees
R. R. Nadakuditi and M. E. J. Newman · 2013
Closest in time.
Reconstruction of a low-rank matrix in the presence of Gaussian noise
A. .A. Shabalin and A. B. Nobel · 2013
Closest in time.