Linear Thompson Sampling Revisited - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Linear Thompson Sampling Revisited

(1, 2) , (1, 2)
1
2

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.
Fichier principal
Vignette du fichier
main.pdf (782.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01493561 , version 1 (21-03-2017)

Identifiers

  • HAL Id : hal-01493561 , version 1

Cite

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⟩
352 View
157 Download

Share

Gmail Facebook Twitter LinkedIn More