mlsanityData to 14 Oct 2026

Outlier-Robust Optimal Transport: Duality, Structure, and Statistical Analysis

arXiv 2111.01361 ↗First posted 2 Nov 2021stat.ML cs.LGcited by 27

Not on the map. Why?

Abstract (arXiv)

The Wasserstein distance, rooted in optimal transport (OT) theory, is a popular discrepancy measure between probability distributions with various applications to statistics and machine learning. Despite their rich structure and demonstrated utility, Wasserstein distances are sensitive to outliers in the considered distributions, which hinders applicability in practice. We propose a new outlier-robust Wasserstein distance mathsfWp^varepsilon which allows for varepsilon outlier mass to be removed from each contaminated distribution. Under standard moment assumptions, mathsfWp^varepsilon is shown to achieve strong robust estimation guarantees under the Huber varepsilon-contamination model. Our formulation of this robust distance amounts to a highly regular optimization problem that lends itself better for analysis compared to previously considered frameworks. Leveraging this, we conduct a thorough theoretical study of mathsfWp^varepsilon, encompassing robustness guarantees, characterization of optimal perturbations, regularity, duality, and statistical estimation. In particular, by decoupling the optimization variables, we arrive at a simple dual form for mathsfWp^varepsilon that can be implemented via an elementary modification to standard, duality-based OT solvers. We illustrate the virtues of our framework via applications to generative modeling with contaminated datasets.

Key facts. Cited by 27 papers in the map (data through 14 Oct 2026). Builds on 20 of its 54 references that are in the map. First posted on arXiv 2 Nov 2021.

Builds on

20 of 54 references.

References · 20

  1. 2019Analyzing and Improving the Image Quality of StyleGANcited by 3,588
  2. 2017Improved Training of Wasserstein GANscited by 2,235
  3. 2015Optimal Transport for Domain Adaptationcited by 463
  4. 2017Wasserstein Auto-Encoderscited by 373
  5. 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 291
  6. 2019Optimal transport mapping via input convex neural networkscited by 206
  7. 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 185
  8. 2017Generalization and Equilibrium in Generative Adversarial Nets (GANs)cited by 166
  9. 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 139
  10. 2021Unbalanced minibatch Optimal Transport; applications to Domain Adaptationcited by 125
  11. 2020Robust Optimal Transport with Applications in Generative Modeling and Domain Adaptationcited by 87
  12. 2015Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Modelcited by 47
8 more
  1. 2020Outlier-Robust Optimal Transportcited by 45
  2. 2019Generalized Resilience and Robust Statisticscited by 37
  3. 2018Optimal Transport Based Distributionally Robust Optimization: Structural Properties and Iterative Schemescited by 30
  4. 2020When OT meets MoM: Robust estimation of Wasserstein Distancecited by 23
  5. 2020Attribute Privacy: Framework and Mechanismscited by 19
  6. 2016Pufferfish Privacy Mechanisms for Correlated Datacited by 16
  7. 2017A Framework for Wasserstein-1-Type Metricscited by 8
  8. 2021Fast block-coordinate Frank-Wolfe algorithm for semi-relaxed optimal transportcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 3; 2023: 9; 2024: 7; 2025: 6; 2026: 2.

27 papers.

Sort:

  1. 2022Statistical, Robustness, and Computational Guarantees for Sliced Wasserstein Distancescited by 41
  2. 2023Outlier-Robust Wasserstein DROcited by 16
  3. 2023Extremal Domain Translation with Neural Optimal Transportcited by 12
  4. 2023Scalable Unbalanced Sobolev Transport for Measures on a Graphcited by 10
  5. 2023Quantum Pufferfish Privacy: A Flexible Privacy Framework for Quantum Systemscited by 9
  6. 2024Generalized Sobolev Transport for Probability Measures on a Graphcited by 9
  7. 2024Robust Barycenter Estimation using Semi-Unbalanced Neural Optimal Transportcited by 9
  8. 2023Optimal Transport for Measures with Noisy Tree Metriccited by 7
  9. 2024A New Robust Partial p-Wasserstein-Based Metric for Comparing Distributionscited by 7
  10. 2024Tree-Sliced Wasserstein Distance: A Geometric Perspectivecited by 7
  11. 2023Addressing GAN Training Instabilities via Tunable Classification Lossescited by 5
  12. 2024Data Distribution Valuationcited by 5
15 more
  1. 2025Distance-Based Tree-Sliced Wasserstein Distancecited by 4
  2. 2024Approximate Algorithms For k-Sparse Wasserstein Barycenter With Outlierscited by 3
  3. 2025Tree-Sliced Wasserstein Distance with Nonlinear Projectioncited by 3
  4. 2023Inference via robust optimal transportation: theory and methodscited by 2
  5. 2023(αD,αG)-GANs: Addressing GAN Training Instabilities via Dual Objectivescited by 2
  6. 2022On the Convergence of Semi-Relaxed Sinkhorn with Marginal Constraint and OT Distance Gapscited by 1
  7. 2023On Robust Wasserstein Barycenter: The Model and Algorithmcited by 1
  8. 2025Robust Alignment via Partial Gromov-Wasserstein Distancescited by 1
  9. 2025Distributionally Robust Optimization with Adversarial Data Contaminationcited by 1
  10. 2022On making optimal transport robust to all outlierscited by 0
  11. 2024On the Shape of Brainscores for Large Language Models (LLMs)cited by 0
  12. 2025Partial Distribution Alignment via Adaptive Optimal Transportcited by 0
  13. 2025E-ROBOT: a dimension-free method for robust statistics and machine learning via Schr"odinger bridgecited by 0
  14. 2026The Observable Wasserstein Distancecited by 0
  15. 2026Partial Optimal Transport on the Circle for All Transported Masses in O(N log N)cited by 0