mlsanityData to 7 Oct 2026

The Ladder in Chaos: A Simple and Effective Improvement to General DRL Algorithms by Policy Path Trimming and Boosting

arXiv 2303.01391 ↗First posted 2 Mar 2023cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Knowing the learning dynamics of policy is significant to unveiling the mysteries of Reinforcement Learning (RL). It is especially crucial yet challenging to Deep RL, from which the remedies to notorious issues like sample inefficiency and learning instability could be obtained. In this paper, we study how the policy networks of typical DRL agents evolve during the learning process by empirically investigating several kinds of temporal change for each policy parameter. On typical MuJoCo and DeepMind Control Suite (DMC) benchmarks, we find common phenomena for TD3 and RAD agents: 1) the activity of policy network parameters is highly asymmetric and policy networks advance monotonically along very few major parameter directions; 2) severe detours occur in parameter update and harmonic-like changes are observed for all minor parameter directions. By performing a novel temporal SVD along policy learning path, the major and minor parameter directions are identified as the columns of right unitary matrix associated with dominant and insignificant singular values respectively. Driven by the discoveries above, we propose a simple and effective method, called Policy Path Trimming and Boosting (PPTB), as a general plug-in improvement to DRL algorithms. The key idea of PPTB is to periodically trim the policy learning path by canceling the policy updates in minor parameter directions, while boost the learning path by encouraging the advance in major directions. In experiments, we demonstrate the general and significant performance improvements brought by PPTB, when combined with TD3 and RAD in MuJoCo and DMC environments respectively.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 25 of its 33 references that are in the map. First posted on arXiv 2 Mar 2023.

Builds on

25 of 33 references.

References · 25

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  3. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  4. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
  5. 2016OpenAI Gymcited by 1,684
  6. 2018DeepMind Control Suitecited by 935
  7. 2018On Lazy Training in Differentiable Programmingcited by 671
  8. 2020Reinforcement Learning with Augmented Datacited by 452
  9. 2022LM-Nav: Robotic Navigation with Large Pre-Trained Models of Language, Vision, and Actioncited by 435
  10. 2020Agent57: Outperforming the Atari Human Benchmarkcited by 300
  11. 2022The Primacy Bias in Deep Reinforcement Learningcited by 242
  12. 2023The Dormant Neuron Phenomenon in Deep Reinforcement Learningcited by 171
13 more
  1. 2020Implicit Under-Parameterization Inhibits Data-Efficient Deep Reinforcement Learningcited by 134
  2. 2022Understanding and Preventing Capacity Loss in Reinforcement Learningcited by 124
  3. 2020Transient Non-Stationarity and Generalisation in Deep Reinforcement Learningcited by 75
  4. 2021DR3: Value-Based Deep Reinforcement Learning Requires Explicit Regularizationcited by 66
  5. 2021Spectral Normalisation for Deep Reinforcement Learning: an Optimisation Perspectivecited by 64
  6. 2020The Value-Improvement Path: Towards Better Representations for Reinforcement Learningcited by 60
  7. 2021On The Effect of Auxiliary Tasks on Representation Dynamicscited by 56
  8. 2019Towards Characterizing Divergence in Deep Q-Learningcited by 43
  9. 2022Understanding Self-Predictive Learning for Reinforcement Learningcited by 40
  10. 2020Representations for Stable Off-Policy Reinforcement Learningcited by 31
  11. 2022The Phenomenon of Policy Churncited by 28
  12. 2019Harnessing Structures for Value-Based Planning and Reinforcement Learningcited by 24
  13. 2022Overcoming the Spectral Bias of Neural Value Approximationcited by 18

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.