阅读背景:

PR10.10:#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learning

来源:互联网 

What’s problem?

Count-based exploration algorithms are known to perform near-optimally when used in conjunction with tabular reinforcement learning (RL) methods for solving small discrete Markov decision processes (MDPs). Count-based exploration




你的当前访问异常,请进行认证后继续阅读剩余内容。

分享到: