Bayesian learning of recursively factored environments
- Marc Bellemare
- Joel Veness
- Michael Bowling, University of Alberta
Model-based reinforcement learning techniques have historically encountered a number of difficulties scaling up to large observation spaces. One promising approach has been to decompose the model learning task into a number of smaller, more manageable sub-problems by factoring the observation space. Typically, many different factorizations are possible, which can make it difficult to select an appropriate factorization without extensive testing. In this paper we introduce the class of recursively decomposable factorizations, and show how exact Bayesian inference can be used to efficiently guarantee predictive performance close to the best factorization in this class. We demonstrate the strength of this approach by presenting a collection of empirical results for 20 different Atari 2600 games.
Citation
M. Bellemare, J. Veness, M. Bowling. "Bayesian learning of recursively factored environments". International Conference on Machine Learning (ICML), pp 1211–1219, June 2013.| Keywords: | |
| Category: | In Conference |
| Web Links: | PMLR |
BibTeX
@incollection{Bellemare+al:ICML13,
author = {Marc Bellemare and Joel Veness and Michael Bowling},
title = {Bayesian learning of recursively factored environments},
Pages = {1211–1219},
booktitle = {International Conference on Machine Learning (ICML)},
year = 2013,
}Last Updated: October 29, 2020Submitted by Sabina P
