English

Unifying Distributionally Robust Optimization via Optimal Transport Theory

Optimization and Control 2025-12-22 v2 Machine Learning

Abstract

In recent years, two prominent paradigms have shaped distributionally robust optimization (DRO), modeling distributional ambiguity through ϕ\phi-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.

Keywords

Cite

@article{arxiv.2308.05414,
  title  = {Unifying Distributionally Robust Optimization via Optimal Transport Theory},
  author = {Jose Blanchet and Daniel Kuhn and Jiajin Li and Bahar Taskesen},
  journal= {arXiv preprint arXiv:2308.05414},
  year   = {2025}
}
R2 v1 2026-06-28T11:52:35.788Z