Aug 2026· INFORMS journal on computing· 1 citation· 71 references
Computer ScienceMathematics
TL;DR
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 authors' synthetic studies.
Abstract
In contextual optimization, the decision maker seeks optimal decisions to minimize a cost function that varies based on observed features. This context is common in many business applications ranging from on-demand delivery and retail operations to portfolio optimization and inventory management. In this paper, we study the learning and optimization approach, which first learns how outcomes result from the features and then selects optimal decisions based on these outcomes. We focus on the integrated learning and optimization literature and identify that a lack of control for prediction accuracy can lead to overfitting and a loss of decision effectiveness against simple separate learning and optimization models. Instead, we propose a biobjective formulation that balances prediction accuracy and cost minimization, termed decision-driven regularization. It also addresses ambiguity in the definition of the cost function via a surrogate that depends on a new hyperparameter. We additionally show that alternative perspectives for formulating the problem, namely robust optimization and regret minimization, lead to models that are closely related to our proposed model. As a consequence, our framework generalizes models such as SPO+. Our model 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 our synthetic studies.
History: Accepted by Pascal Van Hentenryck, Area Editor for Computational Modeling: Methods & Analysis.
Funding: The research of Q. Tang is funded in part by the Ministry of Education, Singapore [Tier 1 Grant RG47/24] and the National Natural Science Foundation of China [Grant 72271147]. The research of X. Zhang is supported by the National Natural Science Foundation of China [Grant 72501273], the Anhui Provincial Natural Science Foundation [Grant 2408085QG222], and the Fundamental Research Funds for the Central Universities [Grant BJ2040160100].
Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0930 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0930 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
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.
Chengpeng Tan, Yu-Chen Mao, Shu-Ming Wang 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
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
Reinforcement Learning to Choose Optimizers is introduced, which formulates the optimization algorithm choice as a sequential decision-making problem and outperforms every portfolio optimizer at all but the smallest budgets.
Martin P van der Schelling, D. Toshniwal, M. A. Bessa· 0 citations
This work argues that, in the presence of a simulation model, natural attempts to integrate variance reduction into optimization, even executed in a reasonable adaptive fashion, encounter fundamental challenges in guaranteeing realistic runtime when using common stochastic gradient descent algorithms.
Trade discounts are among the fastest-acting profit levers available to a distributor of fast-moving consumer goods (FMCG). A distributor typically receives a limited discount budget from the manufacturer and must decide how to spread it across the matrix of stock-keeping units (SKUs) and customers so that company prof...
N. Rabimov, A. Akhatov, M. Khamidov· Международный Журнал Теорети...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.