PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Pure exploration for multi-armed bandit problems
Sébastien Bubeck, Rémi Munos and Gilles Stoltz
(2009) Working Paper. HAL.

Abstract

We consider the framework of stochastic multi-armed bandit problems and study the possibilities and limitations of strategies that explore sequentially the arms. The strategies are assessed in terms of their simple regrets, a regret notion that captures the fact that exploration is only constrained by the number of available rounds (not necessarily known in advance), in contrast to the case when the cumulative regret is considered and when exploitation needs to be performed at the same time. We believe that this performance criterion is suited to situations when the cost of pulling an arm is expressed in terms of resources rather than rewards. We discuss the links between simple and cumulative regrets. The main result is that the required exploration--exploitation trade-offs are qualitatively different, in view of a general lower bound on the simple regret in terms of the cumulative regret. We then refine this statement.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Monograph (Working Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Computational, Information-Theoretic Learning with Statistics
Theory & Algorithms
ID Code:4563
Deposited By:Gilles Stoltz
Deposited On:13 March 2009