CoChat

Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations

Open access
Mohajerin Esfahani, Peyman, Kuhn, Daniel · 2018 · Mathematical Programming

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/s10107-017-1172-1

Cites

50 of 50 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Research works printed but not linked: 5

  1. Bertsekas, D.P.: Convex Optimization Theory. Athena Scientific, Belmont (2009)
  2. Kallenberg, O.: Foundations of Modern Probability, Probability and its Applications. Springer, New York (1997)
  3. Kantorovich, L.V., Rubinshtein, G.S.: On a space of totally additive functions. Vestn. Leningr. Univ. 13, 52-59 (1958)
  4. Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (2010)
  5. Zhao, C.: Data-Driven Risk-Averse Stochastic Program and Renewable Energy Integration. PhD thesis, University of Florida (2014)

Cited by

See all 1,001

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
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

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.