Fast and Epsilon-Optimal Discretized Pursuit Learning Automata

作者：Zhang, JunQi; Wang, Cheng; Zhou, MengChu^*

来源：IEEE Transactions on Cybernetics, 2015, 45(10): 2089-2099.

DOI：10.1109/TCYB.2014.2365463

• Discretized pursuit learning automata (LA)
• low computational complexity
• stationary environments

Learning automata (LA) are powerful tools for reinforcement learning. A discretized pursuit LA is the most popular one among them. During an iteration its operation consists of three basic phases: 1) selecting the next action; 2) finding the optimal estimated action; and 3) updating the state probability. However, when the number of actions is large, the learning becomes extremely slow because there are too many updates to be made at each iteration. The increased updates are mostly from phases 1 and 3. A new fast discretized pursuit LA with assured e-optimality is proposed to perform both phases 1 and 3 with the computational complexity independent of the number of actions. Apart from its low computational complexity, it achieves faster convergence speed than the classical one when operating in stationary environments. This paper can promote the applications of LA toward the large-scale-action oriented area that requires efficient reinforcement learning tools with assured e-optimality, fast convergence speed, and low computational complexity for each iteration.

• 出版日期2015-10
• 单位同济大学