{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:40:08Z","timestamp":1755841208072,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T00:00:00Z","timestamp":1720569600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["024.004.022, NWA.1389.20.183, KICH3.LTP.20.006, VI.Veni.222.269"],"award-info":[{"award-number":["024.004.022, NWA.1389.20.183, KICH3.LTP.20.006, VI.Veni.222.269"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,10]]},"DOI":"10.1145\/3626772.3657918","type":"proceedings-article","created":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T12:40:05Z","timestamp":1720701605000},"page":"2390-2394","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Estimating the Hessian Matrix of Ranking Objectives for Stochastic Learning to Rank with Gradient Boosted Trees"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-9283-4060","authenticated-orcid":false,"given":"Jingwei","family":"Kang","sequence":"first","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1086-0202","authenticated-orcid":false,"given":"Maarten","family":"de Rijke","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Amsterdam, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0458-9233","authenticated-orcid":false,"given":"Harrie","family":"Oosterhuis","sequence":"additional","affiliation":[{"name":"Radboud University, Nijmegen, Netherlands"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330701"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371844"},{"key":"e_1_3_2_1_3_1","volume-title":"SIGIR 2022 Workshop on Reaching Efficiency in Neural Information Retrieval.","author":"Buchholz Alexander","year":"2022","unstructured":"Alexander Buchholz, Jan Malte Lichtenberg, Giuseppe Di Benedetto, Yannik Stein, Vito Bellini, and Matteo Ruffini. 2022. Low-variance estimation in the Plackett-Luce model via quasi-Monte Carlo sampling. In SIGIR 2022 Workshop on Reaching Efficiency in Neural Information Retrieval."},{"key":"e_1_3_2_1_4_1","unstructured":"Chris J.C. Burges. 2010. From RankNet to LambdaRank to LambdaMART: An Overview. Technical Report MSR-TR-2010--82."},{"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\/1401890.1401906"},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the Learning to Rank Challenge (Proceedings of Machine Learning Research","volume":"24","author":"Chapelle Olivier","year":"2011","unstructured":"Olivier Chapelle and Yi Chang. 2011. Yahoo! Learning to Rank Challenge Overview. In Proceedings of the Learning to Rank Challenge (Proceedings of Machine Learning Research, Vol. 14), Olivier Chapelle, Yi Chang, and Tie-Yan Liu (Eds.). PMLR, Haifa, Israel, 1--24."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939785"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2987380"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531740"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411962"},{"key":"e_1_3_2_1_12_1","volume-title":"Statistical Theory of Extreme Values and Some Practical Applications","author":"Gumbel Emil Julius","year":"1954","unstructured":"Emil Julius Gumbel. 1954. Statistical Theory of Extreme Values and Some Practical Applications. National Bureau of Standards Applied Mathematics Series. 33 (1954)."},{"volume-title":"Information Retrieval Evaluation","author":"Harman Donna","key":"e_1_3_2_1_13_1","unstructured":"Donna Harman. 2011. Information Retrieval Evaluation. Morgan & Claypool Publishers."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531849"},{"key":"e_1_3_2_1_15_1","volume-title":"ACM Trans. Inf. Syst.","volume":"20","author":"Jaana Kalervo","year":"2002","unstructured":"Kalervo J\"arvelin and Jaana Kek\"al\"ainen. 2002. Cumulated gain-based evaluation of IR techniques. ACM Trans. Inf. Syst. , Vol. 20, 4 (oct 2002), 422--446."},{"key":"e_1_3_2_1_16_1","volume-title":"Foundations and Trends\u00ae in Information Retrieval","volume":"3","author":"Liu Tie-Yan","year":"2009","unstructured":"Tie-Yan Liu. 2009. Learning to Rank for Information Retrieval. Foundations and Trends\u00ae in Information Retrieval, Vol. 3, 3 (2009), 225--331."},{"volume-title":"Individual Choice Behavior: A Theoretical Analysis","author":"Luce R. Duncan","key":"e_1_3_2_1_17_1","unstructured":"R. Duncan Luce. 1959. Individual Choice Behavior: A Theoretical Analysis. Wiley."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462830"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531842"},{"volume-title":"PyTorch: An Imperative Style","author":"Paszke Adam","key":"e_1_3_2_1_20_1","unstructured":"Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala. 2019. PyTorch: An Imperative Style, High-Performance Deep Learning Library. In Advances in Neural Information Processing Systems, H. Wallach, H. Larochelle, A. Beygelzimer, F. dtextquotesingle Alch\u00e9-Buc, E. Fox, and R. Garnett (Eds.), Vol. 32. Curran Associates, Inc., Red Hook, NY, USA, 12."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.2307\/2346567"},{"key":"e_1_3_2_1_22_1","volume-title":"abs\/1306.2597","author":"Qin Tao","year":"2013","unstructured":"Tao Qin and Tie-Yan Liu. 2013. Introducing LETOR 4.0 Datasets. CoRR , Vol. abs\/1306.2597 (2013)."},{"key":"e_1_3_2_1_23_1","volume-title":"A General Approximation Framework for Direct Optimization of Information Retrieval Measures. Information retrieval","author":"Qin Tao","year":"2010","unstructured":"Tao Qin, Tie-Yan Liu, and Hang Li. 2010. A General Approximation Framework for Direct Optimization of Information Retrieval Measures. Information retrieval , Vol. 13 (2010), 375--397."},{"key":"e_1_3_2_1_24_1","volume-title":"International Conference on Learning Representations (ICLR).","author":"Qin Zhen","year":"2021","unstructured":"Zhen Qin, Le Yan, Honglei Zhuang, Yi Tay, Rama Kumar Pasumarthi, Xuanhui Wang, Mike Bendersky, and Marc Najork. 2021. Are Neural Rankers still Outperformed by Gradient Boosted Decision Trees?. In International Conference on Learning Representations (ICLR)."},{"volume-title":"Policy learning for fairness in ranking","author":"Singh Ashudeep","key":"e_1_3_2_1_25_1","unstructured":"Ashudeep Singh and Thorsten Joachims. 2019. Policy learning for fairness in ranking. Curran Associates Inc., Red Hook, NY, USA."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341544"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 37th International Conference on Machine Learning (Proceedings of Machine Learning Research","volume":"9679","author":"Ustimenko Aleksei","year":"2020","unstructured":"Aleksei Ustimenko and Liudmila Prokhorenkova. 2020. StochasticRank: Global Optimization of Scale-Free Discrete Functions. In Proceedings of the 37th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 119). PMLR, 9669--9679."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390306"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390355"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277790"}],"event":{"name":"SIGIR 2024: The 47th International ACM SIGIR Conference on Research and Development in Information Retrieval","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Washington DC USA","acronym":"SIGIR 2024"},"container-title":["Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626772.3657918","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626772.3657918","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:20:46Z","timestamp":1755840046000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626772.3657918"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,10]]},"references-count":30,"alternative-id":["10.1145\/3626772.3657918","10.1145\/3626772"],"URL":"https:\/\/doi.org\/10.1145\/3626772.3657918","relation":{},"subject":[],"published":{"date-parts":[[2024,7,10]]},"assertion":[{"value":"2024-07-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}