Skip to content
Preprint

Bias-Corrected Multiplier Bootstrap Inference for Spectral Edges of Large Covariance Matrices

Jul 2026 · 0 citations
Mathematics

Abstract

Inference for spectral edges of large covariance matrices is a fundamental problem in high-dimensional statistics. A major difficulty is that the largest non-spiked sample eigenvalues, which serve as natural estimators of the edge, fluctuate on the Tracy--Widom scale. Consequently, valid inference requires accurate centering by the deterministic spectral edge together with a precise scaling constant, both of which are often difficult to estimate in practice under general unknown population covariance structures. In this paper, we propose a bias-corrected multiplier bootstrap procedure for inference on the deterministic edge of the bulk spectrum. The key idea is to introduce a carefully calibrated multiplier perturbation that regularizes the edge fluctuation to a slightly larger scale at which Gaussian approximation becomes tractable. The resulting confidence interval is constructed directly from bootstrap eigenvalues, together with a data-driven recentering step that corrects the bootstrap-induced shift of the deterministic edge. On the theoretical side, we show that, after bias correction and rescaling, the largest few non-spiked bootstrap eigenvalues are asymptotically Gaussian conditionally on the data. Building on this result, we establish the asymptotic validity of the proposed confidence interval, whose length is only slightly larger than the Tracy--Widom scale, and prove vanishing coverage under alternatives in which additional spikes separate from the bulk at a local scale larger than $n^{-1/6}$. As a consequence, the same confidence interval yields a threshold-free estimator for the number of spikes, without requiring the spikes to be distinct or very large. Equivalently, the procedure yields a data-driven and theoretically justified cutoff for the scree plot.

View source

Similar papers

Open access Aug 2026

Spectral Shrinkage in High-Dimensional Statistics: From Random Matrix Theory to Optimal Covariance Estimation

In the era of high-dimensional data, the classical assumption that the number of observations n vastly exceeds the number of variables p is frequently violated. When p and n grow proportionally (p/n → c > 0), the sample covariance matrix becomes severely distorted by sampling noise. Its eigenvalues are systematically b...

Innocent Nsabimana · 0 citations
Preprint Oct 2026

High-Dimensional Regularization of the Spatial Sign Covariance Matrix for Robust Shape Estimation

Covariance estimation is a key component of many applications in system identification and data-driven control. Although heavy-tailed distributions may lack a covariance matrix to estimate, the shape matrix provides a well-defined, scale-free generalization for the broad family of elliptical distributions. In this sett...

Jonas Elmerraji, J. Spall, Mateo Díaz · 0 citations
Preprint Aug 2026

Multiplier Bootstrap and Edge Phase Transitions of High-Dimensional Covariance Matrices

In this paper, we study the effects of employing multiplier bootstrap to analyze the asymptotic distributions of the largest eigenvalues of high-dimensional sample covariance matrices in both spiked and non-spiked models. Our findings demonstrate that the multiplier bootstrap establishes several phase transitions in th...

Jia-Hui Xie · 0 citations
Preprint Aug 2026

Scalable Statistical Inference in Stochastic Gradient Descent

The proposed methodology delivers interpretable, simultaneous hyper-rectangular confidence regions that are statistically robust, memory-efficient, and strictly scalable for high-dimensional inference.

Rahul Singh, A. Shukla · 0 citations
Preprint Oct 2026

Nonparametric covariance estimation with bias correction for spatial lattice processes

Accurate covariance estimation is crucial for spatial data analysis. While parametric methods can suffer from model misspecification leading to wrong conclusions, nonparametric approaches are often neglected in practice as they rely on the estimation of a large number of covariance parameters and often face finite-samp...

Antonio Fioravanti, C. Jentsch · 0 citations
Preprint Sep 2026

On the sample complexity of the active subspace method

Active subspaces identify low-dimensional linear structure in high-dimensional parameter-to-output maps by estimating the dominant eigenspace of a gradient covariance operator. In practice this covariance is replaced by a Monte Carlo estimator built from a limited number of gradient evaluations. Classical analyses base...

Fabio Nobile, Matteo Raviola, R. Tempone · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.