Unirank: Unimodal bandit algorithms for online ranking
CS Gauthier, R Gaudel… - … Conference on Machine …, 2022 - proceedings.mlr.press
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 …
items to K predefined positions on a web page in order to maximize the number of user …
Unimodal Mono-Partite Matching in a Bandit Setting
R Gaudel, M Rodet - arXiv preprint arXiv:2208.01511, 2022 - arxiv.org
We tackle a new emerging problem, which is finding an optimal monopartite matching in a
weighted graph. The semi-bandit version, where a full matching is sampled at each iteration …
weighted graph. The semi-bandit version, where a full matching is sampled at each iteration …
Unimodal Mono-Partite Matching in a Bandit Setting
M Rodet, R Gaudel - … Feedback in Online Learning Workshop at …, 2022 - inria.hal.science
We tackle a new emerging problem, which is finding an optimal monopartite matching in a
weighted graph. The semi-bandit version, where a full matching is sampled at each iteration …
weighted graph. The semi-bandit version, where a full matching is sampled at each iteration …
List recommendations with multi-armed bandits
CS Gauthier - 2022 - theses.hal.science
We tackle the online learning to rank problem of assigning L items to K predefined positions
on a web page in order to maximize the number of user clicks. To address this problem, one …
on a web page in order to maximize the number of user clicks. To address this problem, one …