Algorithms based on upper confidence bounds for balancing exploration and exploitation are gaining popularity since they are easy to implement, efficient and effective. This paper considers 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. We provide the first analysis of the expected regret for such algorithms. As expected, our results show that the algorithm that uses the variance estimates has a major advantage over its alternatives that do not use such estimates provided that the variances of the payoffs of the suboptimal arms are low. We also prove that the regret concentrates only at a polynomial rate. This holds for all the upper confidence bound based algorithms and for all bandit problems except those special ones where with probability one the payoff obtained by pulling the optimal arm is larger than the expected payoff for the second best arm. Hence, although upper confidence bound bandit algorithms achieve logarithmic expected regret rates, * Corresponding author. Email addresses: audibert@certis.enpc.fr (Jean Yves Audibert), remi.munos@inria.fr (Rémi Munos), szepesva@cs.ualberta.ca (Csaba Szepesvári) 1 Csaba Szepesvári is on leave from MTA SZTAKI, Budapest, Hungary. Preprint submitted to Theoretical Computer Science January 11, 2009 they might not be suitable for a risk-averse decision maker. We illustrate some of the results by computer simulations.
REF show that the algorithm that uses the variance estimates has a major advantage over its alternatives that do not use such estimates provided that the variances of the payoffs of the suboptimal arms are low.
Exploration-exploitation trade-off using variance estimates in multi-armed bandits
Theor. Comput. Sci.
Theor. Comput. Sci.
Mathematics Computer Science