Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Frequently Asked Questions
Frequently Asked Questions
Communities & Collections
Communities & Collections
Improving reinforcement learning by using sequence trees
Download
index.pdf
Date
2010-12-01
Author
Girgin, Sertan
Polat, Faruk
Alhajj, Reda
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
8
views
9
downloads
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.
Subject Keywords
Software
,
Artificial Intelligence
URI
https://hdl.handle.net/11511/36002
Journal
MACHINE LEARNING
DOI
https://doi.org/10.1007/s10994-010-5182-y
Collections
Department of Computer Engineering, Article