[edit]
Thompson Sampling is Asymptotically Optimal in General Environments
Proceedings of the 32nd Conference on Uncertainty in Artificial Intelligence, PMLR R14:88-97, 2016.
Abstract
We discuss a variant of Thompson sampling for nonparametric reinforcement learning in a countable classes of general stochastic environments. These environments can be non-Markov, non-ergodic, and partially observable. We show that Thompson sampling learns the environment classin the sense that (1) asymptotically its value converges to the optimal value in mean and (2) given a recoverability assumption regret is sublinear.