Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Hierarchical reinforcement Thompson composition
Download
index.pdf
Date
2024-01-01
Author
Tanık, Güven Orkun
Ertekin Bolelli, Şeyda
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
17
views
1
downloads
Cite This
Modern real-world control problems call for continuous control domains and robust, sample efficient and explainable control frameworks. We are presenting a framework for recursively composing control skills to solve compositional and progressively complex tasks. The framework promotes reuse of skills, and as a result quick adaptability to new tasks. The decision tree can be observed, providing insight into the agents’ behavior. Furthermore, the skills can be transferred, modified or trained independently, which can simplify reward shaping and increase training speeds considerably. This paper is concerned with efficient composition of control algorithms using reinforcement learning and soft attention. Compositional and temporal abstraction is the key to improving learning and planning in reinforcement learning. Our Thompson sampling inspired soft-attention model is demonstrated to efficiently solve the composition problem.
Subject Keywords
Artificial intelligence agents
,
Reinforcement learning
,
Soft attention
,
Thompson sampling
URI
https://hdl.handle.net/11511/109760
Journal
Neural Computing and Applications
DOI
https://doi.org/10.1007/s00521-024-09732-9
Collections
Department of Computer Engineering, Article
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
G. O. Tanık and Ş. Ertekin Bolelli, “Hierarchical reinforcement Thompson composition,”
Neural Computing and Applications
, pp. 0–0, 2024, Accessed: 00, 2024. [Online]. Available: https://hdl.handle.net/11511/109760.