Learning Joint Models of Prediction and Optimization
Not on the map. Why?
Abstract (arXiv)
The Predict-Then-Optimize framework uses machine learning models to predict unknown parameters of an optimization problem from exogenous features before solving. This setting is common to many real-world decision processes, and recently it has been shown that decision quality can be substantially improved by solving and differentiating the optimization problem within an end-to-end training loop. However, this approach requires significant computational effort in addition to handcrafted, problem-specific rules for backpropagation through the optimization step, challenging its applicability to a broad class of optimization problems. This paper proposes an alternative method, in which optimal solutions are learned directly from the observable features by joint predictive models. The approach is generic, and based on an adaptation of the Learning-to-Optimize paradigm, from which a rich variety of existing techniques can be employed. Experimental evaluations show the ability of several Learning-to-Optimize methods to provide efficient and accurate solutions to an array of challenging Predict-Then-Optimize problems.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 25 of its 32 references that are in the map. First posted on arXiv 7 Sep 2024.
Builds on
25 of 32 references.
References · 25
- 2021Convex optimizationcited by 2,479
- 2018Attention, Learn to Solve Routing Problems!cited by 646
- 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 633
- 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 600
- 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 588
- 2019Differentiable Convex Optimization Layerscited by 458
- 2017Smart "Predict, then Optimize"cited by 332
- 2019Differentiation of Blackbox Combinatorial Solverscited by 224
- 2018Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimizationcited by 220
- 2021DC3: A learning method for optimization with hard constraintscited by 181
- 2021End-to-End Constrained Optimization Learning: A Surveycited by 154
- 2018Learning Scheduling Algorithms for Data Processing Clusterscited by 133
13 more
- 2023Decision-Focused Learning: Foundations, State of the Art, Benchmark and Future Opportunitiescited by 129
- 2019Smart Predict-and-Optimize for Hard Combinatorial Optimization Problemscited by 88
- 2020Interior Point Solving for LP-based prediction+optimisationcited by 83
- 2019Differentiating Through a Cone Programcited by 72
- 2020Lagrangian Duality for Constrained Deep Learningcited by 72
- 2020Learning Combinatorial Optimization on Graphs: A Survey with Applications to Networkingcited by 70
- 2021Decision-Focused Learning: Through the Lens of Learning to Rankcited by 61
- 2022Self-Supervised Primal-Dual Learning for Constrained Optimizationcited by 60
- 2022End-to-End Learning to Warm-Start for Real-Time Quadratic Optimizationcited by 25
- 2023Leaving the Nest: Going Beyond Local Loss Functions for Predict-Then-Optimizecited by 18
- 2023Landscape Surrogate: Learning Decision Losses for Mathematical Optimization Under Partial Informationcited by 17
- 2023Backpropagation of Unrolled Solvers with Folded Optimizationcited by 13
- 2014NESTA, The NICTA Energy System Test Case Archivecited by 9
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.