National University of Singapore; California Institute of Technology; Duke University
Tianyuan Jin, Pan Xu, Xiaokui Xiao, Anima Anandkumar
Bandit algorithms;Thompson sampling;exponential family distribution;finite-time regret bound;minimax optimality;asymptotic optimality
Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits