Achieving Nearly-Optimal Regret and Sample Complexity in Dueling Bandits with Applications in Online Recommendations.

Lanjihong Ma, Yao-Xiang Ding, Zhen-Yu Zhang, Zhi-Hua Zhou

Browse the full KDD paper archive.