Robust Estimation Under Heterogeneous Corruption Rates
Not on the map. Why?
Abstract (arXiv)
We study the problem of robust estimation under heterogeneous corruption rates, where each sample may be independently corrupted with a known but non-identical probability. This setting arises naturally in distributed and federated learning, crowdsourcing, and sensor networks, yet existing robust estimators typically assume uniform or worst-case corruption, ignoring structural heterogeneity. For mean estimation for multivariate bounded distributions and univariate gaussian distributions, we give tight minimax rates for all heterogeneous corruption patterns. For multivariate gaussian mean estimation and linear regression, we establish the minimax rate for squared error up to a factor of √d, where d is the dimension. Roughly, our findings suggest that samples beyond a certain corruption threshold may be discarded by the optimal estimators -- this threshold is determined by the empirical distribution of the corruption rates given.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 26 of its 46 references that are in the map. First posted on arXiv 20 Aug 2025.
Builds on
26 of 46 references.
References · 26
- 2016Robust Estimators in High Dimensions without the Computational Intractabilitycited by 209
- 2016Agnostic Estimation of Mean and Covariancecited by 131
- 2018Sever: A Robust Meta-Algorithm for Stochastic Optimizationcited by 125
- 2016Learning from Untrusted Datacited by 90
- 2017Being Robust (in High Dimensions) Can Be Practicalcited by 83
- 2018Efficient Algorithms for Outlier-Robust Regressioncited by 72
- 2017List-Decodable Robust Mean Estimation and Learning Mixtures of Spherical Gaussianscited by 70
- 2015Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Modelcited by 47
- 2022Robustness Implies Privacy in Statistical Estimationcited by 47
- 2020Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret Minimizationcited by 44
- 2019Quantum Entropy Scoring for Fast Robust Mean Estimation and Improved Outlier Detectioncited by 41
- 2019List Decodable Learning via Sum of Squarescited by 37
14 more
- 2019Robust subgaussian estimation of a mean vector in nearly linear timecited by 37
- 2023From Robustness to Privacy and Backcited by 27
- 2022Privacy Induces Robustness: Information-Computation Gaps and Sparse Mean Estimationcited by 25
- 2022Optimal and Differentially Private Data Acquisition: Central and Local Mechanismscited by 24
- 2017Robust Regression via Mutivariate Regression Depthcited by 20
- 2020List-Decodable Mean Estimation via Iterative Multi-Filteringcited by 18
- 2022Optimal Data Acquisition with Privacy-Aware Agentscited by 13
- 2024High-probability minimax lower boundscited by 13
- 2021On the power of adaptivity in statistical adversariescited by 12
- 2024Adaptive and oblivious statistical adversaries are equivalentcited by 9
- 2023The Full Landscape of Robust Mean Testing: Sharp Separations between Oblivious and Adaptive Contaminationcited by 8
- 2023Mean Estimation Under Heterogeneous Privacy Demandscited by 6
- 2021Semi-verified PAC Learning from the Crowdcited by 4
- 2024Private Estimation when Data and Privacy Demands are Correlatedcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.