This work proposes an integrated learning and robust optimization (ILRO) framework, where a robust decision problem is used both to define the training problem (termed the RSPO loss problem), and to produce the deployed decision, which achieves both robustness and learning-decision alignment.
Abstract
Many operational decisions require solving a linear program whose cost vector is unknown at decision time and must be predicted from contextual information. Because prediction and decision are only weakly aligned, the emerging integrated learning and optimization (ILO) paradigm trains the predictor through the downstream problem, judging a prediction by the decision it induces. However, predictions are inevitably imprecise, so robustness often enters the decision stage. To address this issue, we propose an integrated learning and robust optimization (ILRO) framework, where a robust decision problem is used both to define the training problem (termed the RSPO loss problem), and to produce the deployed decision. Thus, this framework simultaneously achieves both robustness and learning-decision alignment. To tackle its computational challenges, we develop a convex surrogate, RSPO+, and characterize when it is Fisher consistent. Moreover, the RSPO loss possesses informative gradients, allowing us to develop first-order computational methods. We also derive finite-sample excess risk bounds for both RSPO and RSPO+ predictors. Numerical experiments on transportation and portfolio problems, in comparison with multiple benchmarks, show the advantage in decision quality of the proposed framework. The gain is more pronounced for scenarios with limited samples, high-dimensional decisions, and model misspecification.
This paper proposes a biobjective formulation that balances prediction accuracy and cost minimization, termed decision-driven regularization, which is shown to be numerically superior to other benchmarks, such as ordinary least squares, random forest, XGBoost, SPO+, perturbation gradient, and learning and rank, in the...
G. Loke, Qin-Shen Tang, Yangge Xiao et al.· INFORMS journal on computing· 1 citation
This paper formalizes strategic decision-focused learning, where an ML system predicts an exogenous state that some agents observe before playing a game, and shows the prediction accuracy-equilibrium payoff landscape can be non-monotonic, i.e., better predictions can degrade performance.
Tinashe Handina, Yu-Cun Diao, Adam Wierman et al.· 0 citations
This work develops an inverse optimization approach to jointly learn the decision-maker's preferences and the decision rules governing their choices, which leads to better predictions and greater flexibility in capturing and replicating expert decision making.
Anurag Holani, Rishabh Gupta, J. Wassick et al.· 1 citation
A learning algorithm for general optimization problems with linear objective functions that eliminates the need to solve inverse optimization problems, and achieves competitive performance in terms of regret compared with existing methods, while offering improved computational efficiency for certain classes of downstre...
Yasunari Hikima, N. Kamiyama, Shinsaku Sakaue et al.· Proceedings of the Thirty-Fi...· 0 citations
This paper presents DiffAPQP, a solver-flexible framework and open-source Python package for scalable DfL with affine-parametric quadratic programs and presents the first solver-based end-to-end DfL demonstration on the IEEE 118-bus system with a 24-hour coupled economic-dispatch and redispatch horizon.
The results show that the possibility of combining consistency and robustness in robust scheduling depends critically on the interaction between the uncertainty model and the machine environment, and the interaction between the uncertainty model and the machine environment.
Yasser Alghouass, Eric Balkanski, Nicole Megow et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.