Fetching the paper…
Reading the bibliography…
Matrix perturbation inequalities, such as Weyl's theorem (concerning the singular values) and the Davis-Kahan theorem (concerning the singular vectors), play essential roles in quantitative science; in particular, these bounds have found application in data analysis as well as related areas of engineering and computer science.
Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differentialgleichungen
H. Weyl · 1912
Earlier work this paper cites.
Symmetric gauge functions and unitarily invariant norms
L. Mirsky · 1960
Earlier work this paper cites.
Probability inequalities for sums of bounded random variables
W. Hoeffding · 1963
Earlier work this paper cites.
Weighted sums of certain dependent random variables
K. Azuma · 1967
Earlier work this paper cites.
Some Kolmogoroff-type inequalities for bounded random variables
W.L. Steiger · 1967
Earlier work this paper cites.
The rotation of eigenvectors by a perturbation. iii
C. Davis, W.M. Kahan · 1970
Earlier work this paper cites.
Perturbation bounds in connection with singular value decomposition
P.-Å. Wedin · 1972
Earlier work this paper cites.
Expected behavior of graph coloring algorithms
L. Kučera · 1977
Earlier work this paper cites.
Matrix perturbation theory
G.W. Stewart, J.-G. Sun · 1990
Earlier work this paper cites.
Shape and motion from image streams under orthography: a factorization method
C. Tomasi, T. Kanade · 1992
Earlier work this paper cites.
A survey of componentwise perturbation theory in numerical linear algebra
N.J. Higham · 1994
Earlier work this paper cites.
Matrix computations
G.H. Golub, C.F. Van Loan · 1996
Earlier work this paper cites.
Accuracy and stability of numerical algorithms
N.J. Higham · 1996
Earlier work this paper cites.
A new look at independence
M. Talagrand · 1996
Earlier work this paper cites.
A spectral technique for coloring random 3-colorable graphs
N. Alon, N. Kahale · 1997
Earlier work this paper cites.
Numerical Linear Algebra
D. Bau III and L.N. Trefethen · 1997
Earlier work this paper cites.
Matrix analysis
R. Bhatia · 1997
Earlier work this paper cites.
Finding a large hidden clique in a random graph
N. Alon, M. Krivelevich, B. Sudakov · 1998
Cited alongside, same era.
Concentration
C. McDiarmid · 1998
Cited alongside, same era.
Fast computation of low rank matrix approximations
D. Achlioptas, F. McSherry · 2001
Cited alongside, same era.
Spectral analysis of data
Y. Azar, A. Fiat, A. Karlin, F. McSherry, J. Saia · 2001
Cited alongside, same era.
Spectral partitioning of random graphs
F. McSherry · 2001
Cited alongside, same era.
Recovering the missing components in a large noisy low-rank matrix: application to SFM
P. Chen, D. Suter · 2004
Cited alongside, same era.
Geometric data analysis: from correspondence analysis to structured data analysis
The power of convex relaxation: Near-optimal matrix completion
E.J. Candès, T. Tao · 2010
Later among the works it cites.
Matrix completion from noisy entries
R.H. Keshaven, A. Montanari, S. Oh · 2010
Later among the works it cites.
Matrix completion from a few entries
R.H. Keshaven, A. Montanari, S. Oh · 2010
Later among the works it cites.
Spectral regularization algorithms for learning large incomplete matrices
R. Mazumder, T. Hastie, R. Tibshirani · 2010
Later among the works it cites.
The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices
F. Benaych-Georges, R. R. Nadakuditi · 2011
Later among the works it cites.
Finding hidden cliques in linear time with high probability
Y. Dekel, O. Gurel-Gurevich, Y. Peres · 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…
B. Le Roux, H. Rouanet · 2004
Cited alongside, same era.
Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information
E.J. Candès, J. Romberg, T. Tao · 2006
Cited alongside, same era.
On random ± 1 \pm 1 matrices: Singularity and Determinant
T. Tao, V. Vu · 2006
Cited alongside, same era.
Sampling from large matrices: An approach through geometric functional analysis
M. Rudelson, R. Vershynin · 2007
Cited alongside, same era.
Spectral norm of random matrices
V. Vu · 2007
Cited alongside, same era.
Finite sample approximation results for principal component analysis: A matrix perturbation approach
B. Nadler · 2008
Cited alongside, same era.
Chapter 18 of the Oxford Handbook of Random Matrix theory, edited by Gernot Akemann, Jinho Baik, and Philippe di Francesco, 2011
B. Khoruzhenko, H.J. Sommers · 2011
Later among the works it cites.
Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
V. Koltchinskii, K. Lounici, A.B. Tsybakov · 2011
Later among the works it cites.
Probability in Banach spaces: isoperimetry and processes
M. Ledoux, M. Talagrand · 2011
Later among the works it cites.
Estimation of (near) low-rank matrices with noise and high-dimensional scaling
S. Negahban, M.J. Wainwright · 2011
Later among the works it cites.
Singular vectors under random perturbation
V. Vu · 2011
Later among the works it cites.
Von Neumann entropy penalization and low-rank matrix estimation
V. Koltchinskii · 2012
Later among the works it cites.
Topics in random matrix theory
T. Tao · 2012
Later among the works it cites.
Chapter 5 of: Compressed sensing, theory and applications
R. Vershynin · 2012
Later among the works it cites.
On finite rank deformations of Wigner matrices II: Delocalized perturbations
D. Renfrew, A. Soshnikov · 2013
Closest in time.
Spectra of nearly Hermitian random matrices
S O’Rourke, P. Wood · 2017
Closest in time.
The outliers of a deformed Wigner matrix
A. Knowles, J. Yin · 2031
Closest in time.