Lipschitz Bandits without the Lipschitz Constant

Sébastien Bubeck (1) , Gilles Stoltz (2, 3, 4) , Jia Yuan Yu (2, 3, 4)

1 CRM - Centre de Recerca Matemàtica
2 DMA - Département de Mathématiques et Applications - ENS Paris
3 GREGH - Groupement de Recherche et d'Etudes en Gestion à HEC
4 CLASSIC - Computational Learning, Aggregation, Supervised Statistical, Inference, and Classification

We consider the setting of stochastic bandit problems with a continuum of arms. We first point out that the strategies considered so far in the literature only provided theoretical guarantees of the form: given some tuning parameters, the regret is small with respect to a class of environments that depends on these parameters. This is however not the right perspective, as it is the strategy that should adapt to the specific bandit environment at hand, and not the other way round. Put differently, an adaptation issue is raised. We solve it for the special case of environments whose mean-payoff functions are globally Lipschitz. More precisely, we show that the minimax optimal orders of magnitude $L^{d/(d+2)} \, T^{(d+1)/(d+2)}$ of the regret bound against an environment $f$ with Lipschitz constant $L$ over $T$ time instances can be achieved without knowing $L$ or $T$ in advance. This is in contrast to all previously known strategies, which require to some extent the knowledge of $L$ to achieve this performance guarantee.

Domaines: Statistiques [math.ST]; Théorie [stat.TH]; Apprentissage [cs.LG]

Sébastien Bubeck, Gilles Stoltz, Jia Yuan Yu. Lipschitz Bandits without the Lipschitz Constant. ALT 2011 - 22nd International Conference on Algorithmic Learning Theory, Oct 2011, Espoo, Finland. pp.[A venir]. ⟨hal-00595692v2⟩