Non-Asymptotic Pure Exploration by Solving Games - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2019

Non-Asymptotic Pure Exploration by Solving Games

Wouter M. Koolen
  • Fonction : Auteur
  • PersonId : 976655
Pierre Ménard
  • Fonction : Auteur
  • PersonId : 1022182

Résumé

Pure exploration (aka active testing) is the fundamental task of sequentially gathering information to answer a query about a stochastic environment. Good algorithms make few mistakes and take few samples. Lower bounds (for multi-armed bandit models with arms in an exponential family) reveal that the sample complexity is determined by the solution to an optimisation problem. The existing state of the art algorithms achieve asymptotic optimality by solving a plug-in estimate of that optimisation problem at each step. We interpret the optimisation problem as an unknown game, and propose sampling rules based on iterative strategies to estimate and converge to its saddle point. We apply no-regret learners to obtain the first finite confidence guarantees that are adapted to the exponential family and which apply to any pure exploration query and bandit structure. Moreover, our algorithms only use a best response oracle instead of fully solving the optimisation problem.
Fichier principal
Vignette du fichier
main.pdf (1.05 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02402665 , version 1 (10-12-2019)

Identifiants

  • HAL Id : hal-02402665 , version 1

Citer

Rémy Degenne, Wouter M. Koolen, Pierre Ménard. Non-Asymptotic Pure Exploration by Solving Games. 2019. ⟨hal-02402665⟩
63 Consultations
36 Téléchargements

Partager

Gmail Facebook X LinkedIn More