Scalable Decision Focused Learning via Online Trainable Surrogates

Gaetano Signorelli, Michele Lombardi
12/3/2025
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

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.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{signorelli2025scalable,
  title  = {Scalable Decision Focused Learning via Online Trainable Surrogates},
  author = {Gaetano Signorelli and Michele Lombardi},
  year   = {2025},
  eprint = {2512.03861},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.03861v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.03861.svg)](https://codeofpaper.com/paper/2512.03861)

Discussion