mlsanityData to 7 Oct 2026

Fast Mean Estimation with Sub-Gaussian Rates

arXiv 1902.01998 ↗First posted 6 Feb 2019math.ST cs.DS cs.LGcited by 18

Not on the map. Why?

Abstract (arXiv)

We propose an estimator for the mean of a random vector in ℝd that can be computed in time O(n4+n2d) for n i.i.d.~samples and that has error bounds matching the sub-Gaussian case. The only assumptions we make about the data distribution are that it has finite mean and covariance; in particular, we make no assumptions about higher-order moments. Like the polynomial time estimator introduced by Hopkins, 2018, which is based on the sum-of-squares hierarchy, our estimator achieves optimal statistical efficiency in this challenging setting, but it has a significantly faster runtime and a simpler analysis.

Key facts. Cited by 18 papers in the map (data through 7 Oct 2026). First posted on arXiv 6 Feb 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 8; 2023: 6; 2024: 2.

18 papers.

Sort: