Copeland dueling bandits

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 Copeland winner, which, unlike the Condorcet winner, is guaranteed to exist. The first, Copeland Confidence Bound (CCB)...

全面介紹

書目詳細資料
Main Authors: Zoghi, M, Karnin, Z, Whiteson, S, Rijke, M
格式: Conference item
出版: 2015

相似書籍