Metadata-based Multi-Task Bandits with Bayesian Hierarchical ModelsDownload PDF

21 May 2021, 20:44 (modified: 23 Jan 2022, 02:37)NeurIPS 2021 PosterReaders: Everyone
Keywords: Multi-armed Bandits, Thompson sampling, Meta learning, Transfer Learning
TL;DR: We propose a multi-task bandit framework that leverages task-specific metadata to share knowledge via Bayesian hierarchical models.
Abstract: How to explore efficiently is a central problem in multi-armed bandits. In this paper, we introduce the metadata-based multi-task bandit problem, where the agent needs to solve a large number of related multi-armed bandit tasks and can leverage some task-specific features (i.e., metadata) to share knowledge across tasks. As a general framework, we propose to capture task relations through the lens of Bayesian hierarchical models, upon which a Thompson sampling algorithm is designed to efficiently learn task relations, share information, and minimize the cumulative regrets. Two concrete examples for Gaussian bandits and Bernoulli bandits are carefully analyzed. The Bayes regret for Gaussian bandits clearly demonstrates the benefits of information sharing with our algorithm. The proposed method is further supported by extensive experiments.
Supplementary Material: pdf
Code Of Conduct: I certify that all co-authors of this work have read and commit to adhering to the NeurIPS Statement on Ethics, Fairness, Inclusivity, and Code of Conduct.
10 Replies

Loading