137 citations · 172 across the 12 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.ML2018★ 137 cited
Offline A/B testing for Recommender Systems
Alexandre Gilotte, Clément Calauzènes, Thomas Nedelec +2
Before A/B testing online a new version of a recommender system, it is usual to perform some offline evaluations on historical data. We focus on evaluation methods that compute an…