137 citations · 208 across the 22 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
stat.ML2021★ 1 cited
Pure Exploration and Regret Minimization in Matching Bandits
Flore Sentenac, Jialin Yi, Clément Calauzènes +2
Finding an optimal matching in a weighted graph is a standard combinatorial problem. We consider its semi-bandit version where either a pair or a full matching is sampled sequentia…
cs.LG2021★ 2 cited
Regret Bounds for Generalized Linear Bandits under Parameter Drift
Louis Faury, Yoan Russac, Marc Abeille +1
Generalized Linear Bandits (GLBs) are powerful extensions to the Linear Bandit (LB) setting, broadening the benefits of reward parametrization beyond linearity. In this paper we st…