Diversity-Preserving K-Armed Bandits, Revisited - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2020

Diversity-Preserving K-Armed Bandits, Revisited


We consider the bandit-based framework for diversity-preserving recommendations introduced by Celis et al. (2019), who approached it mainly by a reduction to the setting of linear bandits. We design a UCB algorithm using the specific structure of the setting and show that it enjoys a bounded distribution-dependent regret in the natural cases when the optimal mixed actions put some probability mass on all actions (i.e., when diversity is desirable). Simulations illustrate this fact. We also provide regret lower bounds and briefly discuss distribution-free regret bounds.
Fichier principal
Vignette du fichier
FairBandits-ALT20.pdf (1.4 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02957485 , version 1 (05-10-2020)



Hédi Hadiji, Sébastien Gerchinovitz, Jean-Michel Loubes, Gilles Stoltz. Diversity-Preserving K-Armed Bandits, Revisited. 2020. ⟨hal-02957485⟩
262 View
92 Download



Gmail Facebook X LinkedIn More