A Unified Approach to Robust Mean Estimation
Not on the map. Why?
Abstract (arXiv)
In this paper, we develop connections between two seemingly disparate, but central, models in robust statistics: Huber's epsilon-contamination model and the heavy-tailed noise model. We provide conditions under which this connection provides near-statistically-optimal estimators. Building on this connection, we provide a simple variant of recent computationally-efficient algorithms for mean estimation in Huber's model, which given our connection entails that the same efficient sample-pruning based estimators is simultaneously robust to heavy-tailed noise and Huber contamination. Furthermore, we complement our efficient algorithms with statistically-optimal albeit computationally intractable estimators, which are simultaneously optimally robust in both models. We study the empirical performance of our proposed estimators on synthetic datasets, and find that our methods convincingly outperform a variety of practical baselines.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 1 Jul 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 3; 2023: 4; 2024: 1.
11 papers.
- 2021Efficient Mean Estimation with Pure Differential Privacy via a Sum-of-Squares Exponential Mechanismcited by 50
- 2021Learning-Augmented k-means Clusteringcited by 26
- 2021Heavy-tailed Streaming Statistical Estimationcited by 10
- 2022Private and Byzantine-Proof Cooperative Decision-Makingcited by 9
- 2023Huber-Robust Confidence Sequencescited by 7
- 2023Near-Optimal Algorithms for Gaussians with Huber Contamination: Mean Estimation and Linear Regressioncited by 7
- 2022Bandits Corrupted by Nature: Lower Bounds on Regret and Robust Optimistic Algorithmcited by 6
- 2023On Private and Robust Banditscited by 6
- 2022Communication-efficient distributed eigenspace estimation with arbitrary node failurescited by 1
- 2023Robust and differentially private stochastic linear banditscited by 0
- 2024Iterative thresholding for non-linear learning in the strong varepsilon-contamination modelcited by 0
- 2024Iterative thresholding for non-linear learning in the strong varepsilon-contamination model5 Sep 2024
- 2023Near-Optimal Algorithms for Gaussians with Huber Contamination: Mean Estimation and Linear Regression4 Dec 2023
- 2023Robust and differentially private stochastic linear bandits23 Apr 2023
- 2023On Private and Robust Bandits6 Feb 2023
- 2023Huber-Robust Confidence Sequences23 Jan 2023
- 2022Communication-efficient distributed eigenspace estimation with arbitrary node failures31 May 2022
- 2022Private and Byzantine-Proof Cooperative Decision-Making27 May 2022
- 2022Bandits Corrupted by Nature: Lower Bounds on Regret and Robust Optimistic Algorithm7 Mar 2022
- 2021Efficient Mean Estimation with Pure Differential Privacy via a Sum-of-Squares Exponential Mechanism25 Nov 2021
- 2021Learning-Augmented k-means Clustering27 Oct 2021
- 2021Heavy-tailed Streaming Statistical Estimation25 Aug 2021