mlsanityData to 14 Oct 2026

Robust subgaussian estimation with VC-dimension

arXiv 2004.11734 ↗First posted 24 Apr 2020stat.ML cs.LG math.STcited by 4

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

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 1; 2023: 2; 2024: 0; 2025: 0; 2026: 1.

4 papers.