A Note on Task-Aware Loss via Reweighing Prediction Loss by Decision-Regret

Author name not available (Why is that?)

Publication date: 9 November 2022

Abstract: 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.

Has companion code repository: https://github.com/angelamzhou/opt-milp-taskloss

This page was built for publication: A Note on Task-Aware Loss via Reweighing Prediction Loss by Decision-Regret

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6416715)