Asymptotically Optimal Problem-Dependent Bandit Policies for Transfer Learning

Adrien Prevost, Timothee Mathieu, Odalric-Ambrym Maillard

We study the non-contextual multi-armed bandit problem in a transfer learning setting: before any pulls, the learner is given N'_k i.i.d. samples from each source distribution nu'_…