UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Multi-dueling bandits and their application to online ranker evaluation

Brost, B; Seldin, Y; Cox, IJ; Lioma, C; (2016) Multi-dueling bandits and their application to online ranker evaluation. In: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management. (pp. pp. 2161-2166). ACM publishing Green open access

[img]
Preview
Text
Cox_CIKM2016.pdf - ["content_typename_Accepted version" not defined]

Download (421kB) | Preview

Abstract

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. It can be modeled by dueling bandits, 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. Methods for simultaneously comparing more than two rankers have recently 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 standard large-scale online ranker evaluation datasets. Our experimentals show that the algorithm yields orders of magnitude gains in performance compared to state-of-the-art dueling bandit algorithms.

Type: Proceedings paper
Title: Multi-dueling bandits and their application to online ranker evaluation
Event: the 25th ACM International on Conference on Information and Knowledge Management
ISBN-13: 9781450340731
Open access status: An open access version is available from UCL Discovery
DOI: 10.1145/2983323.2983659
Publisher version: http://dx.doi.org/10.1145/2983323.2983659
Language: English
Additional information: This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions.
UCL classification: UCL > Provost and Vice Provost Offices
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: http://discovery.ucl.ac.uk/id/eprint/1531445
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item