mlsanityData to 7 Oct 2026

Predict-Then-Optimize by Proxy: Learning Joint Models of Prediction and Optimization

arXiv 2311.13087 ↗First posted 22 Nov 2023cs.LG cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

Many real-world decision processes are modeled by optimization problems whose defining parameters are unknown and must be inferred from observable data. The Predict-Then-Optimize framework uses machine learning models to predict unknown parameters of an optimization problem from features before solving. Recent works show that decision quality can be improved in this setting by solving and differentiating the optimization problem in the training loop, enabling end-to-end training with loss functions defined directly on the resulting decisions. However, this approach can be inefficient and requires handcrafted, problem-specific rules for backpropagation through the optimization step. This paper proposes an alternative method, in which optimal solutions are learned directly from the observable features by 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, accurate, and flexible solutions to an array of challenging Predict-Then-Optimize problems.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 27 of its 34 references that are in the map. First posted on arXiv 22 Nov 2023.

Builds on

27 of 34 references.

References · 27

  1. 2015Pointer Networkscited by 882
  2. 2018Attention, Learn to Solve Routing Problems!cited by 646
  3. 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 633
  4. 2018Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizoncited by 612
  5. 2016Neural Combinatorial Optimization with Reinforcement Learningcited by 600
  6. 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 588
  7. 2019Differentiable Convex Optimization Layerscited by 458
  8. 2017Smart "Predict, then Optimize"cited by 332
  9. 2019Differentiation of Blackbox Combinatorial Solverscited by 224
  10. 2018Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimizationcited by 220
  11. 2021DC3: A learning method for optimization with hard constraintscited by 181
  12. 2021End-to-End Constrained Optimization Learning: A Surveycited by 154
15 more
  1. 2018Learning Scheduling Algorithms for Data Processing Clusterscited by 133
  2. 2023Decision-Focused Learning: Foundations, State of the Art, Benchmark and Future Opportunitiescited by 129
  3. 2019MIPaaL: Mixed Integer Program as a Layercited by 93
  4. 2019Predicting AC Optimal Power Flows: Combining Deep Learning and Lagrangian Dual Methodscited by 93
  5. 2019Differentiating Through a Cone Programcited by 72
  6. 2020Lagrangian Duality for Constrained Deep Learningcited by 72
  7. 2020Learning Combinatorial Optimization on Graphs: A Survey with Applications to Networkingcited by 70
  8. 2022Self-Supervised Primal-Dual Learning for Constrained Optimizationcited by 60
  9. 2018Learning for Constrained Optimization: Identifying Optimal Active Constraint Setscited by 36
  10. 2022End-to-End Learning to Warm-Start for Real-Time Quadratic Optimizationcited by 25
  11. 2021Learning Hard Optimization Problems: A Data Generation Perspectivecited by 21
  12. 2021Fast Approximations for Job Shop Scheduling: A Lagrangian Dual Deep Learning Methodcited by 20
  13. 2023Machine Learning for Cutting Planes in Integer Programming: A Surveycited by 19
  14. 2023Backpropagation of Unrolled Solvers with Folded Optimizationcited by 13
  15. 2014NESTA, The NICTA Energy System Test Case Archivecited by 9

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 1.

4 papers.