A Contextual Bandit Bake-off

Abstract : Contextual bandit algorithms are essential for solving many real-world interactive machine learning problems. Despite multiple recent successes on statistically and computationally efficient methods, the practical behavior of these algorithms is still poorly understood. We leverage the availability of large numbers of supervised learning datasets to compare and empirically optimize contextual bandit algorithms, focusing on practical methods that learn by relying on optimization oracles from supervised learning. We find that a recent method (Foster et al., 2018) using optimism under uncertainty works the best overall. A surprisingly close second is a simple greedy baseline that only explores implicitly through the diversity of contexts, followed by a variant of Online Cover (Agarwal et al., 2014) which tends to be more conservative but robust to problem specification by design. Along the way, we also evaluate and improve several internal components of contextual bandit algorithm design. Overall, this is a thorough study and review of contextual bandit methodology.
Type de document :
Pré-publication, Document de travail
Liste complète des métadonnées

Contributeur : Alberto Bietti <>
Soumis le : mercredi 26 décembre 2018 - 19:46:54
Dernière modification le : vendredi 4 janvier 2019 - 16:49:19


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01708310, version 3
  • ARXIV : 1802.04064



Alberto Bietti, Alekh Agarwal, John Langford. A Contextual Bandit Bake-off. 2018. 〈hal-01708310v3〉



Consultations de la notice


Téléchargements de fichiers