{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:14:50Z","timestamp":1775283290769,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T00:00:00Z","timestamp":1603065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the Netherlands Organisation for Scientific Research (NWO)","award":["652.002.001"],"award-info":[{"award-number":["652.002.001"]}]},{"name":"Elsevier","award":["652.002.001"],"award-info":[{"award-number":["652.002.001"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,19]]},"DOI":"10.1145\/3340531.3412031","type":"proceedings-article","created":{"date-parts":[[2020,10,19]],"date-time":"2020-10-19T05:31:04Z","timestamp":1603085464000},"page":"1475-1484","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":45,"title":["When Inverse Propensity Scoring does not Work"],"prefix":"10.1145","author":[{"given":"Ali","family":"Vardasbi","sequence":"first","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}]},{"given":"Harrie","family":"Oosterhuis","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}]},{"given":"Maarten","family":"de Rijke","sequence":"additional","affiliation":[{"name":"University of Amsterdam & Ahold Delhaize, Amsterdam, Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2020,10,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Aman Agarwal Kenta Takatsu Ivan Zaitsev and Thorsten Joachims. 2019 a. A General Framework for Counterfactual Learning-to-Rank. In SIGIR. ACM 5--14.  Aman Agarwal Kenta Takatsu Ivan Zaitsev and Thorsten Joachims. 2019 a. A General Framework for Counterfactual Learning-to-Rank. In SIGIR. ACM 5--14.","DOI":"10.1145\/3331184.3331202"},{"key":"e_1_3_2_2_2_1","volume-title":"Addressing Trust Bias for Unbiased Learning-to-Rank. In The World Wide Web Conference. ACM, 4--14","author":"Agarwal Aman","year":"2019","unstructured":"Aman Agarwal , Xuanhui Wang , Cheng Li , Michael Bendersky , and Marc Najork . 2019 b . Addressing Trust Bias for Unbiased Learning-to-Rank. In The World Wide Web Conference. ACM, 4--14 . Aman Agarwal, Xuanhui Wang, Cheng Li, Michael Bendersky, and Marc Najork. 2019 b. Addressing Trust Bias for Unbiased Learning-to-Rank. In The World Wide Web Conference. ACM, 4--14."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"Aman Agarwal Ivan Zaitsev Xuanhui Wang Cheng Li Marc Najork and Thorsten Joachims. 2019 c. Estimating Position Bias without Intrusive Interventions. In WSDM. ACM 474--482.  Aman Agarwal Ivan Zaitsev Xuanhui Wang Cheng Li Marc Najork and Thorsten Joachims. 2019 c. Estimating Position Bias without Intrusive Interventions. In WSDM. ACM 474--482.","DOI":"10.1145\/3289600.3291017"},{"key":"e_1_3_2_2_4_1","unstructured":"Qingyao Ai Keping Bi Cheng Luo Jiafeng Guo and W Bruce Croft. 2018. Unbiased Learning to Rank with Unbiased Propensity Estimation. In SIGIR. ACM 385--394.  Qingyao Ai Keping Bi Cheng Luo Jiafeng Guo and W Bruce Croft. 2018. Unbiased Learning to Rank with Unbiased Propensity Estimation. In SIGIR. ACM 385--394."},{"key":"e_1_3_2_2_5_1","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 , Vol. 14 (2011), 1 -- 24 . Olivier Chapelle and Yi Chang. 2011. Yahoo! Learning to Rank Challenge Overview. Journal of Machine Learning Research, Vol. 14 (2011), 1--24.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Nick Craswell Onno Zoeter Michael Taylor and Bill Ramsey. 2008. An Experimental Comparison of Click Position-bias Models. In WSDM. 87--94.  Nick Craswell Onno Zoeter Michael Taylor and Bill Ramsey. 2008. An Experimental Comparison of Click Position-bias Models. In WSDM. 87--94.","DOI":"10.1145\/1341531.1341545"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2021068"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Zhichong Fang Aman Agarwal and Thorsten Joachims. 2019. Intervention Harvesting for Context-dependent Examination-bias Estimation. In SIGIR. 825--834.  Zhichong Fang Aman Agarwal and Thorsten Joachims. 2019. Intervention Harvesting for Context-dependent Examination-bias Estimation. In SIGIR. 825--834.","DOI":"10.1145\/3331184.3331238"},{"key":"e_1_3_2_2_9_1","volume-title":"Unbiased LambdaMART: An Unbiased Pairwise Learning-to-Rank Algorithm. In The World Wide Web Conference. ACM, 2830--2836","author":"Hu Ziniu","year":"2019","unstructured":"Ziniu Hu , Yang Wang , Qu Peng , and Hang Li . 2019 . Unbiased LambdaMART: An Unbiased Pairwise Learning-to-Rank Algorithm. In The World Wide Web Conference. ACM, 2830--2836 . Ziniu Hu, Yang Wang, Qu Peng, and Hang Li. 2019. Unbiased LambdaMART: An Unbiased Pairwise Learning-to-Rank Algorithm. In The World Wide Web Conference. ACM, 2830--2836."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Rolf Jagerman Harrie Oosterhuis and Maarten de Rijke. 2019. To Model or to Intervene: A Comparison of Counterfactual and Online Learning to Rank from User Interactions. In SIGIR. ACM 15--24.  Rolf Jagerman Harrie Oosterhuis and Maarten de Rijke. 2019. To Model or to Intervene: A Comparison of Counterfactual and Online Learning to Rank from User Interactions. In SIGIR. ACM 15--24.","DOI":"10.1145\/3331184.3331269"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Thorsten Joachims. 2002. Optimizing Search Engines Using Clickthrough Data. In KDD. ACM 133--142.  Thorsten Joachims. 2002. Optimizing Search Engines Using Clickthrough Data. In KDD. ACM 133--142.","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Thorsten Joachims Laura Granka Bing Pan Helene Hembrooke and Geri Gay. 2005. Accurately Interpreting Clickthrough Data as Implicit Feedback. In SIGIR. ACM 154--161.  Thorsten Joachims Laura Granka Bing Pan Helene Hembrooke and Geri Gay. 2005. Accurately Interpreting Clickthrough Data as Implicit Feedback. In SIGIR. ACM 154--161.","DOI":"10.1145\/1076034.1076063"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Thorsten Joachims Adith Swaminathan and Tobias Schnabel. 2017. Unbiased Learning-to-Rank with Biased Feedback. In WSDM. ACM 781--789.  Thorsten Joachims Adith Swaminathan and Tobias Schnabel. 2017. Unbiased Learning-to-Rank with Biased Feedback. In WSDM. ACM 781--789.","DOI":"10.1145\/3018661.3018699"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000016"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Harrie Oosterhuis and Maarten de Rijke. 2020. Policy-Aware Unbiased Learning to Rank for Top-k Rankings. In SIGIR. ACM.  Harrie Oosterhuis and Maarten de Rijke. 2020. Policy-Aware Unbiased Learning to Rank for Top-k Rankings. In SIGIR. ACM.","DOI":"10.1145\/3397271.3401102"},{"key":"e_1_3_2_2_16_1","volume-title":"Correcting for Selection Bias in Learning-to-rank Systems. arXiv preprint arXiv:2001.11358","author":"Ovaisi Zohreh","year":"2020","unstructured":"Zohreh Ovaisi , Ragib Ahsan , Yifan Zhang , Kathryn Vasilaky , and Elena Zheleva . 2020. Correcting for Selection Bias in Learning-to-rank Systems. arXiv preprint arXiv:2001.11358 ( 2020 ). Zohreh Ovaisi, Ragib Ahsan, Yifan Zhang, Kathryn Vasilaky, and Elena Zheleva. 2020. Correcting for Selection Bias in Learning-to-rank Systems. arXiv preprint arXiv:2001.11358 (2020)."},{"key":"e_1_3_2_2_17_1","volume-title":"arXiv preprint arXiv:1306.2597","author":"Qin Tao","year":"2013","unstructured":"Tao Qin and Tie-Yan Liu . 2013. Introducing LETOR 4.0 datasets. arXiv preprint arXiv:1306.2597 ( 2013 ). Tao Qin and Tie-Yan Liu. 2013. Introducing LETOR 4.0 datasets. arXiv preprint arXiv:1306.2597 (2013)."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000009"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2789272.2886805"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"crossref","unstructured":"Xuanhui Wang Michael Bendersky Donald Metzler and Marc Najork. 2016. Learning to Rank with Selection Bias in Personal Search. In SIGIR. ACM 115--124.  Xuanhui Wang Michael Bendersky Donald Metzler and Marc Najork. 2016. Learning to Rank with Selection Bias in Personal Search. In SIGIR. ACM 115--124.","DOI":"10.1145\/2911451.2911537"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Xuanhui Wang Nadav Golbandi Michael Bendersky Donald Metzler and Marc Najork. 2018a. Position Bias Estimation for Unbiased Learning to Rank in Personal Search. In WSDM. ACM 610--618.  Xuanhui Wang Nadav Golbandi Michael Bendersky Donald Metzler and Marc Najork. 2018a. Position Bias Estimation for Unbiased Learning to Rank in Personal Search. In WSDM. ACM 610--618.","DOI":"10.1145\/3159652.3159732"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Xuanhui Wang Cheng Li Nadav Golbandi Michael Bendersky and Marc Najork. 2018b. The LambdaLoss Framework for Ranking Metric Optimization. In CIKM. ACM 1313--1322.  Xuanhui Wang Cheng Li Nadav Golbandi Michael Bendersky and Marc Najork. 2018b. The LambdaLoss Framework for Ranking Metric Optimization. In CIKM. ACM 1313--1322.","DOI":"10.1145\/3269206.3271784"},{"key":"e_1_3_2_2_23_1","unstructured":"Yisong Yue Rajan Patel and Hein Roehrig. 2010. Beyond Position Bias: Examining Result Attractiveness as a Source of Presentation Bias in Clickthrough Data. In WWW. ACM 1011--1018.  Yisong Yue Rajan Patel and Hein Roehrig. 2010. Beyond Position Bias: Examining Result Attractiveness as a Source of Presentation Bias in Clickthrough Data. In WWW. ACM 1011--1018."}],"event":{"name":"CIKM '20: The 29th ACM International Conference on Information and Knowledge Management","location":"Virtual Event Ireland","acronym":"CIKM '20","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 29th ACM International Conference on Information & Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412031","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3340531.3412031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:29Z","timestamp":1750197749000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3340531.3412031"}},"subtitle":["Affine Corrections for Unbiased Learning to Rank"],"short-title":[],"issued":{"date-parts":[[2020,10,19]]},"references-count":23,"alternative-id":["10.1145\/3340531.3412031","10.1145\/3340531"],"URL":"https:\/\/doi.org\/10.1145\/3340531.3412031","relation":{},"subject":[],"published":{"date-parts":[[2020,10,19]]},"assertion":[{"value":"2020-10-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}