Multi-Stage Predict+Optimize for (Mixed Integer) Linear Programs
Xinyi Hu, Jasper C. H. Lee, Jimmy H. M. Lee, Peter J. Stuckey
Abstract
The recently-proposed framework of Predict+Optimize tackles optimization problems with parameters that are unknown at solving time, in a supervised learning setting. Prior frameworks consider only the scenario where all unknown parameters are (eventually) revealed at the same time. In this work, we propose Multi-Stage Predict+Optimize , a novel extension catering to applications where unknown parameters are instead revealed in sequential stages, with optimization decisions made in between. We further develop three training algorithms for neural networks (NNs) for our framework as proof of concept, all of which can handle mixed integer linear programs. The first baseline algorithm is a natural extension of prior work, training a single NN which makes a single prediction of unknown parameters. The second and third algorithms instead leverage the possibility of updating parameter predictions between stages, and trains one NN per stage . To handle the interdependency between the NNs, we adopt a sequential and parallelized versions of coordinate descent for training. Experimentation on three benchmarks demonstrates the superior learning performance of our methods over classical approaches.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 1ffd7f1b-feaa-4edb-b348-5c1df005c107Cited by top-tier papers2
- Learning to Solve Orienteering Problem with Time Windows and Variable ProfitsSongqun Gao, Zanxi Ruan, Patrick Floor, Marco Roveri et al.ICLR 2026
- FMIP: Joint Continuous-Integer Flow For Mixed-Integer Linear ProgrammingHongpei Li, Hui Yuan, Han Zhang, Jianghao Lin et al.ICLR 2026
Builds on15
- Smart Predict-and-Optimize for Hard Combinatorial Optimization ProblemsJayanta Mandi, Emir Demirovic, Peter J. Stuckey, Tias GunsAAAI 2020 · 184 citations
- Interior Point Solving for LP-based prediction+optimisationJayanta Mandi, Tias GunsNeurIPS 2020 · 138 citations
- Parameterizing Branch-and-Bound Search Trees to Learn Branching PoliciesGiulia Zarpellon, Jason Jo, Andrea Lodi, Yoshua BengioAAAI 2021 · 123 citations
- A General Large Neighborhood Search Framework for Solving Integer Linear ProgramsJialin Song, Ravi Lanka, Yisong Yue, Bistra DilkinaNeurIPS 2020 · 99 citations
- CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming ConstraintsAnselm Paulus, Michal Rolínek, Vít Musil, Brandon Amos et al.ICML 2021 · 73 citations
Related papers
- Two-Stage Predict+Optimize for MILPs with Unknown Parameters in ConstraintsXinyi Hu, Jasper C. H. Lee, Jimmy Ho-Man LeeNeurIPS 2023 · 15 citations
- Predict+Optimize for Packing and Covering LPs with Unknown Parameters in ConstraintsXinyi Hu, Jasper C. H. Lee, Jimmy H. M. LeeAAAI 2023 · 24 citations
- Dynamic Programming for Predict+OptimiseEmir Demirovic, Peter J. Stuckey, Tias Guns, James Bailey et al.AAAI 2020 · 39 citations
- Branch & Learn for Recursively and Iteratively Solvable Problems in Predict+OptimizeXinyi Hu, Jasper C. H. Lee, Jimmy H. M. Lee, Allen Z. ZhongNeurIPS 2022 · 7 citations
- A Divide and Conquer Algorithm for Predict+Optimize with Non-convex ProblemsAli Ugur Guler, Emir Demirovic, Jeffrey Chan, James Bailey et al.AAAI 2022 · 14 citations
