Efficient median of means estimator
Not on the map. Why?
Abstract (arXiv)
The goal of this note is to present a modification of the popular median of means estimator that achieves sub-Gaussian deviation bounds with nearly optimal constants under minimal assumptions on the underlying distribution. We build on a recent work on the topic by the author, and prove that desired guarantees can be attained under weaker requirements.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 1 of its 14 references that are in the map. First posted on arXiv 30 May 2023.
Builds on
1 of 14 references.
References · 1
Built on by
Citing papers per year: 2024: 2; 2025: 2; 2026: 3.
7 papers.
- 2025Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexitycited by 5
- 2026Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimescited by 5
- 2024Multiple-policy Evaluation via Density Estimationcited by 2
- 2026Open Problem: Is Interaction Necessary for Order-Optimal 1-bit Mean Estimation?cited by 2
- 2024Classical Shadows with Improved Median-of-Means Estimationcited by 0
- 2025On the Optimality of the Median-of-Means Estimator under Adversarial Contaminationcited by 0
- 2026Median-of-Means as an Extremal Convex Estimator and a Nonconvex Route to the Trimmed Oraclecited by 0
- 2026Median-of-Means as an Extremal Convex Estimator and a Nonconvex Route to the Trimmed Oracle1 Sep 2026
- 2026Open Problem: Is Interaction Necessary for Order-Optimal 1-bit Mean Estimation?3 Jul 2026
- 2026Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes9 Apr 2026
- 2025On the Optimality of the Median-of-Means Estimator under Adversarial Contamination9 Oct 2025
- 2025Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity26 Sep 2025
- 2024Classical Shadows with Improved Median-of-Means Estimation4 Dec 2024
- 2024Multiple-policy Evaluation via Density Estimation29 Mar 2024