.png){kind=icon}
.png){kind=icon}
Return
Improving reinforcement learning by using sequence trees
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-010-5182-y.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a novel approach to discover options in the form of stochastic conditionally terminating sequences; it shows how such sequences can be integrated into the reinforcement learning framework to improve the learning performance. The method utilizes stored histories of possible optimal policies and constructs a specialized tree structure during the learning process. The constructed tree facilitates the process of identifying frequently used action sequences together with states that are visited during the execution of such sequences. The tree is constantly updated and used to implicitly run corresponding options. The effectiveness of the method is demonstrated empirically by conducting extensive experiments on various domains with different properties.
Keywords:
Reinforcement learning
Options
Conditionally terminating sequences
Temporal abstractions
Semi-Markov decision processes