mlsanityData to 7 Oct 2026

Decision-Focused Learning via Tangent-Space Projection of Prediction Error

arXiv 2605.01361 ↗First posted 2 May 2026cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

Decision-Focused Learning (DFL) trains predictors to improve downstream decision quality, but computing regret gradients typically requires differentiating through solvers or relying on surrogate losses, which can be computationally expensive or deviate from the true objective. We show that, under standard regularity with locally stable active constraints, the regret gradient admits a closed-form geometric characterization, equivalent to the prediction error projected onto the tangent space of active constraints, scaled by local curvature. This reveals that regret gradients can be obtained by filtering decision-irrelevant components from the MSE gradient, providing a simpler and more direct alternative to existing approaches. Based on this, we propose PEAR (Projected Error As Regret-gradient), which computes regret gradients via a reduced linear system over active constraints, avoiding differentiation through solver iterations or additional optimization solves. Experiments on LP benchmarks and a real-world QP task show that PEAR achieves the best decision quality among all baselines while being the most computationally efficient, with gains that persist under constraint shifts.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 26 of its 43 references that are in the map. First posted on arXiv 2 May 2026.

Builds on

26 of 43 references.

References · 26

  1. 2021Convex optimizationcited by 2,479
  2. 2022Are Transformers Effective for Time Series Forecasting?cited by 1,400
  3. 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 588
  4. 2019Differentiable Convex Optimization Layerscited by 458
  5. 2016Input Convex Neural Networkscited by 407
  6. 2017Smart "Predict, then Optimize"cited by 332
  7. 2019Differentiation of Blackbox Combinatorial Solverscited by 224
  8. 2018Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimizationcited by 220
  9. 2021Efficient and Modular Implicit Differentiationcited by 199
  10. 2017OSQP: An Operator Splitting Solver for Quadratic Programscited by 156
  11. 2023Decision-Focused Learning: Foundations, State of the Art, Benchmark and Future Opportunitiescited by 129
  12. 2021Implicit MLE: Backpropagating Through Discrete Exponential Family Distributionscited by 97
14 more
  1. 2019Smart Predict-and-Optimize for Hard Combinatorial Optimization Problemscited by 88
  2. 2020Interior Point Solving for LP-based prediction+optimisationcited by 83
  3. 2023A Survey of Contextual Optimization Methods for Decision Making under Uncertaintycited by 81
  4. 2019Deep Declarative Networks: A New Hopecited by 77
  5. 2019Differentiating Through a Cone Programcited by 72
  6. 2021Decision-Focused Learning: Through the Lens of Learning to Rankcited by 61
  7. 2020Contrastive Losses and Solution Caching for Predict-and-Optimizecited by 52
  8. 2022Distributionally Robust End-to-End Portfolio Constructioncited by 17
  9. 2025Decision-informed Neural Networks with Large Language Model Integration for Portfolio Optimizationcited by 14
  10. 2024Differentiation Through Black-Box Quadratic Programming Solverscited by 10
  11. 2025Solver-Free Decision-Focused Learning for Linear Optimization Problemscited by 8
  12. 2023Robust Losses for Decision-Focused Learningcited by 5
  13. 2024Return Prediction for Mean-Variance Portfolio Selection: How Decision-Focused Learning Shapes Forecasting Modelscited by 5
  14. 2025Minimizing Surrogate Losses for Decision-Focused Learning using Differentiable Optimizationcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 3.

3 papers.