A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits
share
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 based on the principle of optimism. We prove that the regret of is bounded by Õ(d√(∑_m=1^M T_m)) and the communication complexity is Õ(dM^2), where d is the dimension of the contextual vector and T_m is the total number of interactions with the environment by m-th agent. To the best of our knowledge, this is the first provably efficient algorithm that allows fully asynchronous communication for federated contextual linear bandits, while achieving the same regret guarantee as in the single-agent setting.
READ FULL TEXT