Logo image
When and Whom to Collaborate with in a Changing Environment: A Collaborative Dynamic Bandit Solution
Conference proceeding

When and Whom to Collaborate with in a Changing Environment: A Collaborative Dynamic Bandit Solution

Chuanhao Li, Qingyun Wu, Hongning Wang and ASSOC COMP MACHINERY
Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp.1410-1419
ACM Conferences
SIGIR '21: The 44th International ACM SIGIR Conference on Research and Development in Information Retrieval
11/07/2021

Abstract

Computing methodologies -- Machine learning -- Learning paradigms -- Reinforcement learning -- Sequential decision making Information systems -- Information retrieval -- Retrieval tasks and goals -- Recommender systems Theory of computation -- Design and analysis of algorithms -- Online algorithms -- Online learning algorithms Theory of computation -- Theory and algorithms for application domains -- Machine learning theory -- Regret bounds
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 dependency 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. To balance exploitation and exploration during the interactions, Thompson sampling is used for both model selection and arm selection. Our solution is proved to maintain a standard ~O(√T) Bayesian regret in this challenging environment. 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.
url
https://doi.org/10.1145/3404835.3462852View
Published (Version of record) Open

Metrics

1 Record Views

Details

Logo image