Skip to content

Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm.

Junpei Komiyama, Junya Honda, Hiroshi Nakagawa

VenueA*ICML
Year2016
ProceedingsICML

Browse the full ICML paper archive.