Distributionally Robust Optimization
Not on the map. Why?
Abstract (arXiv)
Distributionally robust optimization (DRO) studies decision problems under uncertainty where the probability distribution governing the uncertain problem parameters is itself uncertain. A key component of any DRO model is its ambiguity set, that is, a family of probability distributions consistent with any available structural or statistical information. DRO seeks decisions that perform best under the worst distribution in the ambiguity set. This worst case criterion is supported by findings in psychology and neuroscience, which indicate that many decision-makers have a low tolerance for distributional ambiguity. DRO is rooted in statistics, operations research and control theory, and recent research has uncovered its deep connections to regularization techniques and adversarial training in machine learning. This survey presents the key findings of the field in a unified and self-contained manner.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 7 of its 85 references that are in the map. First posted on arXiv 4 Nov 2024.
Builds on
7 of 85 references.
References · 7
- 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 333
- 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 285
- 2016Distributionally Robust Stochastic Optimization with Wasserstein Distancecited by 182
- 2016Statistics of Robust Optimization: A Generalized Empirical Likelihood Approachcited by 182
- 2013Data-Driven Robust Optimizationcited by 84
- 2018On Distributionally Robust Chance Constrained Programs with Wasserstein Distancecited by 15
- 2016Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Ballscited by 5
Built on by
Not cited yet.