Stochastic bandits with arm-dependent delays - Archive ouverte HAL Access content directly
Conference Papers Year :

Stochastic bandits with arm-dependent delays

(1) , (2) , (1) , (2)
1
2

Abstract

Significant work has been recently dedicated to the stochastic delayed bandits because of its relevance in applications. The applicability of existing algorithms is however restricted by the fact that strong assumptions are often made on the delay distributions, such as full observability, restrictive shape constraints, or uniformity over arms. In this work, we weaken them significantly and only assume that there is a bound on the tail of the delay. In particular, we cover the important case where the delay distributions vary across arms, and the case where the delays are heavy-tailed. Addressing these difficulties, we propose a simple but efficient UCB-based algorithm called the PatientBandits. We provide both problems-dependent and problems-independent bounds on the regret as well as performance lower bounds.
Fichier principal
Vignette du fichier
manegueu2020stochastic.pdf (1.93 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02950116 , version 1 (27-09-2020)

Identifiers

  • HAL Id : hal-02950116 , version 1

Cite

Anne Gael Manegueu, Claire Vernade, Alexandra Carpentier, Michal Valko. Stochastic bandits with arm-dependent delays. International Conference on Machine Learning, 2020, Vienna, Austria. ⟨hal-02950116⟩
13 View
57 Download

Share

Gmail Facebook Twitter LinkedIn More