Robust, Efficient, Globally-Optimized Reinforcement Learning with the Parti-Game Algorithm
暂无分享,去创建一个
Parti-game (Moore 1994a; Moore 1994b; Moore and Atkeson 1995) is a reinforcement learning (RL) algorithm that has a lot of promise in overcoming the curse of dimensionality that can plague RL algorithms when applied to high-dimensional problems. In this paper we introduce modifications to the algorithm that further improve its performance and robustness. In addition, while parti-game solutions can be improved locally by standard local path-improvement techniques, we introduce an add-on algorithm in the same spirit as parti-game that instead tries to improve solutions in a non-local manner.
[1] Andrew W. Moore,et al. The parti-game algorithm for variable resolution reinforcement learning in multidimensional state-spaces , 2004, Machine Learning.
[2] Andrew W. Moore,et al. Variable Resolution Reinforcement Learning. , 1995 .
[3] Ronald J. Williams,et al. Modifying the Parti-game Algorithm for Increased Robustness, Higher Eeciency and Better Policies , 1998 .
[4] Richard S. Sutton,et al. Introduction to Reinforcement Learning , 1998 .