Parametric Graph for Unimodal Ranking Bandit - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

Parametric Graph for Unimodal Ranking Bandit


We tackle the online ranking problem of assigning L items to K positions on a web page in order to maximize the number of user clicks. We propose an original algorithm, easy to implement and with strong theoretical guarantees to tackle this problem in the Position-Based Model (PBM) setting, well suited for applications where items are displayed on a grid. Besides learning to rank, our algorithm, GRAB (for parametric Graph for unimodal RAnking Bandit), also learns the parameter of a compact graph over permutations of K items among L. The logarithmic regret bound of this algorithm is a direct consequence of the unimodality property of the bandit setting with respect to the learned graph. Experiments against state-ofthe-art learning algorithms which also tackle the PBM setting, show that our method is more efficient while giving regret performance on par with the best known algorithms on simulated and real life datasets.
Fichier principal
Vignette du fichier
ICML2021.pdf (3.52 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03256621 , version 1 (11-06-2021)
hal-03256621 , version 2 (23-06-2021)


  • HAL Id : hal-03256621 , version 2


Camille-Sovanneary Gauthier, Romaric Gaudel, Elisa Fromont, Boammani Aser Lompo. Parametric Graph for Unimodal Ranking Bandit. ICML 2021 - International Conference on Machine Learning, Jul 2021, Virtual, Canada. pp.3630--3639. ⟨hal-03256621v2⟩
257 View
140 Download


Gmail Mastodon Facebook X LinkedIn More