mlsanityData to 7 Oct 2026

Bridging the Gap Between Target Networks and Functional Regularization

arXiv 2106.02613 ↗First posted 4 Jun 2021stat.ML cs.LGcited by 7

Not on the map. Why?

Abstract (arXiv)

Bootstrapping is behind much of the successes of deep Reinforcement Learning. However, learning the value function via bootstrapping often leads to unstable training due to fast-changing target values. Target Networks are employed to stabilize training by using an additional set of lagging parameters to estimate the target values. Despite the popularity of Target Networks, their effect on the optimization is still misunderstood. In this work, we show that they act as an implicit regularizer which can be beneficial in some cases, but also have disadvantages such as being inflexible and can result in instabilities, even when vanilla TD(0) converges. To overcome these issues, we propose an explicit Functional Regularization alternative that is flexible and a convex regularizer in function space and we theoretically study its convergence. We conduct an experimental study across a range of environments, discount factors, and off-policiness data collections to investigate the effectiveness of the regularization induced by Target Networks and Functional Regularization in terms of performance, accuracy, and stability. Our findings emphasize that Functional Regularization can be used as a drop-in replacement for Target Networks and result in performance improvement. Furthermore, adjusting both the regularization weight and the network update period in Functional Regularization can result in further performance improvements compared to solely adjusting the network update period as typically done with Target Networks. Our approach also enhances the ability to networks to recover accurate Q-values.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 28 of its 61 references that are in the map. First posted on arXiv 4 Jun 2021.

Builds on

28 of 61 references.

References · 28

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  3. 2015Continuous control with deep reinforcement learningcited by 3,279
  4. 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
  5. 2015Trust Region Policy Optimizationcited by 2,503
  6. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
  7. 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 1,916
  8. 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
  9. 2015Prioritized Experience Replaycited by 1,070
  10. 2017Rainbow: Combining Improvements in Deep Reinforcement Learningcited by 774
  11. 2017A Distributional Perspective on Reinforcement Learningcited by 743
  12. 2015Deep Recurrent Q-Learning for Partially Observable MDPscited by 457
16 more
  1. 2018Maximum a Posteriori Policy Optimisationcited by 318
  2. 2017Noisy Networks for Explorationcited by 262
  3. 2019Stabilizing Transformers for Reinforcement Learningcited by 262
  4. 2018Deep Reinforcement Learning and the Deadly Triadcited by 170
  5. 2018Generalization and Regularization in DQNcited by 117
  6. 2015An Emphatic Approach to the Problem of Off-policy Temporal-Difference Learningcited by 103
  7. 2018Measuring and regularizing networks in function spacecited by 97
  8. 2019Approximate Inference Turns Deep Networks into Gaussian Processescited by 89
  9. 2021Breaking the Deadly Triad with a Target Networkcited by 47
  10. 2019Towards Characterizing Divergence in Deep Q-Learningcited by 43
  11. 2020Gradient Temporal-Difference Learning with Regularized Correctionscited by 38
  12. 2018Relative Entropy Regularized Policy Iterationcited by 32
  13. 2020GRAC: Self-Guided and Self-Regularized Actor-Criticcited by 20
  14. 2020Kalman meets Bellman: Improving Policy Evaluation through Value Trackingcited by 7
  15. 2019Trust Region Value Optimization using Kalman Filteringcited by 6
  16. 2018Natural Gradient Deep Q-learningcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 4; 2026: 2.

7 papers.