arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.06253cs.IRcs.LGstat.ML
收藏

多个竞争Bandits及其在在线排名中的应用

Multi-Dueling Bandits and Their Application to Online Ranker Evaluation

University of Copenhagen(哥本哈根大学);University College London(伦敦大学学院)

Brian Brost, Yevgeny Seldin, Ingemar J. Cox, Christina Lioma

摘要:

新的排名算法正在不断开发和完善,需要开发有效的方法来评估这些排名。在线排名评估的重点是有效地确定的挑战,从隐式用户反馈,排名的有限集合的排名是最好的。在线排名评估可以通过决斗禁令来建模,决斗禁令是一种用于在成对比较的有限反馈下的在线学习的数学模型。排名对的比较是通过交错结果集和检查用户点击的文档来执行的。决斗强盗模型解决了在每次迭代中比较哪对排名的关键问题,从而为探索-利用权衡提供了解决方案。最近,已经开发了用于同时比较两个以上的排序器的方法。然而,在每次迭代中比较哪些排名的问题是开放的。我们解决这个问题,提出了一个推广的决斗土匪模型,使用同时比较的一个不受限制的排名。我们评估我们的算法上的合成数据和几个标准的大规模在线排名评估数据集。我们的实验结果表明,该算法产生的数量级的改善性能相比,国家的最先进的决斗强盗算法。

英文摘要:

New ranking algorithms are continually being developed and refined, necessitating the development of efficient methods for evaluating these rankers. Online ranker evaluation focuses on the challenge of efficiently determining, from implicit user feedback, which ranker out of a finite set of rankers is the best. Online ranker evaluation can be modeled by dueling ban- dits, a mathematical model for online learning under limited feedback from pairwise comparisons. Comparisons of pairs of rankers is performed by interleaving their result sets and examining which documents users click on. The dueling bandits model addresses the key issue of which pair of rankers to compare at each iteration, thereby providing a solution to the exploration-exploitation trade-off. Recently, methods for simultaneously comparing more than two rankers have been developed. However, the question of which rankers to compare at each iteration was left open. We address this question by proposing a generalization of the dueling bandits model that uses simultaneous comparisons of an unrestricted number of rankers. We evaluate our algorithm on synthetic data and several standard large-scale online ranker evaluation datasets. Our experimental results show that the algorithm yields orders of magnitude improvement in performance compared to stateof- the-art dueling bandit algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑