mlsanityData to 14 Oct 2026

Large Distant Gradients Need Not Be Reliable: reliability-weighted credit assignment for long-horizon autoregressive forecasting

arXiv 2609.12890 ↗First posted 11 Sep 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

In autoregressive forecasting, long prediction rollouts provide distant supervision, but backpropagation through time (BPTT) carries gradients from those losses through many autoregressive steps. Repeated Jacobian products can make distant gradients dominate the update while amplifying predictable signal and unpredictable innovation together; a large distant gradient therefore need not carry reliable learning signal. Motivated by this, we introduce Internal Dual-Wiener routing (Internal-DW), a backward-only intervention that preserves the full forward rollout and all step losses while reliability-weighting internal gradient routes. At each residual block, we derive bounded Wiener gains for the identity and nonlinear routes that balance preserving predictable learning signal against suppressing unpredictable variation, and estimate them from route-level gradient statistics and an explicit noise model. In a controlled system with known gradient signal-to-noise ratio (SNR), we show that distant gradients can grow even as their SNR falls, and that Internal-DW reduces error in recovering predictable gradient signals and improves forecasting. On four history-dominated, weak-drive testbeds, Internal-DW reduces forecast error by 5.2%-13.8% relative to full BPTT, outperforms gradient clipping and Jacobian regularization on three testbeds, with similar performance on shear flow, and outperforms validation-selected truncated BPTT (TBPTT) on three. It also extends or preserves the fitted optimal training-horizon range across these four testbeds. Across benchmarks, the current Internal-DW estimator has a clear applicability boundary: its benefit diminishes or reverses when usable history is limited or when the selected sampler fails to represent dominant drive-dependent variation. The results show that retaining long-horizon supervision does not require trusting every backward contribution equally.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 35 of its 62 references that are in the map. First posted on arXiv 11 Sep 2026.

Builds on

35 of 62 references.

References · 35

  1. 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
  2. 2020Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecastingcited by 2,169
  3. 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 2,026
  4. 2019Dream to Control: Learning Behaviors by Latent Imaginationcited by 1,653
  5. 2016Training Deep Nets with Sublinear Memory Costcited by 848
  6. 2015Scheduled Sampling for Sequence Prediction with Recurrent Neural Networkscited by 803
  7. 2022Message Passing Neural PDE Solverscited by 386
  8. 2023WeatherBench 2: A benchmark for the next generation of data-driven global weather modelscited by 236
  9. 2016Professor Forcing: A New Algorithm for Training Recurrent Networkscited by 216
  10. 2018RUDDER: Return Decomposition for Delayed Rewardscited by 173
  11. 2015Learning Continuous Control Policies by Stochastic Value Gradientscited by 162
  12. 2024The Well: a Large-Scale Collection of Diverse Physics Simulations for Machine Learningcited by 145
23 more
  1. 2016Decoupled Neural Interfaces using Synthetic Gradientscited by 137
  2. 2021KalmanNet: Neural Network Aided Kalman Filtering for Partially Known Dynamicscited by 132
  3. 2025Agent Lightning: Train ANY AI Agents with Reinforcement Learningcited by 109
  4. 2016Memory-Efficient Backpropagation Through Timecited by 78
  5. 2019Recurrent Kalman Networks: Factorized Inference in High-Dimensional Deep Feature Spacescited by 67
  6. 2021On the difficulty of learning chaotic dynamics with RNNscited by 67
  7. 2023Towards Stability of Autoregressive Neural Operatorscited by 59
  8. 2019PIPPS: Flexible Model-Based Policy Search Robust to the Curse of Chaoscited by 56
  9. 2017Unbiased Online Recurrent Optimizationcited by 47
  10. 2017Unbiasing Truncated Backpropagation Through Timecited by 37
  11. 2018Approximating Real-Time Recurrent Learning with Random Kronecker Factorscited by 29
  12. 2021Synthetic Returns for Long-Term Credit Assignmentcited by 27
  13. 2024Differentiability in Unrolled Training of Neural Physics Simulators on Transient Dynamicscited by 27
  14. 2019Optimal Kronecker-Sum Approximation of Real Time Recurrent Learningcited by 22
  15. 2025Recurrent Neural Operators: Stable Long-Term PDE Predictioncited by 16
  16. 2026TRACE: Turn-level Reward Assignment via Credit Estimation for Long-Horizon Agentscited by 16
  17. 2019Credit Assignment Techniques in Stochastic Computation Graphscited by 14
  18. 2024Do Transformer World Models Give Better Policy Gradients?cited by 10
  19. 2025Accelerated Training through Iterative Gradient Propagation Along the Residual Pathcited by 4
  20. 2026Jacobian-Adaptive Weighting for Stability: Enhancing Long-term Rollout of Neural Partial Differential Equation Solvers via Spatially-Adaptive Regularizationcited by 4
  21. 2026Controlling Transient Amplification Improves Long-horizon Rolloutscited by 3
  22. 2025Temporal horizons in forecasting: a performance-learnability trade-offcited by 1
  23. 2026HERO: History-Enriched Rollout Training for Long-Horizon Autoregressive Neural Operatorscited by 1

Built on by

Not cited yet.