Learning exploration strategies in model-based reinforcement learning
Lists
Only you see this
Abstract
Reinforcement learning (RL) is a paradigm for learning sequential decision making tasks. However, typically the user must hand-tune exploration parameters for each different domain and/or algorithm that they are using. In this work, we present an algorithm called LEO for learning these exploration strategies on-line. This algorithm makes use of bandit-type algorithms to adaptively select exploration strategies based on the rewards received when following them. We show empirically that this method performs well across a set of five domains. In contrast, for a given algorithm, no set of parameters is best across all domains. Our results demonstrate that the LEO algorithm successfully learns the best exploration strategies on-line, increasing the received reward over static parameterizations of exploration and reducing the need for hand-tuning exploration parameters.
BibTeX
@inproceedings{hester2013learning,
author = {Todd Hester and Manuel Lopes and Peter Stone},
title = {{Learning exploration strategies in model-based reinforcement learning}},
booktitle = {AAMAS},
year = {2013},
}Loading related content...