mlsanityData to 7 Oct 2026

Thompson Sampling via Local Uncertainty

arXiv 1910.13673 ↗First posted 30 Oct 2019stat.ML cs.LG stat.MEcited by 12

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

Cited by year

Citing papers per year: 2021: 3; 2022: 5; 2023: 0; 2024: 1; 2025: 3.

12 papers.