The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
Abstract
Stochastic programming can effectively describe many decision-making problems in uncertain environments. Unfortunately, such programs are often computationally demanding to solve. In addition, their solution can be misleading when there is ambiguity in the choice of a distribution for the random parameters. In this paper, we propose a model that describes uncertainty in both the distribution form (discrete, Gaussian, exponential, etc.) and moments (mean and covariance matrix). We demonstrate that for a wide range of cost functions the associated distributionally robust (or min-max) stochastic program can be solved efficiently. Furthermore, by deriving a new confidence region for the mean and the covariance matrix of a random vector, we provide probabilistic arguments for using our model in problems that rely heavily on historical data. These arguments are confirmed in a practical example of portfolio selection, where our framework leads to better-performing policies on the “true” distribution underlying the daily returns of financial assets.
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.
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
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
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
Interior-Point Polynomial Algorithms in Convex Programming
Nesterov, Y., & Nemirovskii, A. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970791 · Cited by 4,334
Ben-Tal, A., & Nemirovski, A. (1998) · Mathematics of Operations Research · doi:10.1287/moor.23.4.769 · Cited by 2,598
The ellipsoid method and its consequences in combinatorial optimization
Grötschel, M., Lovász, L., & Schrijver, A. (1981) · Combinatorica · doi:10.1007/bf02579273 · Cited by 2,011
Introduction to Multivariate Analysis
Lee, J. C. (1983) · Technometrics · doi:10.1080/00401706.1983.10487903 · Cited by 1,783
Prékopa, A. (1995) · Springer eBooks · doi:10.1007/978-94-017-3087-7 · Cited by 1,535
Eigenvalues and Condition Numbers of Random Matrices
Edelman, A. (1988) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0609045 · Cited by 1,284
Robust Portfolio Selection Problems
Goldfarb, D., & Iyengar, G. (2003) · Mathematics of Operations Research · doi:10.1287/moor.28.1.1.14260 · Cited by 895
Cited by
Distributionally Robust Convex Optimization
Wiesemann, W., Kuhn, D., & Sim, M. (2014) · Operations Research · doi:10.1287/opre.2014.1314 · Cited by 947
Recent advances in robust optimization: An overview
Gabrel, V., Murat, C., & Thiele, A. (2014) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.09.036 · Cited by 912
From Predictive to Prescriptive Analytics
Bertsimas, D., & Kallus, N. (2020) · Management Science · doi:10.1287/mnsc.2018.3253 · Cited by 784
Robust Solutions of Optimization Problems Affected by Uncertain Probabilities
Ben-Tal, A., den Hertog, D., De Waegenaere, A., Melenberg, B., & Rennen, G. (2013) · Management Science · doi:10.1287/mnsc.1120.1641 · Cited by 748
Supply chain network design under uncertainty: A comprehensive review and future research directions
Govindan, K., Fattahi, M., & Keyvanshokooh, E. (2017) · European Journal of Operational Research · doi:10.1016/j.ejor.2017.04.009 · Cited by 705
Distributionally Robust Optimization and Its Tractable Approximations
Goh, J., & Sim, M. (2010) · Operations Research · doi:10.1287/opre.1090.0795 · Cited by 668
Stochastic Optimization for Unit Commitment—A Review
Zheng, Q. P., Wang, J., & Liu, A. L. (2015) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2014.2355204 · Cited by 643
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
Data-driven robust optimization
Bertsimas, D., Gupta, V., & Kallus, N. (2018) · Mathematical Programming · doi:10.1007/s10107-017-1125-8 · Cited by 611
A framework for sensitivity analysis of decision trees
Kamiński, B., Jakubczyk, M., & Szufel, P. (2018) · Central European Journal of Operations Research · doi:10.1007/s10100-017-0479-6 · Cited by 526
Frameworks and Results in Distributionally Robust Optimization
Rahimian, H., & Mehrotra, S. (2022) · Open Journal of Mathematical Optimization · doi:10.5802/ojmo.15 · Cited by 506
Data-driven chance constrained stochastic program
Jiang, R., & Guan, Y. (2016) · Mathematical Programming · doi:10.1007/s10107-015-0929-7 · Cited by 485
Quantifying Distributional Model Risk via Optimal Transport
Blanchet, J., & Murthy, K. (2019) · Mathematics of Operations Research · doi:10.1287/moor.2018.0936 · Cited by 350
Ning, C., & You, F. (2019) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2019.03.034 · Cited by 343
Wasserstein Distributionally Robust Optimization: Theory and Applications in Machine Learning
Kuhn, D., Esfahani, P. M., Nguyen, V. A., & Shafieezadeh-Abadeh, S. (2019) · Operations Research & Management Science in the Age of Analytics · doi:10.1287/educ.2019.0198 · Cited by 342
Shang, C., & You, F. (2019) · Engineering · doi:10.1016/j.eng.2019.01.019 · Cited by 332
Adaptive Distributionally Robust Optimization
Bertsimas, D., Sim, M., & Zhang, M. (2019) · Management Science · doi:10.1287/mnsc.2017.2952 · Cited by 326
Power systems optimization under uncertainty: A review of methods and applications
Roald, L. A., Pozo, D., Papavasiliou, A., Molzahn, D. K., Kazempour, J., & Conejo, A. (2023) · Electric Power Systems Research · doi:10.1016/j.epsr.2022.108725 · Cited by 317
Certifying Some Distributional Robustness with Principled Adversarial Training
Sinha, A., Namkoong, H., Volpi, R., & Duchi, J. C. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1710.10571 · Cited by 307
Smoothing methods for nonsmooth, nonconvex minimization
Chen, X. (2012) · Mathematical Programming · doi:10.1007/s10107-012-0569-0 · Cited by 295
Monte Carlo sampling-based methods for stochastic optimization
Homem-de-Mello, T., & Bayraksan, G. (2014) · Surveys in Operations Research and Management Science · doi:10.1016/j.sorms.2014.05.001 · Cited by 283
Machine Learning and Portfolio Optimization
Ban, G.-Y., El Karoui, N., & Lim, A. E. B. (2018) · Management Science · doi:10.1287/mnsc.2016.2644 · Cited by 282
Data-Driven Stochastic Unit Commitment for Integrating Wind Generation
Zhao, C., & Guan, Y. (2016) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2015.2477311 · Cited by 279
Zhang, Y., Shen, S., & Mathieu, J. (2016) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2016.2572104 · Cited by 278
On-Time Last-Mile Delivery: Order Assignment with Travel-Time Predictors
Liu, S., He, L., & Max Shen, Z.-J. (2021) · Management Science · doi:10.1287/mnsc.2020.3741 · Cited by 268
Towards Out-Of-Distribution Generalization: A Survey
Liu, J., Shen, Z., He, Y., Zhang, X., Xu, R., Yu, H., & Cui, P. (2021) · arXiv · doi:10.48550/arxiv.2108.13624 · Cited by 253
Koçak, B., Ponsiglione, A., Stanzione, A., Bluethgen, C., Santinha, J., Ugga, L., Huisman, M., Klontzas, M. E., Cannella, R., & Cuocolo, R. (2024) · Diagnostic and Interventional Radiology · doi:10.4274/dir.2024.242854 · Cited by 168
“Other algorithms, such as distribution-ally robust optimization 85 and variations, 86 ensembling approaches, 87-89 adversarial debiasing, 90-95 invariant risk minimization, 96 invariant causal predictors, 96,97 limited capacity models, 98-100 and gradient starvation mitigation, 101 have been…”
Mohajerin Esfahani, P., & Kuhn, D. (2018) · Mathematical Programming · doi:10.1007/s10107-017-1172-1 · Cited by 136
Theory and applications of robust optimization
Bertsimas, D., Brown, D. B., & Caramanis, C. (2011) · SIAM Review · doi:10.1137/080734510 · Cited by 134
Robot Learning From Randomized Simulations: A Review
Muratore, F., Ramos, F., Turk, G., Yu, W., Gienger, M., & Peters, J. (2022) · Frontiers in Robotics and AI · doi:10.3389/frobt.2022.799893 · Cited by 128
Optimal Stochastic Coordinated Beamforming for Wireless Cooperative Networks With CSI Uncertainty
Shi, Y., Zhang, J., & Letaief, K. B. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2385669 · Cited by 61
Large-scale methods for distributionally robust optimization
Levy, D., Carmon, Y., Duchi, J. C., & Sidford, A. (2020) · arXiv · doi:10.48550/arxiv.2010.05893 · Cited by 52
“As a consequence, existing techniques for minimizing the χ 2 objective [2, 20, 3, 5, 47, 22] have ∇ CVaR at level α χ 2 constraint ρ χ 2 penalty λ Objective L ( x ; P 0 ) = sup (cid:107) q (cid:107) ∞ ≤ 1 αN q (cid:62) (cid:96) ( x ) sup D χ 2 ( q ) ≤ ρ q (cid:62) (cid:96) ( x ) sup q [17, 47]…”
BackgroundBootstrap Robust Prescriptive Analytics
Bertsimas, D., & Van Parys, B. (2017) · arXiv · doi:10.48550/arxiv.1711.09974 · Cited by 51
Knowing what you know: valid and validated confidence sets in multiclass and multilabel prediction
Cauchois, M., Gupta, S., & Duchi, J. (2020) · arXiv · doi:10.48550/arxiv.2004.10181 · Cited by 31
An Investigation of Critical Issues in Bias Mitigation Techniques
Shrestha, R., Kafle, K., & Kanan, C. (2022) · 2022 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV) · doi:10.1109/wacv51458.2022.00257 · Cited by 22
Why do classifier accuracies show linear trends under distribution shift?
Mania, H., & Sra, S. (2020) · arXiv · doi:10.48550/arxiv.2012.15483 · Cited by 3
Metadata
- Authors
- Delage, E., & Ye, Y.
- Venue
- Operations Research
- Published
- 2010-06
- Volume
- 58
- Issue
- 3
- Pages
- 595-612
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W1968355947
- Cited by
- 1,893
- References
- 37
- FWCI
- 37.94
- Type
- journal article
- Language
- en
- Open access
- closed
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.