Thompson Sampling

Notes on measure theoretic probability and bandits.

The goal of my final proect was to present the regret bound on the well known thompson sampling algorithm. Although it worked well in practice, rigorous guarantees on it’s regret were unknown. Goyal and Agarwal provided a bound in 2012. My report attemps to break down their work and can be found here