PolyStepOR: Learning to Decide Without Optimal Decisions
Not on the map. Why?
Abstract (arXiv)
Decision-focused learning (DFL) trains predictors for downstream decision quality, but often relies on optimal reference decisions that are expensive to obtain. We present PolyStepOR, which trains directly from realized decision costs without pre-computed optima and extends to in-constraint predictions through repair or infeasibility penalties. To handle piecewise-constant losses, PolyStepOR perturbs predictor parameters, evaluates the resulting decisions, and uses optimal transport to favor lower-cost directions, requiring no derivatives. Without task-specific tuning, PolyStepOR performs strongly on classical optimization benchmarks and competitively on predicted-constraint and real-world problems. Theoretically, we characterize decision-preserving perturbations and boundary detection, bound sensitivity to cost errors, and establish stationarity guarantees for a smoothed objective. PolyStepOR thus replaces optimal reference decisions and derivatives with forward evaluations.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 27 of its 37 references that are in the map. First posted on arXiv 26 Sep 2026.
Builds on
27 of 37 references.
References · 27
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 716
- 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 588
- 2017Evolution Strategies as a Scalable Alternative to Reinforcement Learningcited by 555
- 2019Differentiable Convex Optimization Layerscited by 458
- 2017Smart "Predict, then Optimize"cited by 332
- 2019Differentiation of Blackbox Combinatorial Solverscited by 224
- 2018Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimizationcited by 220
- 2023Decision-Focused Learning: Foundations, State of the Art, Benchmark and Future Opportunitiescited by 129
- 2019Learning with Fenchel-Young Lossescited by 117
- 2021Implicit MLE: Backpropagating Through Discrete Exponential Family Distributionscited by 97
- 2021Decision-Focused Learning: Through the Lens of Learning to Rankcited by 61
15 more
- 2018A Unified Analysis of Stochastic Momentum Methods for Deep Learningcited by 54
- 2020Decision Trees for Decision-Making under the Predict-then-Optimize Frameworkcited by 52
- 2020Contrastive Losses and Solution Caching for Predict-and-Optimizecited by 52
- 2021CombOptNet: Fit the Right NP-Hard Problem by Learning Integer Programming Constraintscited by 49
- 2023Landscape Surrogate: Learning Decision Losses for Mathematical Optimization Under Partial Informationcited by 17
- 2024Decision-Focused Learning with Directional Gradientscited by 16
- 2023Accelerating Motion Planning via Optimal Transportcited by 12
- 2022Predict+Optimize for Packing and Covering LPs with Unknown Parameters in Constraintscited by 11
- 2023Score Function Gradient Estimation to Widen the Applicability of Decision-Focused Learningcited by 10
- 2021Learning structured approximations of combinatorial optimization problemscited by 6
- 2022A Solver-Free Framework for Scalable Learning in Neural ILP Architecturescited by 5
- 2025Feasibility-Aware Decision-Focused Learning for Predicting Parameters in the Constraintscited by 5
- 2024DistrictNet: Decision-aware learning for geographical districtingcited by 1
- 2026Training Non-Differentiable Networks via Optimal Transportcited by 1
- 2026Decision-Focused On-Policy Learning for Contextual Linear Optimization with Partial Feedbackcited by 1
Built on by
Not cited yet.