Decision Regret Minimization for Integrated Predictive Modeling

This direction is merged into another direction: predict-then-optimize gap. Its last version stays readable and citable here.

Version 1 of 127 papers27 conceptsfrozen 2026-10-04

In many real-world applications—from managing energy grids to stocking retail shelves—machine learning is just the first step in a two-stage pipeline. First, a model predicts unknown parameters (like tomorrow’s electricity demand); then, an optimization solver uses those predictions to make a decision (like how much power to generate).

Traditionally, these two stages are decoupled. The predictive model is trained to minimize a standard statistical loss, such as Mean Squared Error (MSE). However, as Adam N. Elmachtoub and Ryan McNellis argue in Decision Trees for Decision-Making under the Predict-then-Optimize Framework, a model that is "accurate" in a statistical sense can still lead to disastrously expensive decisions. Decision-Focused Learning (DFL) seeks to bridge this gap by training models to directly minimize the "regret" of the downstream decision.

The Geometry of Decision Regret

The fundamental challenge of DFL is that the mapping from a prediction to an optimal decision is usually a step function. If you are choosing the shortest path on a graph, a small change in predicted edge weights might not change the optimal path at all—until it suddenly does, causing the "optimal" solution to jump to a different set of edges.

As Emir Demirovic and Tias Guns explain in Dynamic Programming for Predict+Optimise, this makes the decision regret function non-differentiable and discontinuous. For a neural network, this is a nightmare: the gradient is zero almost everywhere, providing no signal for backpropagation, and it becomes infinite at the points where the decision changes. Furthermore, Aymeric Capitaine and Michael Jordan note in Online Decision-Focused Learning that these landscapes are frequently non-convex, meaning standard optimization can easily get trapped in poor local optima.

Smoothing the Decision Surface

To make these problems solvable with gradient descent, researchers have developed techniques to "soften" the solver. The goal is to create a surrogate loss function that is smooth enough to provide useful gradients while remaining faithful to the original decision problem.

One prominent approach is the use of Perturbation Gradient (PG) losses. Vishal Gupta introduces this in Decision-Focused Learning with Directional Gradients, where random noise is injected into the predictions during training. By averaging the resulting decisions, the sharp jumps of the step function are smoothed out into a continuous surface. Similarly, Samuel Tan proposes Empirical Soft Regret (ESR) in Asymptotically Optimal Regret for Black-Box Predict-then-Optimize, which uses a differentiable "soft-argmax" to approximate the selection of the best action, allowing for end-to-end training of complex models like deep neural networks.

Robustness to Model Misspecification

A recurring theme in recent work is the problem of "misspecification"—the reality that our machine learning models are often too simple to capture the true complexity of the world. If your model cannot represent the true relationship between data and costs, standard training might fail even with a smooth loss.

To address this, Ouadie Bennouna, Jiawei Zhang, and Saurabh Amin developed Consistent Integrated Learning and Optimization (CILO). As detailed in Addressing misspecification in contextual optimization, CILO provides a tractable surrogate loss that guarantees optimal decision-making even when the underlying predictive model is wrong. This shift from "predicting accurately" to "deciding optimally" allows the system to prioritize learning the specific parts of the data distribution that matter most for the final decision.

Beyond Approximation: Exact Solutions

While smoothing and surrogates are powerful, some researchers focus on finding the mathematically exact global optimum for the decision-focused objective.

In An Exact Symbolic Reduction of Linear Smart Predict+Optimize to Mixed Integer Linear Programming, Jihwan Jeong and Scott Sanner introduce EMSPO. They use symbolic variable elimination to transform the bi-level training problem (where one optimization problem sits inside another) into a single Mixed-Integer Linear Program (MILP). This allows them to bypass gradients entirely and use industrial-strength solvers to find the best possible model parameters, often reducing decision regret by orders of magnitude compared to approximate methods.

Expanding the Scope

The principles of decision-focused learning are now being extended to more complex scenarios:

By treating the optimization solver not as a separate downstream consumer, but as an integral part of the learning objective, these methods ensure that AI systems are optimized for the actions they take, not just the numbers they predict.

Papers in this version

History & citationVersion 1 · 2026-10-04

Merged into another direction · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_decision_regret_minimization_for_integra_215bf4a0,
  title = {Decision Regret Minimization for Integrated Predictive Modeling},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/decision-regret-minimization-for-integrated-predictive-modeling/rdr_215bf4a069cd4f088cf4f33feb436d4c},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}

This exact version (version 1, frozen text):

@misc{lacuna_decision_regret_minimization_for_integra_215bf4a0_v1,
  title = {Decision Regret Minimization for Integrated Predictive Modeling},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/decision-regret-minimization-for-integrated-predictive-modeling/rdr_215bf4a069cd4f088cf4f33feb436d4c/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}