Abstract

The overestimation phenomenon caused by function approximation is a well-known issue in value-based reinforcement learning algorithms such as deep Q-networks and DDPG, which could lead to suboptimal policies. To address this issue, TD3 takes the minimum value between a pair of critics. In this paper, we show that the TD3 algorithm introduces underestimation bias in mild assumptions. To obtain a more precise estimation for value function, we unify these two opposites and propose a novel algorithm \underline\{W\}eighted \underline\{D\}elayed \underline\{D\}eep \underline\{D\}eterministic Policy Gradient (WD3), which can eliminate the estimation bias and further improve the performance by weighting a pair of critics. To demonstrate the effectiveness of WD3, we compare the learning process of value function between DDPG, TD3, and WD3. The results verify that our algorithm does eliminate the estimation error of value functions. Furthermore, we evaluate our algorithm on the continuous contro

Authors

(none)

Tags

  • Value-Based
  • Policy Gradient

Stats

  • citations22
  • S2 citationsβ€”
  • github stars0
  • HF likes0
  • heat score10.21
  • arxiv keyhe2020wd3

Related papers