Scalable Decision Focused Learning via Online Trainable Surrogates
Not on the map. Why?
Abstract (arXiv)
Decision support systems often rely on solving complex optimization problems that may require to estimate uncertain parameters beforehand. Recent studies have shown how using traditionally trained estimators for this task can lead to suboptimal solutions. Using the actual decision cost as a loss function (called Decision Focused Learning) can address this issue, but with a severe loss of scalability at training time. To address this issue, we propose an acceleration method based on replacing costly loss function evaluations with an efficient surrogate. Unlike previously defined surrogates, our approach relies on unbiased estimators reducing the risk of spurious local optima and can provide information on its local confidence allowing one to switch to a fallback method when needed. Furthermore, the surrogate is designed for a black-box setting, which enables compensating for simplifications in the optimization model and accounting for recourse actions during cost computation. In our results, the method reduces costly inner solver calls, with a solution quality comparable to other state-of-the-art techniques.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 25 of its 31 references that are in the map. First posted on arXiv 3 Dec 2025.
Builds on
25 of 31 references.
References · 25
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 599
- 2019Differentiable Convex Optimization Layerscited by 465
- 2017Smart "Predict, then Optimize"cited by 339
- 2019Monte Carlo Gradient Estimation in Machine Learningcited by 283
- 2018Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimizationcited by 227
- 2019Differentiation of Blackbox Combinatorial Solverscited by 226
- 2023Decision-Focused Learning: Foundations, State of the Art, Benchmark and Future Opportunitiescited by 130
- 2021Implicit MLE: Backpropagating Through Discrete Exponential Family Distributionscited by 98
- 2024Vanilla Bayesian Optimization Performs Great in High Dimensionscited by 92
- 2020Interior Point Solving for LP-based prediction+optimisationcited by 83
- 2021Decision-Focused Learning: Through the Lens of Learning to Rankcited by 62
13 more
- 2020Contrastive Losses and Solution Caching for Predict-and-Optimizecited by 52
- 2021CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraintscited by 49
- 2020Fast Rates for Contextual Linear Optimizationcited by 43
- 2023Estimate-Then-Optimize versus Integrated-Estimation-Optimization versus Sample Average Approximation: A Stochastic Dominance Perspectivecited by 20
- 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 18
- 2024Decision-Focused Learning with Directional Gradientscited by 16
- 2022Decision-Aware Learning for Optimizing Health Supply Chainscited by 14
- 2022Predict+Optimize for Packing and Covering LPs with Unknown Parameters in Constraintscited by 11
- 2023Score Function Gradient Estimation to Widen the Applicability of Decision-Focused Learningcited by 11
- 2022A Note on Task-Aware Loss via Reweighing Prediction Loss by Decision-Regretcited by 6
- 2023Branch & Learn with Post-hoc Correction for Predict+Optimize with Unknown Parameters in Constraintscited by 5
- 2022UNIFY: a Unified Policy Designing Framework for Solving Constrained Optimization Problems with Machine Learningcited by 1
Built on by
Not cited yet.