Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
126 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Bootstrapping the Operator Norm in High Dimensions: Error Estimation for Covariance Matrices and Sketching (1909.06120v1)

Published 13 Sep 2019 in math.ST, cs.NA, math.NA, stat.ME, and stat.TH

Abstract: Although the operator (spectral) norm is one of the most widely used metrics for covariance estimation, comparatively little is known about the fluctuations of error in this norm. To be specific, let $\hat\Sigma$ denote the sample covariance matrix of $n$ observations in $\mathbb{R}p$ that arise from a population matrix $\Sigma$, and let $T_n=\sqrt{n}|\hat\Sigma-\Sigma|_{\text{op}}$. In the setting where the eigenvalues of $\Sigma$ have a decay profile of the form $\lambda_j(\Sigma)\asymp j{-2\beta}$, we analyze how well the bootstrap can approximate the distribution of $T_n$. Our main result shows that up to factors of $\log(n)$, the bootstrap can approximate the distribution of $T_n$ at the dimension-free rate of $n{-\frac{\beta-1/2}{6\beta+4}}$, with respect to the Kolmogorov metric. Perhaps surprisingly, a result of this type appears to be new even in settings where $p< n$. More generally, we discuss the consequences of this result beyond covariance matrices and show how the bootstrap can be used to estimate the errors of sketching algorithms in randomized numerical linear algebra (RandNLA). An illustration of these ideas is also provided with a climate data example.

Citations (13)

Summary

We haven't generated a summary for this paper yet.