mlsanityData to 7 Oct 2026

Generalized Resilience and Robust Statistics

arXiv 1909.08755 ↗First posted 19 Sep 2019math.ST cs.LG stat.MLcited by 37

Not on the map. Why?

Abstract (arXiv)

Robust statistics traditionally focuses on outliers, or perturbations in total variation distance. However, a dataset could be corrupted in many other ways, such as systematic measurement errors and missing covariates. We generalize the robust statistics approach to consider perturbations under any Wasserstein distance, and show that robust estimation is possible whenever a distribution's population statistics are robust under a certain family of friendly perturbations. This generalizes a property called resilience previously employed in the special case of mean estimation with outliers. We justify the generalized resilience property by showing that it holds under moment or hypercontractive conditions. Even in the total variation case, these subsume conditions in the literature for mean estimation, regression, and covariance estimation; the resulting analysis simplifies and sometimes improves these known results in both population limit and finite-sample rate. Our robust estimators are based on minimum distance (MD) functionals (Donoho and Liu, 1988), which project onto a set of distributions under a discrepancy related to the perturbation. We present two approaches for designing MD estimators with good finite-sample rates: weakening the discrepancy and expanding the set of distributions. We also present connections to Gao et al. (2019)'s recent analysis of generative adversarial networks for robust estimation.

Key facts. Cited by 37 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 Sep 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 11; 2022: 7; 2023: 6; 2024: 5; 2025: 6; 2026: 2.

37 papers.

Sort:

By area:

  1. 2021Robust and Differentially Private Mean Estimationcited by 66
  2. 2021Differential privacy and robust statistics in high dimensionscited by 64
  3. 2021DORO: Distributional and Outlier Robust Optimizationcited by 54
  4. 2021Improved Rates for Differentially Private Stochastic Convex Optimization with Heavy-Tailed Datacited by 47
  5. 2022Statistical, Robustness, and Computational Guarantees for Sliced Wasserstein Distancescited by 41
  6. 2021Private Robust Estimation by Stabilizing Convex Relaxationscited by 38
  7. 2022Byzantine-Robust Federated Learning with Optimal Statistical Rates and Privacy Guaranteescited by 30
  8. 2021Outlier-Robust Optimal Transport: Duality, Structure, and Statistical Analysiscited by 27
  9. 2024Corruption Robust Offline Reinforcement Learning with Human Feedbackcited by 20
  10. 2022Holistic Robust Data-Driven Decisionscited by 17
  11. 2023Outlier-Robust Wasserstein DROcited by 16
  12. 2021On the power of adaptivity in statistical adversariescited by 12
25 more
  1. 2021Robust W-GAN-Based Estimation Under Wasserstein Contaminationcited by 9
  2. 2023Near Optimal Private and Robust Linear Regressioncited by 9
  3. 2021Robust Estimation for Random Graphscited by 8
  4. 2023High Dimensional Distributed Gradient Descent with Arbitrary Number of Byzantine Attackerscited by 7
  5. 2022Trimmed Maximum Likelihood Estimation for Robust Learning in Generalized Linear Modelscited by 6
  6. 2023Stochastic Re-weighted Gradient Descent via Distributionally Robust Optimizationcited by 6
  7. 2022Outcome Assumptions and Duality Theory for Balancing Weightscited by 5
  8. 2024Robust Distribution Learning with Local and Global Adversarial Corruptionscited by 5
  9. 2025General Synthetic-Powered Inferencecited by 5
  10. 2025Solving a Research Problem in Mathematical Statistics with AI Assistancecited by 5
  11. 2022Robust estimation algorithms don't need to know the corruption levelcited by 4
  12. 2022Robust Estimation for Nonparametric Families via Generative Adversarial Networkscited by 3
  13. 2025Wasserstein Distributionally Robust Nonparametric Regressioncited by 3
  14. 2021Influence Based Defense Against Data Poisoning Attacks in Online Learningcited by 2
  15. 2024The Broader Landscape of Robustness in Algorithmic Statisticscited by 2
  16. 2023Minimax Statistical Estimation under Wasserstein Contaminationcited by 1
  17. 2023Noisy Computing of the mathsfOR and mathsfMAX Functionscited by 1
  18. 2024Automatic Outlier Rectification via Optimal Transportcited by 1
  19. 2024Robust Estimation for Kernel Exponential Families with Smoothed Total Variation Distancescited by 1
  20. 2025Distributionally Robust Optimization with Adversarial Data Contaminationcited by 1
  21. 2021Gradient-based Data Subversion Attack Against Binary Classifierscited by 0
  22. 2025Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contaminationcited by 0
  23. 2025Estimation of Stochastic Optimal Transport Mapscited by 0
  24. 2026Robust Processing and Learning: Principles, Methods, and Wireless Applicationscited by 0
  25. 2026Wasserstein Filtering: A Sample Selection Method for Robust Distribution Learningcited by 0