Maarten de Rijke

Information retrieval

Month: June 2015

WSDM 2017 will be held in Cambridge, UK

Milad Shokouhi (Microsoft Research Cambridge) and I put in a bid to host WSDM 2017 in Cambridge, UK. It is official now: WSDM 2017 will be held in Cambridge, UK, in February 2017. Details on deadlines and committees will follow in due course.

“Copeland Dueling Bandits” on arXiv

We have filed a preprint on Copeland dueling bandits on ArXiv:

  • Masrour Zoghi, Zohar Karnin, Shimon Whiteson, and Maarten de Rijke. Copeland Dueling Bandits. arXiv preprint arXiv:1506.00312, June 2015. Bibtex, PDF, URL
    @misc{zoghi-copeland-arxiv-2015,
    Author = {Zoghi, Masrour and Karnin, Zohar and Whiteson, Shimon and de Rijke, Maarten},
    Date-Added = {2015-06-02 05:06:52 +0000},
    Date-Modified = {2015-06-02 05:09:28 +0000},
    Howpublished = {arXiv preprint arXiv:1506.00312},
    Month = {June},
    Title = {Copeland Dueling Bandits},
    Url = {http://arxiv.org/abs/1506.00312},
    Year = {2015},
    Bdsk-Url-1 = {http://arxiv.org/abs/1506.00312}}

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), is designed for small numbers of arms, while the second, Scalable Copeland Bandits (SCB), works better for large-scale problems. We provide theoretical results bounding the regret accumulated by CCB and SCB, both substantially improving existing results. Such existing results either offer bounds of the form O(K log T) but require restrictive assumptions, or offer bounds of the form O(K^2 log T) without requiring such assumptions. Our results offer the best of both worlds: O(K log T) bounds without restrictive assumptions.

© 2017 Maarten de Rijke

Theme by Anders NorenUp ↑