Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits

Abstract

In the fixed budget thresholding bandit problem, an algorithm sequentially allocates a budgeted number of samples to different distributions. It then predicts whether the mean of each distribution is larger or lower than a given threshold. We introduce a large family of algorithms (containing most existing relevant ones), inspired by the Frank-Wolfe algorithm, and provide a thorough yet generic analysis of their performance. This allowed us to construct new explicit algorithms, for a broad class of problems, whose losses are within a small constant factor of the non-adaptive oracle ones. Quite interestingly, we observed that adaptive methods empirically greatly out-perform non-adaptive oracles, an uncommon behavior in standard online learning settings, such as regret minimization. We explain this surprising phenomenon on an insightful toy problem.
Fichier principal
Vignette du fichier
neurips_2021.pdf (626.98 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03363014 , version 1 (04-10-2021)

Identifiers

  • HAL Id : hal-03363014 , version 1

Cite

Reda Ouhamma, Rémy Degenne, Pierre Gaillard, Vianney Perchet. Online Sign Identification: Minimization of the Number of Errors in Thresholding Bandits. NeurIPS 2021 - 35th International Conference on Neural Information Processing Systems, Dec 2021, Virtual, Canada. pp.1-25. ⟨hal-03363014⟩
261 View
172 Download

Share

Gmail Facebook X LinkedIn More