{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T02:32:38Z","timestamp":1783737158416,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T00:00:00Z","timestamp":1657065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Natural Science and Engineering Research Council of Canada","award":["RGPIN-2015-04978"],"award-info":[{"award-number":["RGPIN-2015-04978"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,6]]},"DOI":"10.1145\/3477495.3531991","type":"proceedings-article","created":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T15:12:13Z","timestamp":1657206733000},"page":"567-577","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Human Preferences as Dueling Bandits"],"prefix":"10.1145","author":[{"given":"Xinyi","family":"Yan","sequence":"first","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chengxi","family":"Luo","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charles L. A.","family":"Clarke","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nick","family":"Craswell","sequence":"additional","affiliation":[{"name":"Microsoft, Bellevue, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ellen M.","family":"Voorhees","sequence":"additional","affiliation":[{"name":"National Institute of Standards and Technology, Gaithersburg, MD, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pablo","family":"Castells","sequence":"additional","affiliation":[{"name":"Universidad Aut\u00f3noma de Madrid, Madrid, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,7,7]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"41st International ACM SIGIR Conference on Research and Development in Information Retrieval. 1317--1320","author":"Abualsaud Mustafa","unstructured":"Mustafa Abualsaud , Nimesh Ghelani , Haotian Zhang , Mark D. Smucker , Gordon V. Cormack , and Maura R. Grossman . 2018. A system for efficient high-recall retrieval . In 41st International ACM SIGIR Conference on Research and Development in Information Retrieval. 1317--1320 . Mustafa Abualsaud, Nimesh Ghelani, Haotian Zhang, Mark D. Smucker, Gordon V. Cormack, and Maura R.Grossman. 2018. A system for efficient high-recall retrieval. In 41st International ACM SIGIR Conference on Research and Development in Information Retrieval. 1317--1320."},{"key":"e_1_3_2_2_2_1","volume-title":"Clarke","author":"Arabzadeh Negar","year":"2021","unstructured":"Negar Arabzadeh , Alexandra Vtyurina , Xinyi Yan , and Charles L. A . Clarke . 2021 . Shallow pooling for sparse labels. CoRR abs\/2109.00062 (2021). Negar Arabzadeh, Alexandra Vtyurina, Xinyi Yan, and Charles L. A. Clarke. 2021. Shallow pooling for sparse labels. CoRR abs\/2109.00062 (2021)."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767820"},{"key":"e_1_3_2_2_4_1","first-page":"1","article-title":"Preference-based online learning with dueling bandits: A survey","volume":"21","author":"Bengs Viktor","year":"2021","unstructured":"Viktor Bengs , R\u00f3bert Busa-Fekete , Adil El Mesaoudi-Paul , and Eyke H\u00fcllermeier . 2021 . Preference-based online learning with dueling bandits: A survey . Journal of Machine Learning Research 21 (2021), 1 -- 108 . Viktor Bengs, R\u00f3bert Busa-Fekete, Adil El Mesaoudi-Paul, and Eyke H\u00fcllermeier. 2021. Preference-based online learning with dueling bandits: A survey. Journal of Machine Learning Research 21 (2021), 1--108.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_5_1","volume-title":"27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. 25--32","author":"Buckley Chris","unstructured":"Chris Buckley and Ellen M. Voorhees . 2004. Retrieval evaluation with incomplete information . In 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. 25--32 . Chris Buckley and Ellen M. Voorhees. 2004. Retrieval evaluation with incomplete information. In 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. 25--32."},{"key":"e_1_3_2_2_6_1","volume-title":"31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval","author":"Carterette Ben","unstructured":"Ben Carterette and Paul N. Bennett . 2008. Evaluation measures for preference judgments . In 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval . Singapore, 685--686. Ben Carterette and Paul N. Bennett. 2008. Evaluation measures for preference judgments. In 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. Singapore, 685--686."},{"key":"e_1_3_2_2_7_1","volume-title":"David Maxwell Chickering, and Susan T. Dumais","author":"Carterette Ben","year":"2008","unstructured":"Ben Carterette , Paul N. Bennett , David Maxwell Chickering, and Susan T. Dumais . 2008 . Here or there: Preference Judgments for Relevance. Computer Science Department Faculty Publication Series 46. University of Massachusetts Amherst . Ben Carterette, Paul N. Bennett, David Maxwell Chickering, and Susan T. Dumais. 2008. Here or there: Preference Judgments for Relevance. Computer Science Department Faculty Publication Series 46. University of Massachusetts Amherst."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462947"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3451161"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462804"},{"key":"e_1_3_2_2_11_1","volume-title":"Overview of the TREC 2021 Deep Learning Track. In 30th Text REtrieval Conference","author":"Craswell Nick","year":"2021","unstructured":"Nick Craswell , Bhaskar Mitra , Emine Yilmaz , Daniel Campos , and Jimmy Lin . 2021 . Overview of the TREC 2021 Deep Learning Track. In 30th Text REtrieval Conference . Gaithersburg, Maryland. Nick Craswell, Bhaskar Mitra, Emine Yilmaz, Daniel Campos, and Jimmy Lin. 2021. Overview of the TREC 2021 Deep Learning Track. In 30th Text REtrieval Conference. Gaithersburg, Maryland."},{"key":"e_1_3_2_2_12_1","volume-title":"31st International Conference on Neural Information Processing Systems. 7063--7073","author":"Falahatgar Moein","year":"2017","unstructured":"Moein Falahatgar , Yi Hao , Alon Orlitsky , Venkatadheeraj Pichapati , and Vaishakh Ravindrakumar . 2017 . Maxing and ranking with few assumptions . In 31st International Conference on Neural Information Processing Systems. 7063--7073 . Moein Falahatgar, Yi Hao, Alon Orlitsky, Venkatadheeraj Pichapati, and Vaishakh Ravindrakumar. 2017. Maxing and ranking with few assumptions. In 31st International Conference on Neural Information Processing Systems. 7063--7073."},{"key":"e_1_3_2_2_13_1","volume-title":"International Conference on Machine Learning. 1088--1096","author":"Falahatgar Moein","year":"2017","unstructured":"Moein Falahatgar , Alon Orlitsky , Venkatadheeraj Pichapati , and Ananda Theertha Suresh . 2017 . Maximum selection and ranking under noisy comparisons . In International Conference on Machine Learning. 1088--1096 . Moein Falahatgar, Alon Orlitsky, Venkatadheeraj Pichapati, and Ananda Theertha Suresh. 2017. Maximum selection and ranking under noisy comparisons. In International Conference on Machine Learning. 1088--1096."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3116857"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(91)90046-O"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000067"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56608-5_58"},{"key":"e_1_3_2_2_18_1","volume-title":"18th ACM Conference on Information and Knowledge Management","author":"Kanoulas Evangelos","unstructured":"Evangelos Kanoulas and Javed A. Aslam . 2009. Empirical justification of the gain and discount function for NDCG . In 18th ACM Conference on Information and Knowledge Management . Hong Kong, China, 611--620. Evangelos Kanoulas and Javed A. Aslam. 2009. Empirical justification of the gain and discount function for NDCG. In 18th ACM Conference on Information and Knowledge Management. Hong Kong, China, 611--620."},{"key":"e_1_3_2_2_19_1","volume-title":"30th International Conference on Machine Learning","volume":"28","author":"Karnin Zohar","year":"2013","unstructured":"Zohar Karnin , Tomer Koren , and Oren Somekh . 2013 . Almost optimal exploration in multi-armed bandits . In 30th International Conference on Machine Learning , Vol. 28 . 1238--1246. Zohar Karnin, Tomer Koren, and Oren Somekh. 2013. Almost optimal exploration in multi-armed bandits. In 30th International Conference on Machine Learning, Vol. 28. 1238--1246."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3411753"},{"key":"e_1_3_2_2_21_1","first-page":"740","article-title":"Efficient mechanisms for peer grading and dueling bandits","volume":"95","author":"Lin Chuang-Chieh","year":"2018","unstructured":"Chuang-Chieh Lin and Chi-Jen Lu . 2018 . Efficient mechanisms for peer grading and dueling bandits . Proceedings of Machine Learning Research 95 (2018), 740 -- 755 . Chuang-Chieh Lin and Chi-Jen Lu. 2018. Efficient mechanisms for peer grading and dueling bandits. Proceedings of Machine Learning Research 95 (2018), 740--755.","journal-title":"Proceedings of Machine Learning Research"},{"key":"e_1_3_2_2_22_1","volume-title":"30th Text REtrieval Conference","author":"Lin Jimmy","year":"2021","unstructured":"Jimmy Lin , Haonen Chen , Chengcheng Hu , Sheng-Chieh Lin , Yilin Li , Xueguang Ma , Ronak Pradeep , Jheng-Hong Yang , Chuan-Ju Wang , Andrew Yates , and Xinyu Zhang . 2021 . New nails for old hammers: Anserini and Pyserini at TREC 2021 . In 30th Text REtrieval Conference . Gaithersburg, Maryland. Jimmy Lin, Haonen Chen, Chengcheng Hu, Sheng-Chieh Lin, Yilin Li, Xueguang Ma, Ronak Pradeep, Jheng-Hong Yang, Chuan-Ju Wang, Andrew Yates, and Xinyu Zhang. 2021. New nails for old hammers: Anserini and Pyserini at TREC 2021. In 30th Text REtrieval Conference. Gaithersburg, Maryland."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851613.2851692"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3002172"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000025"},{"key":"e_1_3_2_2_26_1","volume-title":"International Conference on Machine Learning. 8051--8072","author":"Ren Wenbo","year":"2020","unstructured":"Wenbo Ren , Jia Liu , and Ness Shroff . 2020 . The sample complexity of best-?? items selection from pairwise comparisons . In International Conference on Machine Learning. 8051--8072 . Wenbo Ren, Jia Liu, and Ness Shroff. 2020. The sample complexity of best-?? items selection from pairwise comparisons. In International Conference on Machine Learning. 8051--8072."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3511960"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210052"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2021.102688"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-4571(199012)41:8<590::AID-ASI5>3.0.CO;2-T"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-008-9059-7"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401115"},{"key":"e_1_3_2_2_33_1","volume-title":"Overview of TREC 2021. In 30th Text REtrieval Conference","author":"Soboroff Ian","year":"2021","unstructured":"Ian Soboroff . 2021 . Overview of TREC 2021. In 30th Text REtrieval Conference . Gaithersburg, Maryland. Ian Soboroff. 2021. Overview of TREC 2021. In 30th Text REtrieval Conference. Gaithersburg, Maryland."},{"key":"e_1_3_2_2_34_1","volume-title":"30th Conference on Neural Information Processing Systems","volume":"29","author":"Wu Huasen","year":"2016","unstructured":"Huasen Wu and Xin Liu . 2016 . Double Thompson sampling for dueling bandits . In 30th Conference on Neural Information Processing Systems , Vol. 29 . Huasen Wu and Xin Liu. 2016. Double Thompson sampling for dueling bandits. In 30th Conference on Neural Information Processing Systems, Vol. 29."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401146"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3291992.3291995"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/208098.208105"},{"key":"e_1_3_2_2_38_1","first-page":"5","article-title":"The ??-armed dueling bandits problem","volume":"75","author":"Yue Yisong","year":"2012","unstructured":"Yisong Yue , Josef Broder , Robert Kleinberg , and Thorsten Joachims . 2012 . The ??-armed dueling bandits problem . Journal of Computer and System Sciences 75 , 5 (September 2012), 1538--1556. Yisong Yue, Josef Broder, Robert Kleinberg, and Thorsten Joachims. 2012. The ??-armed dueling bandits problem. Journal of Computer and System Sciences 75, 5 (September 2012), 1538--1556.","journal-title":"Journal of Computer and System Sciences"},{"key":"e_1_3_2_2_39_1","volume-title":"28th International Conference on Machine Learning.","author":"Yue Yisong","year":"2011","unstructured":"Yisong Yue and Thorsten Joachims . 2011 . Beat the mean bandit . In 28th International Conference on Machine Learning. Yisong Yue and Thorsten Joachims. 2011. Beat the mean bandit. In 28th International Conference on Machine Learning."},{"key":"e_1_3_2_2_40_1","volume-title":"Copeland dueling bandits. Advances in Neural Information Processing Systems 28","author":"Zoghi Masrour","year":"2015","unstructured":"Masrour Zoghi , Zohar Karnin , Shimon Whiteson , and Maarten De Rijke . 2015. Copeland dueling bandits. Advances in Neural Information Processing Systems 28 ( 2015 ). Masrour Zoghi, Zohar Karnin, Shimon Whiteson, and Maarten De Rijke. 2015. Copeland dueling bandits. Advances in Neural Information Processing Systems 28 (2015)."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684822.2685290"},{"key":"e_1_3_2_2_42_1","volume-title":"31st International Conference on Machine Learning","volume":"32","author":"Zoghi Masrour","year":"2014","unstructured":"Masrour Zoghi , Shimon Whiteson , Remi Munos , and Maarten Rijke . 2014 . Relative upper confidence bound for the K-armed dueling bandit problem . In 31st International Conference on Machine Learning , Vol. 32 . 10--18. Masrour Zoghi, Shimon Whiteson, Remi Munos, and Maarten Rijke. 2014. Relative upper confidence bound for the K-armed dueling bandit problem. In 31st International Conference on Machine Learning, Vol. 32. 10--18."}],"event":{"name":"SIGIR '22: The 45th International ACM SIGIR Conference on Research and Development in Information Retrieval","location":"Madrid Spain","acronym":"SIGIR '22","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477495.3531991","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3477495.3531991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:20Z","timestamp":1750183820000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477495.3531991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,6]]},"references-count":42,"alternative-id":["10.1145\/3477495.3531991","10.1145\/3477495"],"URL":"https:\/\/doi.org\/10.1145\/3477495.3531991","relation":{},"subject":[],"published":{"date-parts":[[2022,7,6]]},"assertion":[{"value":"2022-07-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}