A Note on Task-Aware Loss via Reweighing Prediction Loss by Decision-Regret
Not on the map. Why?
Abstract (arXiv)
In this short technical note we propose a baseline for decision-aware learning for contextual linear optimization, which solves stochastic linear optimization when cost coefficients can be predicted based on context information. We propose a decision-aware version of predict-then-optimize. We reweigh the prediction error by the decision regret incurred by an (unweighted) pilot estimator of costs to obtain a decision-aware predictor, then optimize with cost predictions from the decision-aware predictor. This method can be motivated as a finite-difference, iterate-independent approximation of the gradients of previously proposed end-to-end learning algorithms; it is also consistent with previously suggested intuition for end-to-end learning. This baseline is computationally easy to implement with readily available reweighted prediction oracles and linear optimization, and can be implemented with convex optimization so long as the prediction error minimization is convex. Empirically, we demonstrate that this approach can lead to improvements over a "predict-then-optimize" framework for settings with misspecified models, and is competitive with other end-to-end approaches. Therefore, due to its simplicity and ease of use, we suggest it as a simple baseline for end-to-end and decision-aware learning.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 7 of its 8 references that are in the map. First posted on arXiv 9 Nov 2022.
Builds on
7 of 8 references.
References · 7
- 2017Smart "Predict, then Optimize"cited by 339
- 2018Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimizationcited by 227
- 2021End-to-End Constrained Optimization Learning: A Surveycited by 157
- 2019MIPaaL: Mixed Integer Program as a Layercited by 94
- 2019Smart Predict-and-Optimize for Hard Combinatorial Optimization Problemscited by 89
- 2019Generalization Bounds in the Predict-then-Optimize Frameworkcited by 54
- 2021Risk Bounds and Calibration for a Smart Predict-then-Optimize Methodcited by 29
Built on by
Citing papers per year: 2023: 2; 2024: 0; 2025: 2; 2026: 2.
6 papers.
- 2023A Survey of Contextual Optimization Methods for Decision Making under Uncertaintycited by 82
- 2023Leaving the Nest: Going Beyond Local Loss Functions for Predict-Then-Optimizecited by 18
- 2025Decision-Focused Fine-Tuning of Time Series Foundation Models for Dispatchable Feeder Optimizationcited by 5
- 2025Scalable Decision Focused Learning via Online Trainable Surrogatescited by 0
- 2026Scalable Decision-Focused Learning through Cost-Sensitive Regressioncited by 0
- 2026Decision-Driven Regularization: A Blended Model for Learning and Optimizationcited by 0
- 2026Decision-Driven Regularization: A Blended Model for Learning and Optimization15 Aug 2026
- 2026Scalable Decision-Focused Learning through Cost-Sensitive Regression18 May 2026
- 2025Scalable Decision Focused Learning via Online Trainable Surrogates3 Dec 2025
- 2025Decision-Focused Fine-Tuning of Time Series Foundation Models for Dispatchable Feeder Optimization3 Mar 2025
- 2023A Survey of Contextual Optimization Methods for Decision Making under Uncertainty17 Jun 2023
- 2023Leaving the Nest: Going Beyond Local Loss Functions for Predict-Then-Optimize26 May 2023