Best-Arm Identification in Linear Bandits - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Best-Arm Identification in Linear Bandits

Abstract

We study the best-arm identification problem in linear bandit, where the rewards of the arms depend linearly on an unknown parameter $\theta^*$ and the objective is to return the arm with the largest reward. We characterize the complexity of the problem and introduce sample allocation strategies that pull arms to identify the best arm with a fixed confidence, while minimizing the sample budget. In particular, we show the importance of exploiting the global linear structure to improve the estimate of the reward of near-optimal arms. We analyze the proposed strategies and compare their empirical performance. Finally, we point out the connection to the $G$-optimality criterion used in optimal experimental design.
Fichier principal
Vignette du fichier
best_linear_arm.pdf (269.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01075701 , version 1 (04-11-2014)

Identifiers

  • HAL Id : hal-01075701 , version 1

Cite

Marta Soare, Alessandro Lazaric, Rémi Munos. Best-Arm Identification in Linear Bandits. NIPS - Advances in Neural Information Processing Systems 27, Dec 2014, Montreal, Canada. ⟨hal-01075701⟩
287 View
273 Download

Share

Gmail Facebook X LinkedIn More