Bayesian reinforcement learning (BRL) encodes prior knowledge of the world in a model and represents uncertainty in model parameters by maintaining a probability distribution over them. This paper presents Monte Carlo BRL (MC-BRL), a simple and general approach to BRL. MC-BRL samples a priori a finite set of hypotheses for the model parameter values and forms a discrete partially observable Markov decision process (POMDP) whose state space is a cross product of the state space for the reinforcement learning task and the sampled model parameter space. The POMDP does not require conjugate distributions for belief representation, as earlier works do, and can be solved relatively easily with point-based approximation algorithms. MC-BRL naturally handles both fully and partially observable worlds. Theoretical and experimental results show that the discrete POMDP approximates the underlying BRL task well with guaranteed performance.
@article{arxiv.1206.6449,
title = {Monte Carlo Bayesian Reinforcement Learning},
author = {Yi Wang and Kok Sung Won and David Hsu and Wee Sun Lee},
journal= {arXiv preprint arXiv:1206.6449},
year = {2012}
}
Comments
Appears in Proceedings of the 29th International Conference on Machine Learning (ICML 2012)