6 citations · 9 across the 5 of their papers we have counts for
Showing stat.MLShow 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…
stat.ML2021★ 6 cited
Decentralized Learning in Online Queuing Systems
Flore Sentenac, Etienne Boursier, Vianney Perchet
Motivated by packet routing in computer networks, online queuing systems are composed of queues receiving packets at different rates. Repeatedly, they send packets to servers, each…