Distributed Clustering of Linear Bandits in Peer to Peer Networks

2016-04-26 · Nathan Korda, Balazs Szorenyi, Shuai Li

We provide two distributed confidence ball algorithms for solving linear bandit problems in peer to peer networks with limited communication capabilities. For the first, we assume that all the peers are solving the same linear bandit problem, and prove that our algorithm achieves the optimal asymptotic regret rate of any centralised algorithm that can instantly communicate information between the peers. For the second, we assume that there are clusters of peers solving the same bandit problem within each cluster, and we prove that our algorithm discovers these clusters, while achieving the optimal asymptotic regret rate within each one. Through experiments on several real-world datasets, we demonstrate the performance of proposed algorithms compared to the state-of-the-art.

📄 PDF Abstract BibTeX arXiv:1604.07706

Code (0)

등록된 구현이 없습니다.

Tasks

Clustering

Fast Distributed Bandits for Online Recommendation Systems

2020-07-16 · Kanak Mahadik, Qingyun Wu, Shuai Li, Amit Sabne

Contextual bandit algorithms are commonly used in recommender systems, where content popularity can change rapidly. These algorithms continuously learn latent mappings between users and items, based on contexts associate…

Clustering Recommendation Systems

Learning Peer Influence Probabilities with Linear Contextual Bandits

2025-10-21 · Ahmed Sayeed Faruk, Mohammad Shahverdikondori, Elena Zheleva arxiv

In networked environments, it is common for users to share recommendations about content, products, services, and possible courses of action. Whether these recommendations are accepted and acted upon is highly context-de…

Noise-Resilient Ensemble Learning using Evidence Accumulation Clustering

2021-10-18 · Gaëlle Candel, David Naccache

Ensemble Learning methods combine multiple algorithms performing the same task to build a group with superior quality. These systems are well adapted to the distributed setup, where each peer or machine of the network ho…

Clustering Ensemble Learning

C-DLSI: An Extended LSI Tailored for Federated Text Retrieval

2018-10-05 · Qijun Zhu, Dandan Li, Dik Lun Lee

As the web expands in data volume and in geographical distribution, centralized search methods become inefficient, leading to increasing interest in cooperative information retrieval, e.g., federated text retrieval (FTR)…

Clustering Information Retrieval Retrieval Text Retrieval

Heterogeneous Peer Effects in the Linear Threshold Model

2022-01-27 · Christopher Tran, Elena Zheleva

The Linear Threshold Model is a widely used model that describes how information diffuses through a social network. According to this model, an individual adopts an idea or product after the proportion of their neighbors…

Causal Inference model