On Elimination Strategies for Bandit Fixed-Confidence Identification

Tirinzoni, Andrea; Degenne, Rémy

Document type :

Communication dans un congrès avec actes

Title :

On Elimination Strategies for Bandit Fixed-Confidence Identification

Author(s) :

Tirinzoni, Andrea [Auteur]
Meta AI
Degenne, Rémy [Auteur]
Scool [Scool]

Conference title :

NeurIPS 2022 - 36th Conference on Neural Information Processing System

City :

New Orleans

Country :

Etats-Unis d'Amérique

Start date of the conference :

2022-11-28

HAL domain(s) :

Statistiques [stat]/Machine Learning [stat.ML]

English abstract : [en]

Elimination algorithms for bandit identification, which prune the plausible correct answers sequentially until only one remains, are computationally convenient since they reduce the problem size over time. However, existing ...
Show more >Elimination algorithms for bandit identification, which prune the plausible correct answers sequentially until only one remains, are computationally convenient since they reduce the problem size over time. However, existing elimination strategies are often not fully adaptive (they update their sampling rule infrequently) and are not easy to extend to combinatorial settings, where the set of answers is exponentially large in the problem dimension. On the other hand, most existing fully-adaptive strategies to tackle general identification problems are computationally demanding since they repeatedly test the correctness of every answer, without ever reducing the problem size. We show that adaptive methods can be modified to use elimination in both their stopping and sampling rules, hence obtaining the best of these two worlds: the algorithms (1) remain fully adaptive, (2) suffer a sample complexity that is never worse of their non-elimination counterpart, and (3) provably eliminate certain wrong answers early. We confirm these benefits experimentally, where elimination improves significantly the computational complexity of adaptive methods on common tasks like best-arm identification in linear bandits.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

Collections :

Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL

Files

http://arxiv.org/pdf/2205.10936
Open access
Access the document

On Elimination Strategies for Bandit ... BibTeX CSV Excel RIS

Files

On Elimination Strategies for Bandit ...

BibTeX

CSV

Excel

RIS