UniRank: Unimodal Bandit Algorithm for Online Ranking - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2022

UniRank: Unimodal Bandit Algorithm for Online Ranking

Résumé

We tackle, in the multiple-play bandit setting, the online ranking problem of assigning $L$ items to $K$ predefined positions on a web page in order to maximize the number of user clicks. We propose a generic algorithm, UniRank, that tackles state-of-the-art click models. The regret bound of this algorithm is a direct consequence of the unimodality-like property of the bandit setting with respect to a graph where nodes are ordered sets of indistinguishable items. The main contribution of UniRank is its $O\left(L/\Delta \log T\right)$ regret for $T$ consecutive assignments, where $\Delta$ relates to the reward-gap between two items. This regret bound is based on the usually implicit condition that two items may not have the same attractiveness. Experiments against state-of-the-art learning algorithms specialized or not for different click models, show that our method has better regret performance than other generic algorithms on real life and synthetic datasets.
Fichier principal
Vignette du fichier
main.pdf (1.51 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03740981 , version 1 (02-08-2022)

Identifiants

Citer

Camille-Sovanneary Gauthier, Romaric Gaudel, Elisa Fromont. UniRank: Unimodal Bandit Algorithm for Online Ranking. ICML 2022 - 39th International Conference on Machine Learning, Jul 2022, Baltimore, United States. pp.1-31. ⟨hal-03740981⟩
140 Consultations
52 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More