Gaussian processes for sample efficient reinforcement learning with RMAX-like exploration. Jung, T. & Stone, P. In Balcázar, J. L., Bonchi, F., Gionis, A., & Sebag, M., editors, Machine Learning and Knowledge Discovery in Databases, ECML PKDD 2010, volume 6321, of Lecture Notes in Computer Science, pages 601–616. Springer Berlin Heidelberg, Berlin, Heidelberg, 2010.
Gaussian processes for sample efficient reinforcement learning with RMAX-like exploration [link]Paper  doi  abstract   bibtex   
We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achieve low sample complexity. To achieve low sample complexity, since the environment is unknown, an agent must intelligently balance exploration and exploitation, and must be able to rapidly generalize from observations. While in the past a number of related sample efficient RL algorithms have been proposed, to allow theoretical analysis, mainly model-learners with weak generalization capabilities were considered. Here, we separate function approximation in the model learner (which does require samples) from the interpolation in the planner (which does not require samples). For model-learning we apply Gaussian processes regression (GP) which is able to automatically adjust itself to the complexity of the problem (via Bayesian hyperparameter selection) and, in practice, often able to learn a highly accurate model from very little data. In addition, a GP provides a natural way to determine the uncertainty of its predictions, which allows us to implement the ``optimism in the face of uncertainty'' principle used to efficiently control exploration. Our method is evaluated on four common benchmark domains.
@InCollection{SCC.Jung.Stone2010,
  author    = {Jung, Tobias and Stone, Peter},
  title     = {{G}aussian processes for sample efficient reinforcement learning with {RMAX}-like exploration},
  booktitle = {Machine Learning and Knowledge Discovery in Databases, ECML PKDD 2010},
  publisher = {Springer Berlin Heidelberg},
  year      = {2010},
  editor    = {Balc{\'a}zar, Jos{\'e} Luis and Bonchi, Francesco and Gionis, Aristides and Sebag, Mich{\`e}le},
  volume    = {6321},
  series    = {Lecture Notes in Computer Science},
  pages     = {601--616},
  address   = {Berlin, Heidelberg},
  isbn      = {978-3-642-15880-3},
  abstract  = {We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achieve low sample complexity. To achieve low sample complexity, since the environment is unknown, an agent must intelligently balance exploration and exploitation, and must be able to rapidly generalize from observations. While in the past a number of related sample efficient RL algorithms have been proposed, to allow theoretical analysis, mainly model-learners with weak generalization capabilities were considered. Here, we separate function approximation in the model learner (which does require samples) from the interpolation in the planner (which does not require samples). For model-learning we apply Gaussian processes regression (GP) which is able to automatically adjust itself to the complexity of the problem (via Bayesian hyperparameter selection) and, in practice, often able to learn a highly accurate model from very little data. In addition, a GP provides a natural way to determine the uncertainty of its predictions, which allows us to implement the ``optimism in the face of uncertainty'' principle used to efficiently control exploration. Our method is evaluated on four common benchmark domains.},
  doi       = {10.1007/978-3-642-15880-3_44},
  owner     = {Kamalapurkar},
  timestamp = {2017-11-01},
  url       = {https://doi.org/10.1007/978-3-642-15880-3_44},
}
Downloads: 0