How should a reinforcement learning agent act if its sole purpose is to efficiently learn an optimal policy for later use? In other words, how should it explore, to be able to exploit later? We formulate this problem as a Markov Decision Process by explicitly modeling the internal state of the agent and propose a principled heuristic for its solution. We present experimental results in a number of domains, also exploring the algorithm’s use for learning a policy for a skill given its reward function—an important but neglected component of skill discovery.
|Title of host publication||Proceedings of the Twenty-Third International Conference on Machine Learning (ICML 2006): Pittsburgh, Pennsylvania, USA, June 25-29, 2006 |
|Editors||William W. Cohen, Andrew Moore|
|Publisher||Association for Computing Machinery|
|Number of pages||8|
|Publication status||Published - 2006|
|Name||ACM International Conference Proceedings|