1 citations · 1 across the 1 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.ML2019
Accelerated MM Algorithms for Ranking Scores Inference from Comparison Data
Milan Vojnovic, Seyoung Yun, Kaifang Zhou
In this paper, we study a popular method for inference of the Bradley-Terry model parameters, namely the MM algorithm, for maximum likelihood estimation and maximum a posteriori pr…