Multiple-Play Bandits in the Position-Based Model - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Multiple-Play Bandits in the Position-Based Model

Résumé

Sequentially learning to place items in multi-position displays or lists is a task that can be cast into the multiple-play semi-bandit setting. However, a major concern in this context is when the system cannot decide whether the user feedback for each item is actually exploitable. Indeed, much of the content may have been simply ignored by the user. The present work proposes to exploit available information regarding the display position bias under the so-called Position-based click model (PBM). We first discuss how this model differs from the Cascade model and its variants considered in several recent works on multiple-play bandits. We then provide a novel regret lower bound for this model as well as computationally efficient algorithms that display good empirical and theoretical performance.
Fichier principal
Vignette du fichier
nips_hal.pdf (786.71 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01328003 , version 1 (07-06-2016)

Identifiants

Citer

Paul Lagrée, Claire Vernade, Olivier Cappé. Multiple-Play Bandits in the Position-Based Model. Neural Information Processing Systems (NIPS), Jan 2016, Barcelone, Spain. ⟨hal-01328003⟩
536 Consultations
155 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More