cs.LGNov 17, 2026

Pareto-Informed Smart "Predict, then Optimize" for Multi-Objective Combinatorial Problems

Authors: Aabhash Dhakal, Tim Lachner

Organizations: University of Würzburg

Abstract

Many real-world planning applications, from logistics, routing to resource allocation, give rise to optimization problems that need to balance multiple, conflicting objectives. While machine learning is often used to predict the unknown parameters or costs of these problems, standard models trained on prediction accuracy can lead to suboptimal plans. Decision-Focused Learning (DFL) addresses this by integrating the downstream optimization task into the training objective. However, existing DFL methods for multi-objective problems rely on simple scalarization, which fails to capture the rich trade-offs of the Pareto Frontier. To address this gap, we propose a Pareto-aware extension to single-objective Smart "Predict, then Optimize" (SPO+) for multi-objective combinatorial optimization problems. Our loss function leverages the true Pareto Frontier, forming a target decision that aligns with a sampled preference vector, and minimizes regret against this target. Experiments on multi-objective shortest path and multi-objective knapsack problems show that our approach outperforms traditional two-stage Mean Squared Error (MSE) baselines. It also surpasses scalarization-based SPO+ approaches.

Figures & tables

Explore similar work

CardsList
  1. Scaling Decision-Focused Learning to Large Problems with Lagrangian Decomposition

    Jun 7, 2026Stéphane Eilles-Chan Way, Hugo Percot, Quentin Cappart +2Predict-Then-OptimizeLearning to Optimize

  2. Scalable Decision-Focused Learning through Cost-Sensitive Regression

    May 18, 2026Noah Schutte, Senne Berden, Tias Guns +2Cost-Sensitive LearningDecision-Focused Learning