Skip to Main content Skip to Navigation
Conference papers

Linear Thompson Sampling Revisited

Marc Abeille 1, 2 Alessandro Lazaric 1, 2
1 SEQUEL - Sequential Learning
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : We derive an alternative proof for the regret of Thompson sampling (\ts) in the stochastic linear bandit setting. While we obtain a regret bound of order $\wt{O}(d^{3/2}\sqrt{T})$ as in previous results, the proof sheds new light on the functioning of the \ts. We leverage on the structure of the problem to show how the regret is related to the sensitivity (i.e., the gradient) of the objective function and how selecting optimal arms associated to \textit{optimistic} parameters does control it. Thus we show that \ts can be seen as a generic randomized algorithm where the sampling distribution is designed to have a fixed probability of being optimistic, at the cost of an additional $\sqrt{d}$ regret factor compared to a UCB-like approach. Furthermore, we show that our proof can be readily applied to regularized linear optimization and generalized linear model problems.
Document type :
Conference papers
Complete list of metadata
Contributor : Alessandro Lazaric Connect in order to contact the contributor
Submitted on : Tuesday, March 21, 2017 - 5:37:20 PM
Last modification on : Friday, January 7, 2022 - 3:43:30 AM
Long-term archiving on: : Thursday, June 22, 2017 - 2:16:20 PM


Files produced by the author(s)


  • HAL Id : hal-01493561, version 1



Marc Abeille, Alessandro Lazaric. Linear Thompson Sampling Revisited. AISTATS 2017 - 20th International Conference on Artificial Intelligence and Statistics, Apr 2017, Fort Lauderdale, United States. ⟨hal-01493561⟩



Les métriques sont temporairement indisponibles