Sharp bounds on the rate of convergence of the empirical covariance matrix
By Radosław Adamczak, Alexander E. Litvak, Alain Pajor, Nicole Tomczak-Jaegermann. 2010
86 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Statistics and Probability
View Paper: https://www.semanticscholar.org/paper/d793c899767fb718ae6227f17d37a3ad3811d870
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Alex Gittens
- Joel A. Tropp
- Konstantin E. Tikhomirov
- Michael W. Mahoney
- Peter Richtárik
- Nicolas Loizou
- David P. Woodruff
- Nati Srebro
In Statistics and Probability
- Alex Gittens
- Joel A. Tropp
- Konstantin E. Tikhomirov
- Michael W. Mahoney
- Aaditya Ramdas
- Ramon van Handel
- Steven R. Howard
- Jon D. McAuliffe
Citations in the corpus
- TAIL BOUNDS FOR ALL EIGENVALUES OF A SUM OF RANDOM MATRICES (2011, methodology): “x, so it is most useful when the eigenvalues of the covariance matrix satisfy decay conditions such as those given in the statement of Theorem 1.1. If such conditions are not satised, the results of [ALPTJ11] on the convergence of empirical covariance matrices of isotropic log-concave random vectors”
- The smallest singular value of random rectangular matrices with no moment assumptions on entries (2014, background): “Later, the log-concavity was replaced by weaker assumptions (see, in particular, [2], [17], [9], [4]).”
- Sample covariance matrices of heavy-tailed distributions (2016, background): “The next lemma, stated in [10] (the argument appeared already in [2]), will be very helpful for us.”