Tuning bandit algorithms in stochastic environments - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2007

Tuning bandit algorithms in stochastic environments


Algorithms based on upper-confidence bounds for balancing exploration and exploitation are gaining popularity since they are easy to implement, efficient and effective. In this paper we consider a variant of the basic algorithm for the stochastic, multi-armed bandit problem that takes into account the empirical variance of the different arms. In earlier experimental works, such algorithms were found to outperform the competing algorithms. The purpose of this paper is to provide a theoretical explanation of these findings and provide theoretical guidelines for the tuning of the parameters of these algorithms. For this we analyze the expected regret and for the first time the concentration of the regret. The analysis of the expected regret shows that variance estimates can be especially advantageous when the payoffs of suboptimal arms have low variance. The risk analysis, rather unexpectedly, reveals that except for some very special bandit problems, the regret, for upper confidence bounds based algorithms with standard bias sequences, concentrates only at a polynomial rate. Hence, although these algorithms achieve logarithmic expected regret rates, they seem less attractive when the risk of suffering much worse than logarithmic regret is also taken into account.
Fichier principal
Vignette du fichier
ucb_alt.pdf (194.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00203487 , version 1 (10-01-2008)


  • HAL Id : inria-00203487 , version 1


Jean-Yves Audibert, Rémi Munos, Csaba Szepesvari. Tuning bandit algorithms in stochastic environments. Algorithmic Learning Theory, 2007, Sendai, Japan. pp.150-165. ⟨inria-00203487⟩
555 View
967 Download


Gmail Facebook Twitter LinkedIn More