Hierarchical Explanation-Based Reinforcement Learning
Abstract
Explanation-Based Reinforcement Learning (EBRL) was introduced by Dietterich and Flann as a way of combining the ability of Reinforcement Learning (RL) to learn optimal plans with the generalization ability of Explanation-Based Learning (EBL) (Dietterich & Flann, 1995). We extend this work to domains where the agent must order and achieve a sequence of subgoals in an optimal fashion. Hierarchical EBRL can effectively learn optimal policies in some of these sequential task domains even when the subgoals weakly interact with each other. We also show that when a planner that can achieve the individual subgoals is available, our method converges even faster. 1 Introduction Reinforcement Learning (RL) has emerged as the method of choice for building autonomous agents that improve their performance with experience. One obstacle to scaling this approach to large problems is the lack of a robust and justifiable method to generalize from one experience to another. Dietterich and Flann (Dietter...
Cite
Text
Tadepalli and Dietterich. "Hierarchical Explanation-Based Reinforcement Learning." International Conference on Machine Learning, 1997.Markdown
[Tadepalli and Dietterich. "Hierarchical Explanation-Based Reinforcement Learning." International Conference on Machine Learning, 1997.](https://mlanthology.org/icml/1997/tadepalli1997icml-hierarchical/)BibTeX
@inproceedings{tadepalli1997icml-hierarchical,
title = {{Hierarchical Explanation-Based Reinforcement Learning}},
author = {Tadepalli, Prasad and Dietterich, Thomas G.},
booktitle = {International Conference on Machine Learning},
year = {1997},
pages = {358-366},
url = {https://mlanthology.org/icml/1997/tadepalli1997icml-hierarchical/}
}