research
∙
06/07/2022
Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits
We study the regret of Thompson sampling (TS) algorithms for exponential...
share
research
∙
03/03/2020
MOTS: Minimax Optimal Thompson Sampling
Thompson sampling is one of the most widely used algorithms for many onl...
research
∙
02/21/2020
Double Explore-then-Commit: Asymptotic Optimality and Beyond
We study the two-armed bandit problem with subGaussian rewards. The expl...
research
∙
02/19/2020