Human Preferences as Dueling Bandits
Xinyi Yan, Chengxi Luo, Charles L. A. Clarke, Nick Craswell, Ellen M. Voorhees, Pablo Castells
Abstract
The dramatic improvements in core information retrieval tasks engendered by neural rankers create a need for novel evaluation methods. If every ranker returns highly relevant items in the top ranks, it becomes difficult to recognize meaningful differences between them and to build reusable test collections. Several recent papers explore pairwise preference judgments as an alternative to traditional graded relevance assessments. Rather than viewing items one at a time, assessors view items side-by-side and indicate the one that provides the better response to a query, allowing fine-grained distinctions. If we employ preference judgments to identify the probably best items for each query, we can measure rankers by their ability to place these items as high as possible. We frame the problem of finding best items as a dueling bandits problem. While many papers explore dueling bandits for online ranker evaluation via interleaving, they have not been considered as a framework for offline evaluation via human preference judgments. We review the literature for possible solutions. For human preference judgments, any usable algorithm must tolerate ties, since two items may appear nearly equal to assessors, and it must minimize the number of judgments required for any specific pair, since each such comparison requires an independent assessor. Since the theoretical guarantees provided by most algorithms depend on assumptions that are not satisfied by human preference judgments, we simulate selected algorithms on representative test cases to provide insight into their practical utility. Based on these simulations, one algorithm stands out for its potential. Our simulations suggest modifications to further improve its performance. Using the modified algorithm, we collect over 10,000 preference judgments for pools derived from submissions to the TREC 2021 Deep Learning Track, confirming its suitability. We test the idea of best-item evaluation and suggest ideas for further theoretical and practical progress.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers5
- Direct Preference Optimization: Your Language Model is Secretly a Reward ModelRafael Rafailov, Archit Sharma, Eric Mitchell, Christopher D. Manning et al.NeurIPS 2023 · 10,924 citations
- Active preference learning for ordering items in- and out-of-sampleHerman Bergström, Emil Carlsson, Devdatt P. Dubhashi, Fredrik D. JohanssonNeurIPS 2024 · 9 citations
- Direct Preference-Based Evolutionary Multi-Objective Optimization with Dueling BanditsTian Huang, Shengbo Wang, Ke LiNeurIPS 2024 · 7 citations
- On Weak Regret Analysis for Dueling BanditsEl Mehdi Saad, Alexandra Carpentier, Tomás Kocák, Nicolas VerzelenNeurIPS 2024 · 5 citations
- Preference Learning with Response Time: Robust Losses and GuaranteesAyush Sawarni, Sahasrajit Sarmasarkar, Vasilis SyrgkanisNeurIPS 2025
Builds on4
- Good Evaluation Measures based on Document PreferencesTetsuya Sakai, Zhaohao ZengSIGIR 2020 · 14 citations
- Preference-based Evaluation Metrics for Web Image SearchXiaohui Xie, Jiaxin Mao, Yiqun Liu, Maarten de Rijke et al.SIGIR 2020 · 12 citations
- Preferences on a Budget: Prioritizing Document Pairs when Crowdsourcing Relevance JudgmentsKevin Roitero, Alessandro Checco, Stefano Mizzaro, Gianluca DemartiniWWW 2022 · 7 citations
- Evaluation Measures Based on Preference GraphsCharles L. A. Clarke, Chengxi Luo, Mark D. SmuckerSIGIR 2021 · 5 citations
Related papers
- Active Evaluation: Efficient NLG Evaluation with Few Pairwise ComparisonsAkash Kumar Mohankumar, Mitesh M. KhapraACL 2022 · 8 citations
- An Asymptotically Optimal Batched Algorithm for the Dueling Bandit ProblemArpit Agarwal, Rohan Ghuge, Viswanath NagarajanNeurIPS 2022 · 2 citations
- Preference Is More than Comparisons: Rethinking Dueling Bandits with Augmented Human FeedbackShengbo Wang, Hong Sun, Ke LiAAAI 2026
- Variance-aware Regret Bounds for Stochastic Contextual Dueling BanditsQiwei Di, Tao Jin, Yue Wu, Heyang Zhao et al.ICLR 2024 · 21 citations
- Versatile Dueling Bandits: Best-of-both World Analyses for Learning from Relative PreferencesAadirupa Saha, Pierre GaillardICML 2022 · 30 citations
