From Data to Uncertainty Sets: a Machine Learning Approach
Not on the map. Why?
Abstract (arXiv)
Existing approaches of prescriptive analytics -- where inputs of an optimization model can be predicted by leveraging covariates in a machine learning model -- often attempt to optimize the mean value of an uncertain objective. However, when applied to uncertain constraints, these methods rarely work because satisfying a crucial constraint in expectation may result in a high probability of violation. To remedy this, we leverage robust optimization to protect a constraint against the uncertainty of a machine learning model's output. To do so, we design an uncertainty set based on the model's loss function. Intuitively, this approach attempts to minimize the uncertainty around a prediction. Extending guarantees from the robust optimization literature, we derive strong guarantees on the probability of violation. On synthetic computational experiments, our method requires uncertainty sets with radii up to one order of magnitude smaller than those of other approaches.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 25 references that are in the map. First posted on arXiv 4 Mar 2025.
Builds on
6 of 25 references.
References · 6
- 2017Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semanticscited by 1,358
- 2017An Overview of Multi-Task Learning in Deep Neural Networkscited by 803
- 2017Smart "Predict, then Optimize"cited by 339
- 2014From Predictive to Prescriptive Analyticscited by 143
- 2019Reliable training and estimation of variance networkscited by 63
- 2023Predict-then-Calibrate: A New Perspective of Robust Contextual LPcited by 17
Built on by
Not cited yet.