International Conference on Machine Learning, ICML 2016


Article Details
Title: Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm
Article URLs:
Alternative Article URLs:
Authors: Junpei Komiyama
  • The University of Tokyo, Japan
Junya Honda
  • The University of Tokyo, Japan
Hiroshi Nakagawa
  • The University of Tokyo, Japan
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/icml/KomiyamaHN16
Author Comments:

Discuss this paper and its artifacts below