1 citations · 1 across the 1 of their papers we have counts for
3 papers
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…
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…
KONG: Kernels for ordered-neighborhood graphs
Moez Draief, Konstantin Kutzkov, Kevin Scaman +1
We present novel graph kernels for graphs with node and edge labels that have ordered neighborhoods, i.e. when neighbor nodes follow an order. Graphs with ordered neighborhoods are…