Co-Exploration and Co-Exploitation via Shared Structure in Multi-Task Bandits
Not on the map. Why?
Abstract (arXiv)
We propose a novel Bayesian framework for efficient exploration in contextual multi-task multi-armed bandit settings, where the context is only observed partially and dependencies between reward distributions are induced by latent context variables. In order to exploit these structural dependencies, our approach integrates observations across all tasks and learns a global joint distribution, while still allowing personalised inference for new tasks. In this regard, we identify two key sources of epistemic uncertainty, namely structural uncertainty in the latent reward dependencies across arms and tasks, and user-specific uncertainty due to incomplete context and limited interaction history. To put our method into practice, we represent the joint distribution over tasks and rewards using a particle-based approximation of a log-density Gaussian process. This representation enables flexible, data-driven discovery of both inter-arm and inter-task dependencies without prior assumptions on the latent variables. Empirically, we demonstrate that our method outperforms baselines such as hierarchical model bandits, especially in settings with model misspecification or complex latent heterogeneity.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 45 references that are in the map. First posted on arXiv 14 Dec 2025.
Builds on
21 of 45 references.
References · 21
- 2019Aleatoric and Epistemic Uncertainty in Machine Learning: An Introduction to Concepts and Methodscited by 903
- 2013Learning to Optimize Via Posterior Samplingcited by 253
- 2014Online Clustering of Banditscited by 99
- 2021Adapting to Misspecification in Contextual Banditscited by 81
- 2019Meta-learning of Sequential Strategiescited by 68
- 2021Meta-Thompson Samplingcited by 62
- 2021Federated Linear Contextual Banditscited by 61
- 2018Bayesian Optimization in AlphaGocited by 55
- 2017Multi-Task Learning for Contextual Banditscited by 47
- 2020Meta-learning with Stochastic Linear Banditscited by 45
- 2019Meta Dynamic Pricing: Transfer Learning Across Experimentscited by 41
- 2019On Multi-Armed Bandit Designs for Dose-Finding Clinical Trialscited by 32
9 more
- 2021No Regrets for Learning the Prior in Banditscited by 29
- 2021Metadata-based Multi-Task Bandits with Bayesian Hierarchical Modelscited by 24
- 2021Adapting to Misspecification in Contextual Bandits with Offline Regression Oraclescited by 21
- 2021Connections and Equivalences between the Nystr"om Method and Sparse Variational Gaussian Processescited by 17
- 2021Metalearning Linear Bandits by Prior Updatecited by 15
- 2020Multitask Bandit Learning Through Heterogeneous Feedback Aggregationcited by 14
- 2023Neural Contextual Bandits for Personalized Recommendationcited by 10
- 2019Empirical Bayes Regret Minimizationcited by 6
- 2023RoME: A Robust Mixed-Effects Bandit Algorithm for Optimizing Mobile Health Interventionscited by 5
Built on by
Not cited yet.