Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
Open accessThe DOI matches its Crossref record, with a small difference in title or year; 50 of the 51 references it cites were found in a registry or an index.
Abstract
We consider stochastic programs where the distribution of the uncertain parameters is only observable through a finite training dataset. Using the Wasserstein metric, we construct a ball in the space of (multivariate and non-discrete) probability distributions centered at the uniform distribution on the training samples, and we seek decisions that perform best in view of the worst-case distribution within this Wasserstein ball. The state-of-the-art methods for solving the resulting distributionally robust optimization problems rely on global optimization techniques, which quickly become computationally excruciating. In this paper we demonstrate that, under mild assumptions, the distributionally robust optimization problems over Wasserstein balls can in fact be reformulated as finite convex programs—in many interesting cases even as tractable linear programs. Leveraging recent measure concentration results, we also show that their solutions enjoy powerful finite-sample performance guarantees. Our theoretical results are exemplified in mean-risk portfolio optimization as well as uncertainty quantification.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Distributionally robust optimization [273] provides a promising way to achieve worst-case probabilistic performance by incorporating all sample-generating distributions into an ambiguity set.”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [273]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Optimization of conditional value-at-risk
Rockafellar, R. T., & Uryasev, S. (2000) · The Journal of Risk · doi:10.21314/jor.2000.038 · Cited by 6,725
Bertsimas, D., & Sim, M. (2004) · Operations Research · doi:10.1287/opre.1030.0065 · Cited by 4,557
Topics in Optimal Transportation
Villani, C. (2003) · Graduate Studies in Mathematics · doi:10.1090/gsm/058 · Cited by 4,412
Ben-Tal, A., El Ghaoui, L., & Nemirovski, A. (2009) · Princeton University Press eBooks · doi:10.1515/9781400831050 · Cited by 2,895
Delage, E., & Ye, Y. (2010) · Operations Research · doi:10.1287/opre.1090.0741 · Cited by 1,893
On the rate of convergence in Wasserstein distance of the empirical measure
Fournier, N., & Guillin, A. (2014) · Probability Theory and Related Fields · doi:10.1007/s00440-014-0583-7 · Cited by 1,655
Distributionally Robust Convex Optimization
Wiesemann, W., Kuhn, D., & Sim, M. (2014) · Operations Research · doi:10.1287/opre.2014.1314 · Cited by 947
Lang, S. (1993) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-0897-6 · Cited by 807
Research works printed but not linked: 5
- Bertsekas, D.P.: Convex Optimization Theory. Athena Scientific, Belmont (2009)
- Kallenberg, O.: Foundations of Modern Probability, Probability and its Applications. Springer, New York (1997)
- Kantorovich, L.V., Rubinshtein, G.S.: On a space of totally additive functions. Vestn. Leningr. Univ. 13, 52-59 (1958)
- Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (2010)
- Zhao, C.: Data-Driven Risk-Averse Stochastic Program and Renewable Energy Integration. PhD thesis, University of Florida (2014)
Cited by
Computational Optimal Transport with Applications to Data Sciences
Gabriel, P., & Marco, C. (2019) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000073 · Cited by 2,319
Computational Optimal Transport
Peyré, G., & Cuturi, M. (2019) · now publishers, Inc. eBooks · doi:10.1561/9781680835519 · Cited by 847
Edge artificial intelligence for 6g: vision, enabling technologies, and applications
Letaief, K. B., Shi, Y., Lu, J., & Lu, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126076 · Cited by 829
“Distri-butionally robust optimization [273] provides a promising way to achieve worst-case probabilistic performance by incorporating all sample-generating distributions into an ambiguity set.”
BackgroundDistributionally Robust Neural Networks
Sagawa, S., Koh, P. W., Hashimoto, T., & Liang, P. (2020) · International Conference on Learning Representations · Cited by 780
Distributionally Robust Stochastic Optimization with Wasserstein Distance
Gao, R., & Kleywegt, A. (2023) · Mathematics of Operations Research · doi:10.1287/moor.2022.1275 · Cited by 630
Metadata
- Authors
- Mohajerin Esfahani, P., & Kuhn, D.
- Venue
- Mathematical Programming
- Published
- 2017-07-07
- Volume
- 171
- Issue
- 1-2
- Pages
- 115-166
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W1712265143
- Cited by
- 136
- References
- 51
- Citations by year
- 2025: 6 · 2024: 16 · 2023: 19 · 2022: 10 · 2021: 15 · 2020: 22 · 2019: 14 · 2018: 19 · 2017: 10
- FWCI
- 15.75
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Locations
- Mathematical Programming (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Delft University of Technology
- Topics
- Social Sciences › Decision Sciences › Management Science and Operations Research › Risk and Portfolio Optimization
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Optimal Power Flow Distribution
- Keywords
- distributionally robust optimization, Wasserstein distance, Wasserstein ball, stochastic programming, convex reformulation, linear programming reformulation, concentration measurement, uncertainty quantification, data-driven optimization
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations. https://app.cochat.ai/papers/10.1007/s10107-017-1172-1
- The paper
- Mohajerin Esfahani, P., & Kuhn, D. (2018). Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations. Mathematical Programming. https://doi.org/10.1007/s10107-017-1172-1
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.