When and Whom to Collaborate with in a Changing Environment: A Collaborative Dynamic Bandit Solution
Not on the map. Why?
Abstract (arXiv)
Collaborative bandit learning, i.e., bandit algorithms that utilize collaborative filtering techniques to improve sample efficiency in online interactive recommendation, has attracted much research attention as it enjoys the best of both worlds. However, all existing collaborative bandit learning solutions impose a stationary assumption about the environment, i.e., both user preferences and the dependency among users are assumed static over time. Unfortunately, this assumption hardly holds in practice due to users' ever-changing interests and dependence relations, which inevitably costs a recommender system sub-optimal performance in practice. In this work, we develop a collaborative dynamic bandit solution to handle a changing environment for recommendation. We explicitly model the underlying changes in both user preferences and their dependency relation as a stochastic process. Individual user's preference is modeled by a mixture of globally shared contextual bandit models with a Dirichlet Process prior. Collaboration among users is thus achieved via Bayesian inference over the global bandit models. Model selection and arm selection for each user are done via Thompson sampling to balance exploitation and exploration. Our solution is proved to maintain a standard tilde O(√T) sublinear regret even in such a challenging environment. And extensive empirical evaluations on both synthetic and real-world datasets further confirmed the necessity of modeling a changing environment and our algorithm's practical advantages against several state-of-the-art online learning solutions.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 15 of its 48 references that are in the map. First posted on arXiv 14 Apr 2021.
Builds on
15 of 48 references.
References · 15
- 2013Learning to Optimize Via Posterior Samplingcited by 253
- 2014Online Clustering of Banditscited by 99
- 2018Learning to Optimize under Non-Stationaritycited by 85
- 2019Weighted Linear Bandits for Non-Stationary Environmentscited by 84
- 2019A New Algorithm for Non-stationary Contextual Bandits: Efficient, Optimal, and Parameter-freecited by 71
- 2017Efficient Contextual Bandits in Non-stationary Worldscited by 62
- 2021A Simple Approach for Non-stationary Linear Banditscited by 54
- 2013A Gang of Banditscited by 49
- 2013Empirical Analysis of Predictive Algorithms for Collaborative Filteringcited by 47
- 2016On Context-Dependent Clustering of Banditscited by 43
- 2019Improved Algorithm on Online Clustering of Banditscited by 38
- 2018Learning Contextual Bandits in a Non-stationary Environmentcited by 26
Built on by
Not cited yet.