BOTS: Batch Bayesian Optimization of Extended Thompson Sampling for Severely Episode-Limited RL Settings
On the map: Deep reinforcement learning methods → RL theory and sample complexity
Abstract (arXiv)
In settings where the application of reinforcement learning (RL) requires running real-world trials, including the optimization of adaptive health interventions, the number of episodes available for learning can be severely limited due to cost or time constraints. In this setting, the bias-variance trade-off of contextual bandit methods can be significantly better than that of more complex full RL methods. However, Thompson sampling bandits are limited to selecting actions based on distributions of immediate rewards. In this paper, we extend the linear Thompson sampling bandit to select actions based on a state-action utility function consisting of the Thompson sampler's estimate of the expected immediate reward combined with an action bias term. We use batch Bayesian optimization over episodes to learn the action bias terms with the goal of maximizing the expected return of the extended Thompson sampler. The proposed approach is able to learn optimal policies for a strictly broader class of Markov decision processes (MDPs) than standard Thompson sampling. Using an adaptive intervention simulation environment that captures key aspects of behavioral dynamics, we show that the proposed method can significantly out-perform standard Thompson sampling in terms of total return, while requiring significantly fewer episodes than standard value function and policy gradient methods.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in RL theory and sample complexity, one of 15 directions in Deep reinforcement learning methods. Builds on 6 of its 17 references that are in the map. First posted on arXiv 30 Nov 2024.
Builds on
6 of 17 references.
References · 6
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
- 2019Scalable Global Optimization via Local Bayesian Optimizationcited by 374
- 2020Batch Policy Learning in Average Reward Markov Decision Processescited by 69
- 2023Approximate Thompson Sampling via Epistemic Neural Networkscited by 31
- 2019BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimizationcited by 30
- 2023Assessing the Impact of Context Inference Error and Partial Observability on RL Methods for Just-In-Time Adaptive Interventionscited by 3
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2024More Efficient Randomized Exploration for Reinforcement Learning via Approximate Sampling
- 2024Thompson Sampling for Infinite-Horizon Discounted Decision Processes
- 2021Feel-Good Thompson Sampling for Contextual Bandits and Reinforcement Learning
- 2025No-Regret Thompson Sampling for Finite-Horizon Markov Decision Processes with Gaussian Processes
- 2025Feel-Good Thompson Sampling for Contextual Bandits: a Markov Chain Monte Carlo Showdown
- 2025Statistical and Algorithmic Foundations of Reinforcement Learning
- 2026Full Bayesian Reinforcement Learning via LF-IBIS
- 2026BFTS: Thompson Sampling with Bayesian Additive Regression Trees