-
A Simple and Provably Eļ¬cient Algorithm for Asynchronous Federated Contextual...
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... -
Phase Transitions in Bandits with Switching Constraints
The dataset is used to study the stochastic multi-armed bandit problem with a constraint that limits the total cost incurred by switching between actions to be no larger than a...