{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:09:19Z","timestamp":1775912959737,"version":"3.50.1"},"reference-count":57,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T00:00:00Z","timestamp":1675728000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Google Research Scholar Program"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2023,7,31]]},"abstract":"<jats:p>Clicks on rankings suffer from position bias: generally items on lower ranks are less likely to be examined\u2014and thus clicked\u2014by users, in spite of their actual preferences between items. The prevalent approach to unbiased click-based learning-to-rank (LTR) is based on counterfactual inverse-propensity-scoring (IPS) estimation. In contrast with general reinforcement learning, counterfactual doubly robust (DR) estimation has not been applied to click-based LTR in previous literature.<\/jats:p>\n          <jats:p>In this article, we introduce a novel DR estimator that is the first DR approach specifically designed for position bias. The difficulty with position bias is that the treatment\u2014user examination\u2014is not directly observable in click data. As a solution, our estimator uses the expected treatment per rank, instead of the actual treatment that existing DR estimators use. Our novel DR estimator has more robust unbiasedness conditions than the existing IPS approach, and in addition, provides enormous decreases in variance: our experimental results indicate it requires several orders of magnitude fewer datapoints to converge at optimal performance. For the unbiased LTR field, our DR estimator contributes both increases in state-of-the-art performance and the most robust theoretical guarantees of all known LTR estimators.<\/jats:p>","DOI":"10.1145\/3569453","type":"journal-article","created":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T14:15:44Z","timestamp":1666793744000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Doubly Robust Estimation for Correcting Position Bias in Click Feedback for Unbiased Learning to Rank"],"prefix":"10.1145","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0458-9233","authenticated-orcid":false,"given":"Harrie","family":"Oosterhuis","sequence":"first","affiliation":[{"name":"Radboud University, Toernooiveld, Nijmegen, The Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2023,2,7]]},"reference":[{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331202"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313697"},{"key":"e_1_3_3_4_2","first-page":"474","volume-title":"Proceedings of the 12th ACM International Conference on Web Search and Data Mining","author":"Agarwal Aman","year":"2019","unstructured":"Aman Agarwal, Ivan Zaitsev, Xuanhui Wang, Cheng Li, Marc Najork, and Thorsten Joachims. 2019. Estimating position bias without intrusive interventions. In Proceedings of the 12th ACM International Conference on Web Search and Data Mining. ACM, 474\u2013482."},{"key":"e_1_3_3_5_2","article-title":"Unbiased learning to rank: Online or offline?","author":"Ai Qingyao","year":"2020","unstructured":"Qingyao Ai, Tao Yang, Huazheng Wang, and Jiaxin Mao. 2020. Unbiased learning to rank: Online or offline?arXiv:2004.13574. https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3439861?casa_token=h8Z0flj-T8wAAAAA%3AhRJ6iNT_Ayk3D4Z3-nBnJSS60iMbOUQmOpWDHUN0eK_dnoYUkAionh7A97ITs984ZyuCyiNiG7Y.","journal-title":"arXiv:2004.13574"},{"key":"e_1_3_3_6_2","first-page":"71","volume-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","author":"Bekker Jessa","year":"2019","unstructured":"Jessa Bekker, Pieter Robberechts, and Jesse Davis. 2019. Beyond the selected completely at random assumption for learning from positive and unlabeled data. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Springer, 71\u201385."},{"key":"e_1_3_3_7_2","volume-title":"From RankNet to LambdaRank to LambdaMART: An Overview","author":"Burges Christopher J. C.","year":"2010","unstructured":"Christopher J. C. Burges. 2010. From RankNet to LambdaRank to LambdaMART: An Overview. Technical Report MSR-TR-2010-82. Microsoft."},{"key":"e_1_3_3_8_2","first-page":"1","article-title":"Yahoo! learning to rank challenge overview","volume":"14","author":"Chapelle Olivier","year":"2011","unstructured":"Olivier Chapelle and Yi Chang. 2011. Yahoo! learning to rank challenge overview. Journal of Machine Learning Research 14 (2011), 1\u201324.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"issue":"2","key":"e_1_3_3_10_2","first-page":"Article 15","article-title":"Fast ranking with additive ensembles of oblivious and non-oblivious regression trees","volume":"35","author":"Dato Domenico","year":"2016","unstructured":"Domenico Dato, Claudio Lucchese, Franco Maria Nardini, Salvatore Orlando, Raffaele Perego, Nicola Tonellotto, and Rossano Venturini. 2016. Fast ranking with additive ensembles of oblivious and non-oblivious regression trees. ACM Transactions on Information Systems (TOIS) 35, 2 (2016), Article 15.","journal-title":"ACM Transactions on Information Systems (TOIS)"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1214\/14-STS500"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331238"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/2433396.2433419"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1952.10483446"},{"key":"e_1_3_3_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3385670"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_3_18_2","first-page":"4","volume-title":"ACM SIGIR Forum","author":"Joachims Thorsten","year":"2017","unstructured":"Thorsten Joachims, Laura Granka, Bing Pan, Helene Hembrooke, and Geri Gay. 2017. Accurately interpreting clickthrough data as implicit feedback. In ACM SIGIR Forum, Vol. 51. ACM New York, NY, 4\u201311."},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018699"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1214\/07-STS227"},{"key":"e_1_3_3_21_2","first-page":"487","volume-title":"Proceedings of the 15th ACM International Conference on Web Search and Data Mining","author":"Kiyohara Haruka","year":"2022","unstructured":"Haruka Kiyohara, Yuta Saito, Tatsuya Matsuhiro, Yusuke Narita, Nobuyuki Shimizu, and Yasuo Yamamoto. 2022. Doubly robust off-policy evaluation for ranking policies under the cascade behavior model. In Proceedings of the 15th ACM International Conference on Web Search and Data Mining. 487\u2013497."},{"key":"e_1_3_3_22_2","first-page":"1152","volume-title":"Proceedings of the 32nd International Conference on International Conference on Machine Learning - Volume 37 (ICML\u201915)","author":"Komiyama Junpei","year":"2015","unstructured":"Junpei Komiyama, Junya Honda, and Hiroshi Nakagawa. 2015. Optimal regret analysis of Thompson sampling in stochastic multi-armed bandit problem with multiple plays. In Proceedings of the 32nd International Conference on International Conference on Machine Learning - Volume 37 (ICML\u201915). JMLR.org, 1152\u20131161."},{"key":"e_1_3_3_23_2","first-page":"1597","volume-title":"Advances in Neural Information Processing Systems","author":"Lagr\u00e9e Paul","year":"2016","unstructured":"Paul Lagr\u00e9e, Claire Vernade, and Olivier Capp\u00e9. 2016. Multiple-play bandits in the position-based model. In Advances in Neural Information Processing Systems. 1597\u20131605."},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220028"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462830"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271686"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-15712-8_25"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401102"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441794"},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450018"},{"key":"e_1_3_3_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380255"},{"key":"e_1_3_3_33_2","article-title":"Introducing LETOR 4.0 datasets","author":"Qin Tao","year":"2013","unstructured":"Tao Qin and Tie-Yan Liu. 2013. Introducing LETOR 4.0 datasets. arXiv:1306.2597. https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3439861?casa_token=h8Z0flj-T8wAAAAA%3AhRJ6iNT_Ayk3D4Z3-nBnJSS60iMbOUQmOpWDHUN0eK_dnoYUkAionh7A97ITs984ZyuCyiNiG7Y.","journal-title":"arXiv:1306.2597"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458092"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242643"},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1994.10476818"},{"key":"e_1_3_3_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3383313.3412262"},{"key":"e_1_3_3_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/3460231.3473320"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371783"},{"key":"e_1_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/2835776.2835804"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220088"},{"key":"e_1_3_3_42_2","first-page":"5426","volume-title":"Advances in Neural Information Processing Systems","author":"Singh Ashudeep","year":"2019","unstructured":"Ashudeep Singh and Thorsten Joachims. 2019. Policy learning for fairness in ranking. In Advances in Neural Information Processing Systems. 5426\u20135436."},{"key":"e_1_3_3_43_2","volume-title":"Advances in Neural Information Processing Systems","author":"Strehl Alex","year":"2010","unstructured":"Alex Strehl, John Langford, Lihong Li, and Sham M. Kakade. 2010. Learning from logged implicit exploration data. In Advances in Neural Information Processing Systems, J. Lafferty, C. Williams, J. Shawe-Taylor, R. Zemel, and A. Culotta (Eds.), Vol. 23. Curran Associates, Inc."},{"key":"e_1_3_3_44_2","first-page":"1","article-title":"The probable error of a mean","year":"1908","unstructured":"Student. 1908. The probable error of a mean. Biometrika (1908), 1\u201325.","journal-title":"Biometrika"},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.1998.712192"},{"key":"e_1_3_3_46_2","first-page":"9669","volume-title":"International Conference on Machine Learning","author":"Ustimenko Aleksei","year":"2020","unstructured":"Aleksei Ustimenko and Liudmila Prokhorenkova. 2020. StochasticRank: Global optimization of scale-free discrete functions. In International Conference on Machine Learning. PMLR, 9669\u20139679."},{"key":"e_1_3_3_47_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401299"},{"key":"e_1_3_3_48_2","volume-title":"Proceedings of the 28th ACM International Conference on Information and Knowledge Management","author":"Vardasbi Ali","year":"2020","unstructured":"Ali Vardasbi, Harrie Oosterhuis, and Maarten de Rijke. 2020. When inverse propensity scoring does not work: Affine corrections for unbiased learning to rank. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management."},{"key":"e_1_3_3_49_2","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441798"},{"key":"e_1_3_3_50_2","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911537"},{"key":"e_1_3_3_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159732"},{"key":"e_1_3_3_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271784"},{"key":"e_1_3_3_53_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00992696"},{"key":"e_1_3_3_54_2","doi-asserted-by":"crossref","unstructured":"Le Yan Zhen Qin Honglei Zhuang Xuanhui Wang Mike Bendersky and Marc Najork. 2022. Revisiting two tower models for unbiased learning to rank.","DOI":"10.1145\/3477495.3531837"},{"key":"e_1_3_3_55_2","doi-asserted-by":"publisher","DOI":"10.1145\/3383313.3412241"},{"key":"e_1_3_3_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553527"},{"key":"e_1_3_3_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3450098"},{"key":"e_1_3_3_58_2","first-page":"415","volume-title":"European Conference on Information Retrieval","author":"Zhuang Shengyao","year":"2020","unstructured":"Shengyao Zhuang and Guido Zuccon. 2020. Counterfactual online learning to rank. In European Conference on Information Retrieval. Springer, 415\u2013430."}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3569453","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3569453","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:56Z","timestamp":1750182536000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3569453"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,7]]},"references-count":57,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7,31]]}},"alternative-id":["10.1145\/3569453"],"URL":"https:\/\/doi.org\/10.1145\/3569453","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,7]]},"assertion":[{"value":"2022-05-30","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-10-19","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-02-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}