Risk Bounds and Calibration for a Smart Predict-then-Optimize Method
Heyuan Liu, Paul Grigas

TL;DR
This paper develops theoretical risk bounds and calibration results for the SPO+ surrogate loss in predict-then-optimize problems, showing it effectively approximates the true decision error and performs well in practice.
Contribution
It extends the theoretical understanding of the SPO+ loss by providing risk bounds and calibration results, enabling better transfer of surrogate risk to true decision error.
Findings
Risk bounds for SPO+ relative to SPO loss.
High-probability guarantees for empirical minimizers.
Empirical results show SPO+ outperforms standard losses.
Abstract
The predict-then-optimize framework is fundamental in practical stochastic decision-making problems: first predict unknown parameters of an optimization model, then solve the problem using the predicted values. A natural loss function in this setting is defined by measuring the decision error induced by the predicted parameters, which was named the Smart Predict-then-Optimize (SPO) loss by Elmachtoub and Grigas [arXiv:1710.08005]. Since the SPO loss is typically nonconvex and possibly discontinuous, Elmachtoub and Grigas [arXiv:1710.08005] introduced a convex surrogate, called the SPO+ loss, that importantly accounts for the underlying structure of the optimization model. In this paper, we greatly expand upon the consistency results for the SPO+ loss provided by Elmachtoub and Grigas [arXiv:1710.08005]. We develop risk bounds and uniform calibration results for the SPO+ loss relative to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
Taxonomy
TopicsRisk and Portfolio Optimization · Advanced Bandit Algorithms Research · Stochastic Gradient Optimization Techniques
