Automatic Discovery of Subgoals in Reinforcement Learning Using Diverse Density
Abstract
This paper presents a method by which a rein-forcement learning agent can automatically dis-cover certain types of subgoals online. By creat-ing useful new subgoals while learning, the agent is able to accelerate learning on the current task and to transfer its expertise to other, related tasks through the reuse of its ability to attain subgoals. The agent discovers subgoals based on common-alities across multiple paths to a solution. We cast the task of finding these commonalities as a multiple-instance learning problem and use the concept of diverse density to find solutions. We illustrate this approach using several gridworld tasks. 1.
Cite
Text
McGovern and Barto. "Automatic Discovery of Subgoals in Reinforcement Learning Using Diverse Density." International Conference on Machine Learning, 2001.Markdown
[McGovern and Barto. "Automatic Discovery of Subgoals in Reinforcement Learning Using Diverse Density." International Conference on Machine Learning, 2001.](https://mlanthology.org/icml/2001/mcgovern2001icml-automatic/)BibTeX
@inproceedings{mcgovern2001icml-automatic,
title = {{Automatic Discovery of Subgoals in Reinforcement Learning Using Diverse Density}},
author = {McGovern, Amy and Barto, Andrew G.},
booktitle = {International Conference on Machine Learning},
year = {2001},
pages = {361-368},
url = {https://mlanthology.org/icml/2001/mcgovern2001icml-automatic/}
}