{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:08:53Z","timestamp":1755907733591,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T00:00:00Z","timestamp":1700956800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,26]]},"DOI":"10.1145\/3624918.3625325","type":"proceedings-article","created":{"date-parts":[[2023,11,23]],"date-time":"2023-11-23T08:49:17Z","timestamp":1700729357000},"page":"122-128","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Towards Sequential Counterfactual Learning to Rank"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-6519-493X","authenticated-orcid":false,"given":"Tesi","family":"Xiao","sequence":"first","affiliation":[{"name":"Amazon, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3965-1367","authenticated-orcid":false,"given":"Branislav","family":"Kveton","sequence":"additional","affiliation":[{"name":"AWS AI Labs, Amazon, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-1807-4215","authenticated-orcid":false,"given":"Sumeet","family":"Katariya","sequence":"additional","affiliation":[{"name":"Amazon, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-6144-6149","authenticated-orcid":false,"given":"Tanmay","family":"Gangwani","sequence":"additional","affiliation":[{"name":"Amazon, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-6931-8987","authenticated-orcid":false,"given":"Anshuka","family":"Rangi","sequence":"additional","affiliation":[{"name":"Amazon, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,11,26]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331202"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883033"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3210004"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341981.3344221"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2914675"},{"key":"e_1_3_2_1_7_1","volume-title":"Overview of the TREC 2014 Session Track.. In TREC.","author":"Carterette Ben","year":"2014","unstructured":"Ben Carterette, Evangelos Kanoulas, Mark\u00a0M Hall, and Paul\u00a0D Clough. 2014. Overview of the TREC 2014 Session Track.. In TREC."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3358158"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"key":"e_1_3_2_1_10_1","volume-title":"International Conference on Learning Representations.","author":"Grover Aditya","year":"2018","unstructured":"Aditya Grover, Eric Wang, Aaron Zweig, and Stefano Ermon. 2018. Stochastic Optimization of Sorting Networks via Continuous Relaxations. In International Conference on Learning Representations."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983769"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401065"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78646-7_4"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018699"},{"key":"e_1_3_2_1_16_1","volume-title":"International Conference on Machine Learning. PMLR, 1215\u20131224","author":"Katariya Sumeet","year":"2016","unstructured":"Sumeet Katariya, Branislav Kveton, Csaba Szepesvari, and Zheng Wen. 2016. DCM bandits: Learning to rank with multiple clicks. In International Conference on Machine Learning. PMLR, 1215\u20131224."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2742562"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220028"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341981.3344216"},{"key":"e_1_3_2_1_20_1","volume-title":"Breaking the curse of horizon: Infinite-horizon off-policy estimation. Advances in Neural Information Processing Systems 31","author":"Liu Qiang","year":"2018","unstructured":"Qiang Liu, Lihong Li, Ziyang Tang, and Dengyong Zhou. 2018. Breaking the curse of horizon: Infinite-horizon off-policy estimation. Advances in Neural Information Processing Systems 31 (2018)."},{"key":"e_1_3_2_1_21_1","volume-title":"Learning to rank for information retrieval. Foundations and Trends\u00ae in Information Retrieval 3, 3","author":"Tie-Yan","year":"2009","unstructured":"Tie-Yan Liu 2009. Learning to rank for information retrieval. Foundations and Trends\u00ae in Information Retrieval 3, 3 (2009), 225\u2013331."},{"key":"e_1_3_2_1_22_1","volume-title":"Whole Page Unbiased Learning to Rank. arXiv preprint arXiv:2210.10718","author":"Mao Haitao","year":"2022","unstructured":"Haitao Mao, Lixin Zou, Yujia Zheng, Jiliang Tang, Xiaokai Chu, Jiashu Zhao, and Dawei Yin. 2022. Whole Page Unbiased Learning to Rank. arXiv preprint arXiv:2210.10718 (2022)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462830"},{"key":"e_1_3_2_1_24_1","volume-title":"Learning-to-Rank at the Speed of Sampling: Plackett-Luce Gradient Estimation With Minimal Computational Complexity. arXiv preprint arXiv:2204.10872","author":"Oosterhuis Harrie","year":"2022","unstructured":"Harrie Oosterhuis. 2022. Learning-to-Rank at the Speed of Sampling: Plackett-Luce Gradient Estimation With Minimal Computational Complexity. arXiv preprint arXiv:2204.10872 (2022)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271686"},{"key":"e_1_3_2_1_26_1","volume-title":"International Conference on Machine Learning. PMLR, 7793\u20137802","author":"Prillo Sebastian","year":"2020","unstructured":"Sebastian Prillo and Julian Eisenschlos. 2020. Softsort: A continuous relaxation for the argsort operator. In International Conference on Machine Learning. PMLR, 7793\u20137802."},{"key":"e_1_3_2_1_27_1","volume-title":"Are neural rankers still outperformed by gradient boosted decision trees?","author":"Qin Zhen","year":"2021","unstructured":"Zhen Qin, Le Yan, Honglei Zhuang, Yi Tay, Rama\u00a0Kumar Pasumarthi, Xuanhui Wang, Mike Bendersky, and Marc Najork. 2021. Are neural rankers still outperformed by gradient boosted decision trees? (2021)."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242643"},{"key":"e_1_3_2_1_29_1","first-page":"21644","article-title":"Pirank: Scalable learning to rank via differentiable sorting","volume":"34","author":"Swezey Robin","year":"2021","unstructured":"Robin Swezey, Aditya Grover, Bruno Charron, and Stefano Ermon. 2021. Pirank: Scalable learning to rank via differentiable sorting. Advances in Neural Information Processing Systems 34 (2021), 21644\u201321654.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911537"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512092"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462855"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806456"},{"key":"e_1_3_2_1_34_1","volume-title":"International conference on machine learning. PMLR, 4199\u20134208","author":"Zoghi Masrour","year":"2017","unstructured":"Masrour Zoghi, Tomas Tunys, Mohammad Ghavamzadeh, Branislav Kveton, Csaba Szepesvari, and Zheng Wen. 2017. Online learning to rank in stochastic click models. In International conference on machine learning. PMLR, 4199\u20134208."},{"key":"e_1_3_2_1_35_1","volume-title":"Thirty-sixth Conference on Neural Information Processing Systems Datasets and Benchmarks Track.","author":"Zou Lixin","year":"2022","unstructured":"Lixin Zou, Haitao Mao, Xiaokai Chu, Jiliang Tang, Wenwen Ye, Shuaiqiang Wang, and Dawei Yin. 2022. A Large Scale Search Dataset for Unbiased Learning to Rank. In Thirty-sixth Conference on Neural Information Processing Systems Datasets and Benchmarks Track."}],"event":{"name":"SIGIR-AP '23: Annual International ACM SIGIR Conference on Research and Development in Information Retrieval in the Asia Pacific Region","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Beijing China","acronym":"SIGIR-AP '23"},"container-title":["Proceedings of the Annual International ACM SIGIR Conference on Research and Development in Information Retrieval in the Asia Pacific Region"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3624918.3625325","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3624918.3625325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T21:31:55Z","timestamp":1755898315000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3624918.3625325"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,26]]},"references-count":35,"alternative-id":["10.1145\/3624918.3625325","10.1145\/3624918"],"URL":"https:\/\/doi.org\/10.1145\/3624918.3625325","relation":{},"subject":[],"published":{"date-parts":[[2023,11,26]]},"assertion":[{"value":"2023-11-26","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}