Robust subgaussian estimation with VC-dimension
Not on the map. Why?
Abstract (arXiv)
Median-of-means (MOM) based procedures provide non-asymptotic and strong deviation bounds even when data are heavy-tailed and/or corrupted. This work proposes a new general way to bound the excess risk for MOM estimators. The core technique is the use of VC-dimension (instead of Rademacher complexity) to measure the statistical complexity. In particular, this allows to give the first robust estimators for sparse estimation which achieves the so-called subgaussian rate only assuming a finite second moment for the uncorrupted data. By comparison, previous works using Rademacher complexities required a number of finite moments that grows logarithmically with the dimension. With this technique, we derive new robust sugaussian bounds for mean estimation in any norm. We also derive a new robust estimator for covariance estimation that is the first to achieve subgaussian bounds without L4-L2 norm equivalence.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 24 Apr 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 2; 2024: 0; 2025: 0; 2026: 1.
4 papers.
- 2022Outlier-Robust Sparse Mean Estimation for Heavy-Tailed Distributionscited by 13
- 2023Computationally Efficient and Statistically Optimal Robust High-Dimensional Linear Regressioncited by 4
- 2023Sparse Mean Estimation in Adversarial Settings via Incremental Learningcited by 0
- 2026A Rigorous, Tractable Measure of Model Complexitycited by 0
- 2026A Rigorous, Tractable Measure of Model Complexity20 May 2026
- 2023Sparse Mean Estimation in Adversarial Settings via Incremental Learning24 May 2023
- 2023Computationally Efficient and Statistically Optimal Robust High-Dimensional Linear Regression10 May 2023
- 2022Outlier-Robust Sparse Mean Estimation for Heavy-Tailed Distributions29 Nov 2022