Thompson Sampling via Local Uncertainty
Not on the map. Why?
Abstract (arXiv)
Thompson sampling is an efficient algorithm for sequential decision making, which exploits the posterior uncertainty to address the exploration-exploitation dilemma. There has been significant recent interest in integrating Bayesian neural networks into Thompson sampling. Most of these methods rely on global variable uncertainty for exploration. In this paper, we propose a new probabilistic modeling framework for Thompson sampling, where local latent variable uncertainty is used to sample the mean reward. Variational inference is used to approximate the posterior of the local variable, and semi-implicit structure is further introduced to enhance its expressiveness. Our experimental results on eight contextual bandit benchmark datasets show that Thompson sampling guided by local uncertainty achieves state-of-the-art performance while having low computational complexity.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 Oct 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 5; 2023: 0; 2024: 1; 2025: 3.
12 papers.
- 2022CARD: Classification and Regression Diffusion Modelscited by 102
- 2022Probabilistic Conformal Prediction Using Conditional Random Samplescited by 47
- 2021Contextual Dropout: An Efficient Sample-Dependent Dropout Modulecited by 26
- 2021Bayesian Attention Belief Networkscited by 25
- 2022Langevin Monte Carlo for Contextual Banditscited by 22
- 2022Cooperation in the Latent Space: The Benefits of Adding Mixture Components in Variational Autoencoderscited by 6
- 2025Contextual Thompson Sampling via Generation of Missing Datacited by 5
- 2025Addressing Missing Data Issue for Diffusion-based Recommendationcited by 4
- 2021Analytically Tractable Bayesian Deep Q-Learningcited by 2
- 2024Diffusion Boosted Treescited by 2
- 2022Sample Efficient Learning of Factored Embeddings of Tensor Fieldscited by 0
- 2025EVaDE : Event-Based Variational Thompson Sampling for Model-Based Reinforcement Learningcited by 0
- 2025Addressing Missing Data Issue for Diffusion-based Recommendation18 May 2025
- 2025Contextual Thompson Sampling via Generation of Missing Data10 Feb 2025
- 2025EVaDE : Event-Based Variational Thompson Sampling for Model-Based Reinforcement Learning16 Jan 2025
- 2024Diffusion Boosted Trees3 Jun 2024
- 2022Cooperation in the Latent Space: The Benefits of Adding Mixture Components in Variational Autoencoders30 Sep 2022
- 2022Sample Efficient Learning of Factored Embeddings of Tensor Fields1 Sep 2022
- 2022Langevin Monte Carlo for Contextual Bandits22 Jun 2022
- 2022CARD: Classification and Regression Diffusion Models15 Jun 2022
- 2022Probabilistic Conformal Prediction Using Conditional Random Samples14 Jun 2022
- 2021Analytically Tractable Bayesian Deep Q-Learning21 Jun 2021
- 2021Bayesian Attention Belief Networks9 Jun 2021
- 2021Contextual Dropout: An Efficient Sample-Dependent Dropout Module6 Mar 2021