mlsanityData to 14 Oct 2026

IGT-OMD: Implicit Gradient Transport for Decision-Focused Learning under Delayed Feedback

arXiv 2605.12693 ↗First posted 12 May 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Decision-focused learning trains predictive models end-to-end against downstream decision loss, but online settings suffer delayed feedback: outcomes may not arrive for many environment interactions. We identify staleness amplification, a failure mode unique to bilevel optimization under delay, in which gradient staleness couples with inner-solver sensitivity to inflate regret beyond single-level delay theory. We prove that any black-box delayed optimizer incurs an irreducible regret cost from inner-solver approximation error, and that gradient staleness contributes a quadratically growing transport error without bilevel-aware correction. Our algorithm, IGT-OMD, applies Implicit Gradient Transport to hypergradients within Online Mirror Descent, re-evaluating stale gradients at the current parameters using stored inner solutions. This method reduces transport error from a quadratic to a linear dependence on delay and achieves the first sublinear regret bound for delayed bilevel optimization with queue-length-adaptive step sizes. Controlled experiments provide a mechanistic fingerprint: transport benefit is exactly 0.0% (p=1.00) at unit delay and grows monotonically to 9.5% at fifty rounds (p<0.001), isolating the correction's effect. On Linear Quadratic Regulator, Warcraft shortest-path, and Sinkhorn optimal transport, IGT-OMD reduces decision loss by 17--55% relative to single-level baselines, with phase transitions matching the theory.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 37 references that are in the map. First posted on arXiv 12 May 2026.

Builds on

21 of 37 references.

References · 21

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2016OpenAI Gymcited by 1,736
  3. 2017Smart "Predict, then Optimize"cited by 339
  4. 2018Approximation Methods for Bilevel Programmingcited by 236
  5. 2018Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimizationcited by 227
  6. 2019Differentiation of Blackbox Combinatorial Solverscited by 226
  7. 2020Bilevel Optimization: Convergence Analysis and Enhanced Designcited by 222
  8. 2013Online Learning under Delayed Feedbackcited by 141
  9. 2023Decision-Focused Learning: Foundations, State of the Art, Benchmark and Future Opportunitiescited by 130
  10. 2021Control-Oriented Model-Based Reinforcement Learning with Implicit Differentiationcited by 35
  11. 2021Online Learning with Optimism and Delaycited by 33
  12. 2022PyEPO: A PyTorch-based End-to-End Predict-then-Optimize Library for Linear and Integer Programmingcited by 32
9 more
  1. 2022Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methodscited by 15
  2. 2019Reducing the variance in online optimization by transporting past gradientscited by 12
  3. 2023Non-Convex Bilevel Optimization with Time-Varying Objective Functionscited by 8
  4. 2023Banker Online Mirror Descent: A Universal Approach for Delayed Online Bandit Learningcited by 7
  5. 2025Online Decision-Focused Learningcited by 4
  6. 2025Stochastic Regret Guarantees for Online Zeroth- and First-Order Bilevel Optimizationcited by 4
  7. 2026A Reduction from Delayed to Immediate Feedback for Online Convex Optimization with Improved Guaranteescited by 3
  8. 2026Decentralized Online Convex Optimization with Unknown Feedback Delayscited by 2
  9. 2024Distributed Stochastic Gradient Descent with Staleness: A Stochastic Delay Differential Equation Based Frameworkcited by 1

Built on by

Not cited yet.