Thompson Sampling Regret Bounds for Contextual Bandits with sub-Gaussian rewards

Amaury Gouverneur, Borja Rodríguez-Gálvez, Tobias J. Oechtering +1

In this work, we study the performance of the Thompson Sampling algorithm for Contextual Bandit problems based on the framework introduced by Neu et al. and their concept of lifted…