Better Optimism By Bayes: Adaptive Planning with Rich Models
Arthur Guez, David Silver, Peter Dayan

TL;DR
This paper explores combining rich Bayesian models with near-fully Bayesian planning to improve decision-making in reinforcement learning, overcoming limitations of traditional methods like Thompson sampling.
Contribution
It demonstrates the feasibility and benefits of integrating complex probabilistic models with advanced planning techniques in Bayesian reinforcement learning.
Findings
Outperforms Thompson sampling on contextual bandit problems
Identifies formal issues with over-optimism in Thompson sampling
Shows improved planning with non-parametric Bayesian methods
Abstract
The computational costs of inference and planning have confined Bayesian model-based reinforcement learning to one of two dismal fates: powerful Bayes-adaptive planning but only for simplistic models, or powerful, Bayesian non-parametric models but using simple, myopic planning strategies such as Thompson sampling. We ask whether it is feasible and truly beneficial to combine rich probabilistic models with a closer approximation to fully Bayesian planning. First, we use a collection of counterexamples to show formal problems with the over-optimism inherent in Thompson sampling. Then we leverage state-of-the-art techniques in efficient Bayes-adaptive planning and non-parametric Bayesian methods to perform qualitatively better than both existing conventional algorithms and Thompson sampling on two contextual bandit-like problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Bandit Algorithms Research · Machine Learning and Algorithms · Reinforcement Learning in Robotics
