强化学习
计算机科学
贝尔曼方程
功能(生物学)
一套
价值(数学)
极限(数学)
人工智能
函数逼近
连接(主束)
时差学习
数学优化
机器学习
数学
人工神经网络
法学
生物
进化生物学
数学分析
政治学
几何学
作者
Scott Fujimoto,Herke van Hoof,David Meger
出处
期刊:Cornell University - arXiv
日期:2018-01-01
被引量:1858
标识
DOI:10.48550/arxiv.1802.09477
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI