mlsanityData to 7 Oct 2026

t-Soft Update of Target Network for Deep Reinforcement Learning

arXiv 2008.10861 ↗First posted 25 Aug 2020cs.LG stat.MLcited by 16

Not on the map. Why?

Abstract (arXiv)

This paper proposes a new robust update rule of target network for deep reinforcement learning (DRL), to replace the conventional update rule, given as an exponential moving average. The target network is for smoothly generating the reference signals for a main network in DRL, thereby reducing learning variance. The problem with its conventional update rule is the fact that all the parameters are smoothly copied with the same speed from the main network, even when some of them are trying to update toward the wrong directions. This behavior increases the risk of generating the wrong reference signals. Although slowing down the overall update speed is a naive way to mitigate wrong updates, it would decrease learning speed. To robustly update the parameters while keeping learning speed, a t-soft update method, which is inspired by student-t distribution, is derived with reference to the analogy between the exponential moving average and the normal distribution. Through the analysis of the derived t-soft update, we show that it takes over the properties of the student-t distribution. Specifically, with a heavy-tailed property of the student-t distribution, the t-soft update automatically excludes extreme updates that differ from past experiences. In addition, when the updates are similar to the past experiences, it can mitigate the learning delay by increasing the amount of updates. In PyBullet robotics simulations for DRL, an online actor-critic algorithm with the t-soft update outperformed the conventional methods in terms of the obtained return and/or its variance. From the training process by the t-soft update, we found that the t-soft update is globally consistent with the standard soft update, and the update rates are locally adjusted for acceleration or suppression.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). First posted on arXiv 25 Aug 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 5; 2023: 1; 2024: 3; 2025: 1; 2026: 2.

16 papers.

Sort:

By area:

  1. 2022L2C2: Locally Lipschitz Continuous Constraint towards Stable and Smooth Reinforcement Learningcited by 22
  2. 2022AdaTerm: Adaptive T-Distribution Estimated Robust Moments for Noise-Robust Stochastic Gradient Optimizationcited by 10
  3. 2021Optimistic Reinforcement Learning by Forward Kullback-Leibler Divergence Optimizationcited by 6
  4. 2023WISK: A Workload-aware Learned Index for Spatial Keyword Queriescited by 6
  5. 2022Consolidated Adaptive T-soft Update for Deep Reinforcement Learningcited by 5
  6. 2022Proximal Policy Optimization with Adaptive Threshold for Symmetric Relative Density Ratiocited by 5
  7. 2021Adaptive t-Momentum-based Optimization for Unknown Ratio of Outliers in Amateur Data in Imitation Learningcited by 2
  8. 2022Review of Metrics to Measure the Stability, Robustness and Resilience of Reinforcement Learningcited by 2
  9. 2024Cooperative Multi-Agent Deep Reinforcement Learning in Content Ranking Optimizationcited by 2
  10. 2021Optimization Algorithm for Feedback and Feedforward Policies towards Robot Control Robust to Sensing Failurescited by 1
  11. 2024Toward Debugging Deep Reinforcement Learning Programs with RLExplorercited by 1
  12. 2024Design of Restricted Normalizing Flow towards Arbitrary Stochastic Policy with Computational Efficiencycited by 1
4 more
  1. 2021Cross Modality 3D Navigation Using Reinforcement Learning and Neural Style Transfercited by 0
  2. 2025Achieving Hiding and Smart Anti-Jamming Communication: A Parallel DRL Approach against Moving Reactive Jammercited by 0
  3. 2026Target-Aligned Reinforcement Learningcited by 0
  4. 2026Pseudo-Quantized Actor-Critic Algorithm for Robustness to Noisy Temporal Difference Errorcited by 0