mlsanityData to 7 Oct 2026

Robust W-GAN-Based Estimation Under Wasserstein Contamination

arXiv 2101.07969 ↗First posted 20 Jan 2021math.ST cs.IT cs.LGcited by 9

Not on the map. Why?

Abstract (arXiv)

Robust estimation is an important problem in statistics which aims at providing a reasonable estimator when the data-generating distribution lies within an appropriately defined ball around an uncontaminated distribution. Although minimax rates of estimation have been established in recent years, many existing robust estimators with provably optimal convergence rates are also computationally intractable. In this paper, we study several estimation problems under a Wasserstein contamination model and present computationally tractable estimators motivated by generative adversarial networks (GANs). Specifically, we analyze properties of Wasserstein GAN-based estimators for location estimation, covariance matrix estimation, and linear regression and show that our proposed estimators are minimax optimal in many scenarios. Finally, we present numerical results which demonstrate the effectiveness of our estimators.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 14 of its 48 references that are in the map. First posted on arXiv 20 Jan 2021.

Builds on

14 of 48 references.

References · 14

  1. 2017Wasserstein GANcited by 635
  2. 2016f-GAN: Training Generative Neural Samplers using Variational Divergence Minimizationcited by 504
  3. 2017Wasserstein Auto-Encoderscited by 371
  4. 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 182
  5. 2015Distributionally Robust Logistic Regressioncited by 124
  6. 2019Wasserstein Adversarial Examples via Projected Sinkhorn Iterationscited by 89
  7. 2019Sliced Gromov-Wassersteincited by 66
  8. 2018Banach Wasserstein GANcited by 56
  9. 2015Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Modelcited by 47
  10. 2019Generalized Resilience and Robust Statisticscited by 37
  11. 2019Multi-marginal Wasserstein GANcited by 32
  12. 2019Deconstructing Generative Adversarial Networkscited by 15
2 more
  1. 2019Generative Adversarial Nets for Robust Scatter Estimation: A Proper Scoring Rule Perspectivecited by 8
  2. 2018Robust Estimation and Generative Adversarial Netscited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 1; 2024: 2; 2025: 4; 2026: 1.

9 papers.