arXiv:2102.06129
Meta-Thompson Sampling
원문 초록
Efficient exploration in bandits is a fundamental online learning problem. We propose a variant of Thompson sampling that learns to explore better as it interacts with bandit instances drawn from an unknown prior. The algorithm meta-learns the prior and thus we call it MetaTS. We propose several efficient implementations of MetaTS and analyze it in Gaussian bandits. Our analysis shows the benefit of meta-learning and is of a broader interest, because we derive a novel prior-dependent Bayes regret bound for Thompson sampling. Our theory is complemented by empirical evaluation, which shows that MetaTS quickly adapts to the unknown prior.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Adaptive Data Augmentation for Thompson Sampling
Scalable and Interpretable Contextual Bandits: A Literature Review and Retail Offer Prototype
In-Domain African Languages Translation Using LLMs and Multi-armed Bandits
Neural Contextual Bandits Under Delayed Feedback Constraints
A Classification View on Meta Learning Bandits
Sparse Nonparametric Contextual Bandits
토론
이 논문과 연결된 포럼 글이 아직 없습니다.