mlsanityData to 14 Oct 2026

Unifying Distributionally Robust Optimization via Optimal Transport Theory

arXiv 2308.05414 ↗First posted 10 Aug 2023math.OC stat.MLcited by 13

Not on the map. Why?

Abstract (arXiv)

In recent years, two prominent paradigms have shaped distributionally robust optimization (DRO), modeling distributional ambiguity through φ-divergences and Wasserstein distances, respectively. While the former focuses on ambiguity in likelihood ratios, the latter emphasizes ambiguity in outcomes and uses a transportation cost function to capture geometric structure in the outcome space. This paper proposes a unified framework that bridges these approaches by leveraging optimal transport (OT) with conditional moment constraints. Our formulation enables adversarial distributions to jointly perturb likelihood ratios and outcomes, yielding a generalized OT coupling between the nominal and perturbed distributions. We further establish key duality results and develop tractable reformulations that highlight the practical power of our unified approach.

Key facts. Cited by 13 papers in the map (data through 14 Oct 2026). Builds on 44 of its 88 references that are in the map. First posted on arXiv 10 Aug 2023.

Builds on

44 of 88 references.

References · 44

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  2. 2017Improved Training of Wasserstein GANscited by 2,235
  3. 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 337
  4. 2018Learning Models with Uniform Performance via Distributionally Robust Optimizationcited by 335
  5. 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 291
  6. 2016Stochastic Optimization for Large-scale Optimal Transportcited by 189
  7. 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 185
  8. 2019Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learningcited by 170
  9. 2016Variance-based regularization with convex objectivescited by 155
  10. 2015Distributionally Robust Logistic Regressioncited by 126
  11. 2017Large-Scale Optimal Transport and Mapping Estimationcited by 123
  12. 2013Data-Driven Robust Optimizationcited by 85
32 more
  1. 2017Regularization via Mass Transportationcited by 81
  2. 2019Distributionally Robust Optimization: A Reviewcited by 76
  3. 2020Finite-Sample Guarantees for Wasserstein Distributionally Robust Optimization: Breaking the Curse of Dimensionalitycited by 49
  4. 2021Distributionally Robust Learningcited by 44
  5. 2017From Data to Decisions: Distributionally Robust Optimization is Optimalcited by 38
  6. 2021Sinkhorn Distributionally Robust Optimizationcited by 38
  7. 2016Recovering Best Statistical Guarantees via the Empirical Divergence-based Distributionally Robust Optimizationcited by 33
  8. 2018Optimal Transport Based Distributionally Robust Optimization: Structural Properties and Iterative Schemescited by 30
  9. 2021Statistical Analysis of Wasserstein Distributionally Robust Estimatorscited by 27
  10. 2019Confidence Regions in Wasserstein Distributionally Robust Estimationcited by 24
  11. 2020On Linear Optimization over Wasserstein Ballscited by 24
  12. 2021Fast Distributionally Robust Learning with Variance Reduced Min-Max Optimizationcited by 19
  13. 2022Holistic Robust Data-Driven Decisionscited by 18
  14. 2018On Distributionally Robust Chance Constrained Programs with Wasserstein Distancecited by 15
  15. 2020Generalised Lipschitz Regularisation Equals Distributional Robustnesscited by 14
  16. 2013Likelihood Robust Optimization for Data-driven Problemscited by 13
  17. 2021Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solutioncited by 13
  18. 2022A Short and General Duality Proof for Wasserstein Distributionally Robust Optimizationcited by 12
  19. 2020Fast Epigraphical Projection-based Incremental Algorithms for Wasserstein Distributionally Robust Support Vector Machinecited by 10
  20. 2018Data-Driven Chance Constrained Programs over Wasserstein Ballscited by 9
  21. 2022Regularization for Wasserstein Distributionally Robust Optimizationcited by 9
  22. 2023Exact Generalization Guarantees for (Regularized) Wasserstein Distributionally Robust Modelscited by 9
  23. 2023Nash Equilibria, Regularization and Computation in Optimal Transport-Based Distributionally Robust Optimizationcited by 8
  24. 2023Statistical Limit Theorems in Distributionally Robust Optimizationcited by 7
  25. 2023Smoothed f-Divergence Distributionally Robust Optimizationcited by 7
  26. 2022Wasserstein Distributionally Robust Estimation in High Dimensions: Performance Analysis and Optimal Hyperparameter Tuningcited by 6
  27. 2022Tikhonov Regularization is Optimal Transport Robust under Martingale Constraintscited by 6
  28. 2022Entropy-regularized Wasserstein distributionally robust shape and topology optimizationcited by 4
  29. 2015Complete Duality for Martingale Optimal Transport on the Linecited by 3
  30. 2019Optimal Uncertainty Size in Distributionally Robust Inverse Covariance Estimationcited by 3
  31. 2021Higher-Order Expansion and Bartlett Correctability of Distributionally Robust Optimizationcited by 2
  32. 2022Distributionally Robust Gaussian Process Regression and Bayesian Inverse Problemscited by 2

Built on by

Cited by year (2026 to 14 Oct)

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

13 papers.

Sort:

By area: