Robust Mean Estimation on Highly Incomplete Data with Arbitrary Outliers
Not on the map. Why?
Abstract (arXiv)
We study the problem of robustly estimating the mean of a d-dimensional distribution given N examples, where most coordinates of every example may be missing and varepsilon N examples may be arbitrarily corrupted. Assuming each coordinate appears in a constant factor more than varepsilon N examples, we show algorithms that estimate the mean of the distribution with information-theoretically optimal dimension-independent error guarantees in nearly-linear time widetilde O(Nd). Our results extend recent work on computationally-efficient robust estimation to a more widely applicable incomplete-data setting.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 Aug 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 4; 2024: 0; 2025: 2.
6 papers.
- 2023Nearly-Linear Time and Streaming Algorithms for Outlier-Robust PCAcited by 10
- 2023Near-Optimal Algorithms for Gaussians with Huber Contamination: Mean Estimation and Linear Regressioncited by 7
- 2023Byzantine-Resilient Federated Learning at Edgecited by 6
- 2025Learning High-dimensional Gaussians from Censored Datacited by 2
- 2025Linear Regression under Missing or Corrupted Coordinatescited by 1
- 2023A Combinatorial Approach to Robust PCAcited by 0
- 2025Linear Regression under Missing or Corrupted Coordinates23 Sep 2025
- 2025Learning High-dimensional Gaussians from Censored Data28 Apr 2025
- 2023Near-Optimal Algorithms for Gaussians with Huber Contamination: Mean Estimation and Linear Regression4 Dec 2023
- 2023A Combinatorial Approach to Robust PCA28 Nov 2023
- 2023Nearly-Linear Time and Streaming Algorithms for Outlier-Robust PCA4 May 2023
- 2023Byzantine-Resilient Federated Learning at Edge18 Mar 2023