A Reward Optimization Method Based on Action Subrewards in Hierarchical Reinforcement Learning

الملخص EN

Reinforcement learning (RL) is one kind of interactive learning methods.

Its main characteristics are “trial and error” and “related reward.” A hierarchical reinforcement learning method based on action subrewards is proposed to solve the problem of “curse of dimensionality,” which means that the states space will grow exponentially in the number of features and low convergence speed.

The method can reduce state spaces greatly and choose actions with favorable purpose and efficiency so as to optimize reward function and enhance convergence speed.

Apply it to the online learning in Tetris game, and the experiment result shows that the convergence speed of this algorithm can be enhanced evidently based on the new method which combines hierarchical reinforcement learning algorithm and action subrewards.

The “curse of dimensionality” problem is also solved to a certain extent with hierarchical method.

All the performance with different parameters is compared and analyzed as well.