Pith. sign in

REVIEW 2 cited by

Smart "Predict, then Optimize"

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1710.08005 v5 pith:2HTWYUHA submitted 2017-10-22 math.OC cs.LGstat.ML

classification math.OCcs.LGstat.ML
keywords losspredictionoptimizationframeworkfunctionproblemconvexerror
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Many real-world analytics problems involve two significant challenges: prediction and optimization. Due to the typically complex nature of each challenge, the standard paradigm is predict-then-optimize. By and large, machine learning tools are intended to minimize prediction error and do not account for how the predictions will be used in the downstream optimization problem. In contrast, we propose a new and very general framework, called Smart "Predict, then Optimize" (SPO), which directly leverages the optimization problem structure, i.e., its objective and constraints, for designing better prediction models. A key component of our framework is the SPO loss function which measures the decision error induced by a prediction. Training a prediction model with respect to the SPO loss is computationally challenging, and thus we derive, using duality theory, a convex surrogate loss function which we call the SPO+ loss. Most importantly, we prove that the SPO+ loss is statistically consistent with respect to the SPO loss under mild conditions. Our SPO+ loss function can tractably handle any polyhedral, convex, or even mixed-integer optimization problem with a linear objective. Numerical experiments on shortest path and portfolio optimization problems show that the SPO framework can lead to significant improvement under the predict-then-optimize paradigm, in particular when the prediction model being trained is misspecified. We find that linear models trained using SPO+ loss tend to dominate random forest algorithms, even when the ground truth is highly nonlinear.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. UC-Search: Risk-Aware Test-Time Search for Delayed Constrained Time-Series Control

    cs.LG 2026-06 unverdicted novelty 7.0 of 10

    UC-Search is a model-agnostic test-time wrapper that adds feasibility-automaton search and uncertainty-based risk adjustment to produce better delayed constrained control than CEM, MPPI, and risk-random baselines on p...

  2. Prediction-Aware Learning in Multi-Agent Systems

    cs.GT 2025-01 accept novelty 6.0 of 10

    A contextual optimistic multiplicative weights algorithm (POMWU) achieves static-game regret, equilibrium convergence, and social welfare guarantees in time-varying games when players can predict the changing state of...

Pith tools