mlsanityData to 7 Oct 2026

Exploring More When It Needs in Deep Reinforcement Learning

arXiv 2109.13477 ↗First posted 28 Sep 2021cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

We propose a exploration mechanism of policy in Deep Reinforcement Learning, which is exploring more when agent needs, called Add Noise to Noise (AN2N). The core idea is: when the Deep Reinforcement Learning agent is in a state of poor performance in history, it needs to explore more. So we use cumulative rewards to evaluate which past states the agents have not performed well, and use cosine distance to measure whether the current state needs to be explored more. This method shows that the exploration mechanism of the agent's policy is conducive to efficient exploration. We combining the proposed exploration mechanism AN2N with Deep Deterministic Policy Gradient (DDPG), Soft Actor-Critic (SAC) algorithms, and apply it to the field of continuous control tasks, such as halfCheetah, Hopper, and Swimmer, achieving considerable improvement in performance and convergence speed.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 19 of its 33 references that are in the map. First posted on arXiv 28 Sep 2021.

Builds on

19 of 33 references.

References · 19

  1. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  2. 2015Continuous control with deep reinforcement learningcited by 3,279
  3. 2015Trust Region Policy Optimizationcited by 2,503
  4. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
  5. 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,218
  6. 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
  7. 2017Reinforcement Learning with Deep Energy-Based Policiescited by 659
  8. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
  9. 2016Deep Exploration via Bootstrapped DQNcited by 518
  10. 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 307
  11. 2018Large-Scale Study of Curiosity-Driven Learningcited by 277
  12. 2019Self-Supervised Exploration via Disagreementcited by 263
7 more
  1. 2017Noisy Networks for Explorationcited by 262
  2. 2017Count-Based Exploration with Neural Density Modelscited by 255
  3. 2015Incentivizing Exploration In Reinforcement Learning With Deep Predictive Modelscited by 154
  4. 2014Generalization and Exploration via Randomized Value Functionscited by 112
  5. 2017Count-Based Exploration in Feature Space for Reinforcement Learningcited by 48
  6. 2019Curiosity-Driven Experience Prioritization via Density Estimationcited by 27
  7. 2018Randomized Value Functions via Multiplicative Normalizing Flowscited by 15

Built on by

Not cited yet.