mlsanityData to 7 Oct 2026

Minimax Statistical Estimation under Wasserstein Contamination

arXiv 2308.01853 ↗First posted 3 Aug 2023stat.ML cs.LG math.STcited by 1

Not on the map. Why?

Abstract (arXiv)

Contaminations are a key concern in modern statistical learning, as small but systematic perturbations of all datapoints can substantially alter estimation results. Here, we study Wasserstein-r contaminations (r≥ 1) in an ℓq norm (q∈ [1,∞]), in which each observation may undergo an adversarial perturbation with bounded cost, complementing the classical Huber model, corresponding to total variation norm, where only a fraction of observations is arbitrarily corrupted. We study both independent and joint (coordinated) contaminations and develop a minimax theory under ℓqr losses. Our analysis encompasses several fundamental problems: location estimation, linear regression, and pointwise nonparametric density estimation. For joint contaminations in location estimation and for prediction in linear regression, we obtain the exact minimax risk, identify least favorable contaminations, and show that the sample mean and least squares predictor are respectively minimax optimal. For location estimation under independent contaminations, we give sharp upper and lower bounds, including exact minimaxity in the Euclidean Wasserstein contamination case, when q=r=2. For pointwise density estimation in any dimension, we derive the optimal rate, showing that it is achieved by kernel density estimation with a bandwidth that is possibly larger than the classical one. Our proofs leverage powerful tools from optimal transport developed over the last 20 years, including the dynamic Benamou-Brenier formulation. Taken together, our results suggest that in contrast to the Huber contamination model, for norm-based Wasserstein contaminations, classical estimators may be nearly optimally robust.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 10 of its 42 references that are in the map. First posted on arXiv 3 Aug 2023.

Builds on

10 of 42 references.

References · 10

  1. 2015Optimal Transport for Domain Adaptationcited by 457
  2. 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 285
  3. 2018DeepJDOT: Deep Joint Distribution Optimal Transport for Unsupervised Domain Adaptationcited by 212
  4. 2016Statistics of Robust Optimization: A Generalized Empirical Likelihood Approachcited by 182
  5. 2015Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Modelcited by 47
  6. 2021Distributionally Robust Learningcited by 44
  7. 2019Generalized Resilience and Robust Statisticscited by 37
  8. 2019Minimax Confidence Intervals for the Sliced Wasserstein Distancecited by 24
  9. 2018Wasserstein Distributionally Robust Kalman Filteringcited by 17
  10. 2021Robust W-GAN-Based Estimation Under Wasserstein Contaminationcited by 9

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.