Thompson Sampling via Local Uncertainty
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Adaptive Action Duration with Contextual Bandits for Deep Reinforcement Learning in Dynamic Environments
You Can Trade Your Experience in Distributed Multi-Agent Multi-Armed Bandits
UProp: Investigating the Uncertainty Propagation of LLMs in Multi-Step Agentic Decision-Making
TextAtari: 100K Frames Game Playing with Language Agents
LLM-Stackelberg Games: Conjectural Reasoning Equilibria and Their Applications to Spearphishing
A Survey of Continual Reinforcement Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.