Correcting Momentum in Temporal Difference Learning
Not on the map. Why?
Abstract (arXiv)
A common optimization tool used in deep reinforcement learning is momentum, which consists in accumulating and discounting past gradients, reapplying them at each iteration. We argue that, unlike in supervised learning, momentum in Temporal Difference (TD) learning accumulates gradients that become doubly stale: not only does the gradient of the loss change due to parameter updates, the loss itself changes due to bootstrapping. We first show that this phenomenon exists, and then propose a first-order correction term to momentum. We show that this correction term improves sample efficiency in policy evaluation by correcting target value drift. An important insight of this work is that deep RL methods are not always best served by directly importing techniques from the supervised setting.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 26 of its 56 references that are in the map. First posted on arXiv 7 Jun 2021.
Builds on
26 of 56 references.
References · 26
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
- 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2017Rainbow: Combining Improvements in Deep Reinforcement Learningcited by 774
- 2017Revisiting the Arcade Learning Environment: Evaluation Protocols and Open Problems for General Agentscited by 267
- 2020Revisiting Fundamentals of Experience Replaycited by 171
- 2020What Matters In On-Policy Reinforcement Learning? A Large-Scale Empirical Studycited by 157
- 2018Assessing Generalization in Deep Reinforcement Learningcited by 132
- 2018Generalization and Regularization in DQNcited by 117
14 more
- 2019BackPACK: Packing more into backpropcited by 77
- 2019Stiffness: A New Perspective on Generalization in Neural Networkscited by 46
- 2019Towards Characterizing Divergence in Deep Q-Learningcited by 43
- 2020Interference and Generalization in Temporal Difference Learningcited by 41
- 2019Finite-Time Performance Bounds and Adaptive Learning Rate Selection for Two Time-Scale Reinforcement Learningcited by 40
- 2016Nesterov's Accelerated Gradient and Momentum as approximations to Regularised Update Descentcited by 26
- 2018The Utility of Sparse Representations for Control in Reinforcement Learningcited by 23
- 2019Deep Residual Reinforcement Learningcited by 21
- 2018Measuring and Characterizing Generalization in Deep Reinforcement Learningcited by 20
- 2019Momentum in Reinforcement Learningcited by 19
- 2016Accelerated Gradient Temporal Difference Learningcited by 10
- 2016Neural Taylor Approximations: Convergence and Exploration in Rectifier Networkscited by 9
- 2020Adaptive Temporal Difference Learning with Linear Function Approximationcited by 9
- 2020TDprop: Does Jacobi Preconditioning Help Temporal Difference Learning?cited by 3
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 2; 2024: 4; 2025: 2; 2026: 1.
12 papers.
- 2022Understanding and Preventing Capacity Loss in Reinforcement Learningcited by 124
- 2023Resetting the Optimizer in Deep RL: An Empirical Studycited by 26
- 2025Stable Gradients for Stable Learning at Scale in Deep Reinforcement Learningcited by 22
- 2024Can Learned Optimization Make Reinforcement Learning Less Difficult?cited by 14
- 2021Continual Learning In Environments With Polynomial Mixing Timescited by 13
- 2023Learning to Optimize for Reinforcement Learningcited by 12
- 2024Adam on Local Time: Addressing Nonstationarity in RL with Relative Adam Timestepscited by 11
- 2021Memory Augmented Optimizers for Deep Learningcited by 5
- 2024Frequency and Generalisation of Periodic Activation Functions in Reinforcement Learningcited by 4
- 2024Beyond the Boundaries of Proximal Policy Optimizationcited by 3
- 2025ANO : Faster is Better in Noisy Landscapecited by 0
- 2026SingularClip: Preventing Spectral Collapse to Maintain Plasticity in Continual and Reinforcement Learningcited by 0
- 2026SingularClip: Preventing Spectral Collapse to Maintain Plasticity in Continual and Reinforcement Learning18 Aug 2026
- 2025ANO : Faster is Better in Noisy Landscape25 Aug 2025
- 2025Stable Gradients for Stable Learning at Scale in Deep Reinforcement Learning18 Jun 2025
- 2024Adam on Local Time: Addressing Nonstationarity in RL with Relative Adam Timesteps22 Dec 2024
- 2024Beyond the Boundaries of Proximal Policy Optimization1 Nov 2024
- 2024Can Learned Optimization Make Reinforcement Learning Less Difficult?9 Jul 2024
- 2024Frequency and Generalisation of Periodic Activation Functions in Reinforcement Learning9 Jul 2024
- 2023Resetting the Optimizer in Deep RL: An Empirical Study30 Jun 2023
- 2023Learning to Optimize for Reinforcement Learning3 Feb 2023
- 2022Understanding and Preventing Capacity Loss in Reinforcement Learning20 Apr 2022
- 2021Continual Learning In Environments With Polynomial Mixing Times13 Dec 2021
- 2021Memory Augmented Optimizers for Deep Learning20 Jun 2021