most citedEfficient and Scalable Batch Bayesian Optimization Using K-Means

16 citations · 17 across the 3 of their papers we have counts for

collaborators
Showing cs.LGShow all

1 paper · 1 filter

cs.LG2020

Exploiting Transitivity for Top-k Selection with Score-Based Dueling Bandits

Matthew Groves, Juergen Branke

We consider the problem of top-k subset selection in Dueling Bandit problems with score information. Real-world pairwise ranking problems often exhibit a high degree of transitivit…