## A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits

### Jiafan He · Tianhao Wang · Yifei Min · Quanquan Gu

##### Hall J #539

Keywords: [ federated learning ] [ linear bandits ]

[ Abstract ]
[ [
Wed 30 Nov 2 p.m. PST — 4 p.m. PST

Abstract: We study federated contextual linear bandits, where $M$ agents cooperate with each other to solve a global contextual linear bandit problem with the help of a central server. We consider the asynchronous setting, where all agents work independently and the communication between one agent and the server will not trigger other agents' communication. We propose a simple algorithm named FedLinUCB based on the principle of optimism. We prove that the regret of FedLinUCB is bounded by $\widetilde{\mathcal{O}}(d\sqrt{\sum_{m=1}^M T_m})$ and the communication complexity is $\widetilde{O}(dM^2)$, where $d$ is the dimension of the contextual vector and $T_m$ is the total number of interactions with the environment by agent $m$. To the best of our knowledge, this is the first provably efficient algorithm that allows fully asynchronous communication for federated linear bandits, while achieving the same regret guarantee as in the single-agent setting.

Chat is not available.