Robustness of Anytime Bandit Policies - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2011

Robustness of Anytime Bandit Policies

Antoine Salomon
  • Fonction : Auteur
  • PersonId : 916255
Jean-Yves Audibert
  • Fonction : Auteur
  • PersonId : 931557

Résumé

This paper studies the deviations of the regret in a stochastic multi-armed bandit problem. When the total number of plays n is known beforehand by the agent, Audibert et al. (2009) exhibit a policy such that with probability at least 1-1/n, the regret of the policy is of order log(n). They have also shown that such a property is not shared by the popular ucb1 policy of Auer et al. (2002). This work first answers an open question: it extends this negative result to any anytime policy. The second contribution of this paper is to design anytime robust policies for specific multi-armed bandit problems in which some restrictions are put on the set of possible distributions of the different arms.

Domaines

Autres [stat.ML]
Fichier principal
Vignette du fichier
anytime.pdf (1.14 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00579607 , version 1 (24-03-2011)
hal-00579607 , version 2 (21-07-2011)
hal-00579607 , version 3 (25-07-2011)

Identifiants

Citer

Antoine Salomon, Jean-Yves Audibert. Robustness of Anytime Bandit Policies. 2011. ⟨hal-00579607v2⟩
660 Consultations
187 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More