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 | Walker | Average Returns385.7 | 38 | |
| Continuous Control | LunarLanderContinuous offline trajectories v2 | Episodic Cumulative Reward254.6 | 35 | |
| Quadruped | Quadruped | Return522.6 | 33 | |
| Reinforcement Learning | Humanoid | Zero-Shot Reward2.28 | 30 | |
| Reinforcement Learning | cheetah | Return730.1 | 24 | |
| Reinforcement Learning | Trading | Return2.67 | 24 | |
| Reinforcement Learning | MuJoCo HumanoidStandup | Average Performance1.01e+5 | 24 | |
| Control | Beta Tracking | Median Samples17 | 24 | |
| Reinforcement Learning | MuJoCo Hopper v2 | Average Return3.68e+3 | 18 | |
| Reinforcement Learning | MuJoCo HalfCheetah v2 | Average Return1.43e+4 | 18 |
Showing 10 of 240 rows
...