A Geometric Unification of Distributionally Robust Covariance Estimators: Shrinking the Spectrum by Inflating the Ambiguity Set
Not on the map. Why?
Abstract (arXiv)
The state-of-the-art methods for estimating high-dimensional covariance matrices all shrink the eigenvalues of the sample covariance matrix towards a data-insensitive shrinkage target. The underlying shrinkage transformation is either chosen heuristically - without compelling theoretical justification - or optimally in view of restrictive distributional assumptions. In this paper, we propose a principled approach to construct covariance estimators without imposing restrictive assumptions. That is, we study distributionally robust covariance estimation problems that minimize the worst-case Frobenius error with respect to all data distributions close to a nominal distribution, where the proximity of distributions is measured via a divergence on the space of covariance matrices. We identify mild conditions on this divergence under which the resulting minimizers represent shrinkage estimators. We show that the corresponding shrinkage transformations are intimately related to the geometrical properties of the underlying divergence. We also prove that our robust estimators are efficiently computable and asymptotically consistent and that they enjoy finite-sample performance guarantees. We exemplify our general methodology by synthesizing explicit estimators induced by the Kullback-Leibler, Fisher-Rao, and Wasserstein divergences. Numerical experiments based on synthetic and real data show that our robust estimators are competitive with state-of-the-art estimators.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 22 of its 72 references that are in the map. First posted on arXiv 30 May 2024.
Builds on
22 of 72 references.
References · 22
- 2021Convex optimizationcited by 2,479
- 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 285
- 2019Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learningcited by 169
- 2017Regularization via Mass Transportationcited by 79
- 2020Finite-Sample Guarantees for Wasserstein Distributionally Robust Optimization: Breaking the Curse of Dimensionalitycited by 49
- 2021Statistical Analysis of Wasserstein Distributionally Robust Estimatorscited by 27
- 2019Confidence Regions in Wasserstein Distributionally Robust Estimationcited by 24
- 2018Wasserstein Distributionally Robust Kalman Filteringcited by 17
- 2015Lecture notes on ridge regressioncited by 16
- 2018Distributionally Robust Inverse Covariance Estimation: The Wasserstein Shrinkage Estimatorcited by 16
- 2021Sequential Domain Adaptation by Synthesizing Distributionally Robust Expertscited by 14
- 2019Optimistic Distributionally Robust Optimization for Nonparametric Likelihood Approximationcited by 12
10 more
- 2019Bridging Bayesian and Minimax Mean Square Error Estimation via Wasserstein Distributionally Robust Optimizationcited by 11
- 2021Mean-Covariance Robust Risk Measurementcited by 9
- 2022Distributionally Robust Fair Principal Components via Geodesic Descentscited by 9
- 2022Sion's Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithmcited by 9
- 2023Distributionally Robust Linear Quadratic Controlcited by 8
- 2019Calculating Optimistic Likelihoods Using (Geodesically) Convex Optimizationcited by 7
- 2014Nonparametric Stein-type Shrinkage Covariance Matrix Estimators in High-Dimensional Settingscited by 5
- 2015Robust Kalman Filtering under Model Perturbationscited by 4
- 2023Coverage-Validity-Aware Algorithmic Recoursecited by 4
- 2018Gradient Method for Optimization on Riemannian Manifolds with Lower Bounded Curvaturecited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.