23 citations · 49 across the 6 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.LG2015★ 10 cited
Copeland Dueling Bandits
Masrour Zoghi, Zohar Karnin, Shimon Whiteson +1
A version of the dueling bandit problem is addressed in which a Condorcet winner may not exist. Two algorithms are proposed that instead seek to minimize regret with respect to the…
cs.LG2015★ 23 cited
Contextual Dueling Bandits
Miroslav Dudík, Katja Hofmann, Robert E. Schapire +2
We consider the problem of learning to choose actions using contextual information when provided with limited feedback in the form of relative pairwise comparisons. We study this p…