Addressing Function Approximation Error in Actor-Critic Methods
About
In value-based reinforcement learning methods such as deep Q-learning, function approximation errors are known to lead to overestimated value estimates and suboptimal policies. We show that this problem persists in an actor-critic setting and propose novel mechanisms to minimize its effects on both the actor and the critic. Our algorithm builds on Double Q-learning, by taking the minimum value between a pair of critics to limit overestimation. We draw the connection between target networks and overestimation bias, and suggest delaying policy updates to reduce per-update error and further improve performance. We evaluate our method on the suite of OpenAI gym tasks, outperforming the state of the art in every environment tested.
Scott Fujimoto, Herke van Hoof, David Meger• 2018
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Reinforcement Learning | Hopper v5 | Average Return2.36e+3 | 101 | |
| Reinforcement Learning | Ant v5 | Average Return3.57e+3 | 57 | |
| Reinforcement Learning | Walker | Average Returns385.7 | 38 | |
| Continuous Control | LunarLanderContinuous offline trajectories v2 | Episodic Cumulative Reward254.6 | 35 | |
| Reinforcement Learning | HalfCheetah v3 | Mean Reward8.63e+3 | 34 | |
| Continuous Control | MuJoCo Walker2d v4 | Normalized Performance86.8 | 34 | |
| Quadruped | Quadruped | Return522.6 | 33 | |
| Reinforcement Learning | Humanoid | Zero-Shot Reward2.28 | 30 | |
| Reinforcement Learning | MuJoCo Half-Cheetah | Average Return9.82e+3 | 28 | |
| Continuous Control | MuJoCo Hopper v4 | Normalized Performance3.41e+3 | 28 |
Showing 10 of 305 rows
...