Learning Tetris using the noisy cross-entropy method.
The cross-entropy method is an efficient and general optimization algorithm. However, its applicability in reinforcement learning (RL) seems to be limited because it often converges to suboptimal policies. We apply noise for preventing early convergence of the cross-entropy method, using Tetris, a computer game, for demonstration. The resulting policy outperforms previous RL algorithms by almost two orders of magnitude.
Szita
István
I
szityu@eotvos.elte.hu
Lörincz
András
A
D000465:Algorithms; D003198:Computer Simulation; D019277:Entropy; D006801:Humans; D007858:Learning; D015233:Models, Statistical; D012054:Reinforcement, Psychology