Scalable Decision-Focused Learning through Cost-Sensitive Regression
Noah Schutte, Senne Berden, Tias Guns, Krzysztof Postek, Neil Yorke-Smith

TL;DR
This paper introduces a cost-sensitive regression framework for decision-focused learning, significantly improving scalability and efficiency in solving combinatorial optimization problems with uncertain parameters.
Contribution
It formalizes a novel loss function framework that reduces computational costs by requiring minimal problem solves during training, enabling scalable decision-focused learning.
Findings
Achieves comparable downstream task quality to state-of-the-art methods.
Requires only zero or one solve per training instance, greatly improving efficiency.
Enables scaling to larger problem sizes previously infeasible with existing DFL methods.
Abstract
Many real-world combinatorial problems involve uncertain parameters, which can be predicted given contextual features and historical data. These `predict-then-optimize' or `contextual optimization' problems have gained significant attention: end-to-end training methods can now minimize the downstream task cost rather than the predictive error. However, despite their effectiveness, these decision-focused learning (DFL) approaches often rely on repeated solving of the underlying combinatorial optimization problem during training, making them computationally expensive and difficult to scale. We reframe the learning problem as a cost-sensitive multi-output regression problem: multi-output due to the combinatorial problem having multiple uncertain parameters, and cost-sensitive due to the downstream task cost being the real target. Our technical contribution is the formalization of multiple…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
