The Influence of Shape Constraints on the Thresholding Bandit Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2020

The Influence of Shape Constraints on the Thresholding Bandit Problem


We investigate the stochastic Thresholding Bandit problem (TBP) under several shape constraints. On top of (i) the vanilla, unstructured TBP, we consider the case where (ii) the sequence of arm's means (µ k) k is monotonically increasing MTBP, (iii) the case where (µ k) k is unimodal UTBP and (iv) the case where (µ k) k is concave CTBP. In the TBP problem the aim is to output, at the end of the sequential game, the set of arms whose means are above a given threshold. The regret is the highest gap between a misclassified arm and the threshold. In the fixed budget setting, we provide problem independent minimax rates for the expected regret in all settings, as well as associated algorithms. We prove that the minimax rates for the regret are (i) log(K)K/T for TBP, (ii) log(K)/T for MTBP, (iii) K/T for UTBP and (iv) log log K/T for CTBP, where K is the number of arms and T is the budget. These rates demonstrate that the dependence on K of the minimax regret varies significantly depending on the shape constraint. This highlights the fact that the shape constraints modify fundamentally the nature of the TBP problem to the other.
Fichier principal
Vignette du fichier
COLT2020.pdf (544.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03001947 , version 1 (12-11-2020)
hal-03001947 , version 2 (22-02-2021)


  • HAL Id : hal-03001947 , version 2


James Cheshire, Pierre Ménard, Alexandra Carpentier. The Influence of Shape Constraints on the Thresholding Bandit Problem. COLT 2020 - Thirty Third Conference on Learning Theory, Jul 2020, Graz / Virtual, Austria. pp.1228-1275. ⟨hal-03001947v2⟩
82 View
67 Download


Gmail Facebook X LinkedIn More