{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:16:44Z","timestamp":1775470604020,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T00:00:00Z","timestamp":1697846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,21]]},"DOI":"10.1145\/3583780.3614712","type":"proceedings-article","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T07:45:26Z","timestamp":1697874326000},"page":"4502-4508","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Regression Compatible Listwise Objectives for Calibrated Ranking with Binary Relevance"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5164-4629","authenticated-orcid":false,"given":"Aijun","family":"Bai","sequence":"first","affiliation":[{"name":"Google LLC, Mountain View, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5169-495X","authenticated-orcid":false,"given":"Rolf","family":"Jagerman","sequence":"additional","affiliation":[{"name":"Google LLC, Amsterdam, Netherlands"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6739-134X","authenticated-orcid":false,"given":"Zhen","family":"Qin","sequence":"additional","affiliation":[{"name":"Google LLC, New York, NY, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1323-0545","authenticated-orcid":false,"given":"Le","family":"Yan","sequence":"additional","affiliation":[{"name":"Google LLC, Mountain View, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8240-9524","authenticated-orcid":false,"given":"Pratyush","family":"Kar","sequence":"additional","affiliation":[{"name":"Google LLC, Paris, France"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-2098-3831","authenticated-orcid":false,"given":"Bing-Rong","family":"Lin","sequence":"additional","affiliation":[{"name":"Google LLC, Mountain View, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-1388-1423","authenticated-orcid":false,"given":"Xuanhui","family":"Wang","sequence":"additional","affiliation":[{"name":"Google LLC, Mountain View, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2941-6240","authenticated-orcid":false,"given":"Michael","family":"Bendersky","sequence":"additional","affiliation":[{"name":"Google LLC, Mountain View, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1423-0854","authenticated-orcid":false,"given":"Marc","family":"Najork","sequence":"additional","affiliation":[{"name":"Google LLC, Mountain View, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,10,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Advances in Neural Information Processing Systems","author":"Burges Christopher","unstructured":"Christopher Burges , Robert Ragno , and Quoc Le. 2007. Learning to Rank with Nonsmooth Cost Functions . In Advances in Neural Information Processing Systems . MIT Press . Christopher Burges, Robert Ragno, and Quoc Le. 2007. Learning to Rank with Nonsmooth Cost Functions. In Advances in Neural Information Processing Systems. MIT Press."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_1_3_1","first-page":"23","article-title":"From RankNet to LambdaRank to LambdaMART","volume":"11","author":"Burges Christopher JC","year":"2010","unstructured":"Christopher JC Burges . 2010 . From RankNet to LambdaRank to LambdaMART : An Overview. Learning , Vol. 11 , 23 -- 581 (2010), 81. Christopher JC Burges. 2010. From RankNet to LambdaRank to LambdaMART: An Overview. Learning, Vol. 11, 23--581 (2010), 81.","journal-title":"An Overview. Learning"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_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 . Proceedings of Machine Learning Research , Vol. 14 (2011), 1 -- 24 . Olivier Chapelle and Yi Chang. 2011. Yahoo! learning to rank challenge overview. Proceedings of Machine Learning Research, Vol. 14 (2011), 1--24.","journal-title":"Proceedings of Machine Learning Research"},{"key":"e_1_3_2_1_6_1","unstructured":"Sougata Chaudhuri Abraham Bagherjeiran and James Liu. 2017. Ranking and Calibrating Click-Attributed Purchases in Performance Display Advertising. In 2017 AdKDD & TargetAd. 7:1--7:6.  Sougata Chaudhuri Abraham Bagherjeiran and James Liu. 2017. Ranking and Calibrating Click-Attributed Purchases in Performance Display Advertising. In 2017 AdKDD & TargetAd. 7:1--7:6."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2987380"},{"key":"e_1_3_2_1_8_1","volume-title":"International conference on machine learning. PMLR, 1321--1330","author":"Guo Chuan","year":"2017","unstructured":"Chuan Guo , Geoff Pleiss , Yu Sun , and Kilian Q Weinberger . 2017 . On calibration of modern neural networks . In International conference on machine learning. PMLR, 1321--1330 . Chuan Guo, Geoff Pleiss, Yu Sun, and Kilian Q Weinberger. 2017. On calibration of modern neural networks. In International conference on machine learning. PMLR, 1321--1330."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331269"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531849"},{"key":"e_1_3_2_1_11_1","volume-title":"ACM Transactions on Information Systems (TOIS)","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 Transactions on Information Systems (TOIS) , Vol. 20 , 4 (2002), 422--446. Kalervo J\"arvelin and Jaana Kek\"al\"ainen. 2002. Cumulated gain-based evaluation of IR techniques. ACM Transactions on Information Systems (TOIS), Vol. 20, 4 (2002), 422--446."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018699"},{"key":"e_1_3_2_1_14_1","unstructured":"Guolin Ke Qi Meng Thomas Finley Taifeng Wang Wei Chen Weidong Ma Qiwei Ye and Tie-Yan Liu. 2017. LightGBM: A highly efficient gradient boosting decision tree. In Advances in Neural Information Processing Systems. 3146--3154.  Guolin Ke Qi Meng Thomas Finley Taifeng Wang Wei Chen Weidong Ma Qiwei Ye and Tie-Yan Liu. 2017. LightGBM: A highly efficient gradient boosting decision tree. In Advances in Neural Information Processing Systems. 3146--3154."},{"key":"e_1_3_2_1_15_1","volume-title":"Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980","author":"Kingma Diederik P","year":"2014","unstructured":"Diederik P Kingma and Jimmy Ba . 2014 . Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014). Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980 (2014)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2788582"},{"key":"e_1_3_2_1_17_1","volume-title":"Foundations and Trends\u00ae in Information Retrieval","volume":"3","author":"Tie-Yan","year":"2009","unstructured":"Tie-Yan Liu et al. 2009. Learning to rank for information retrieval . Foundations and Trends\u00ae in Information Retrieval , Vol. 3 , 3 ( 2009 ), 225--331. Tie-Yan Liu et al. 2009. Learning to rank for information retrieval. Foundations and Trends\u00ae in Information Retrieval, Vol. 3, 3 (2009), 225--331."},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the 29th AAAI Conference on Artificial Intelligence","volume":"29","author":"Naeini Mahdi Pakdaman","year":"2015","unstructured":"Mahdi Pakdaman Naeini , Gregory Cooper , and Milos Hauskrecht . 2015 . Obtaining well calibrated probabilities using bayesian binning . In Proceedings of the 29th AAAI Conference on Artificial Intelligence , Vol. 29 . Mahdi Pakdaman Naeini, Gregory Cooper, and Milos Hauskrecht. 2015. Obtaining well calibrated probabilities using bayesian binning. In Proceedings of the 29th AAAI Conference on Artificial Intelligence, Vol. 29."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401104"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330677"},{"key":"e_1_3_2_1_21_1","volume-title":"Advances in Large Margin Classifiers, Alexander J","author":"Platt John","unstructured":"John Platt . 2000. Probabilistic Outputs for Support Vector Machines and Comparisons to Regularized Likelihood Methods . In Advances in Large Margin Classifiers, Alexander J . Smola, Peter Bartlett, Bernhard Sch\u00f6lkopf, and Dale Schuurmans (Eds.). MIT Press , 61--74. John Platt. 2000. Probabilistic Outputs for Support Vector Machines and Comparisons to Regularized Likelihood Methods. In Advances in Large Margin Classifiers, Alexander J. Smola, Peter Bartlett, Bernhard Sch\u00f6lkopf, and Dale Schuurmans (Eds.). MIT Press, 61--74."},{"key":"e_1_3_2_1_22_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_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380046"},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of the 9th International Conference on Learning Representations.","author":"Qin Zhen","year":"2021","unstructured":"Zhen Qin , Le Yan , Honglei Zhuang , Yi Tay , Rama Kumar Pasumarthi , Xuanhui Wang , Michael Bendersky , and Marc Najork . 2021 . Are Neural Rankers still Outperformed by Gradient Boosted Decision Trees? . In Proceedings of the 9th International Conference on Learning Representations. Zhen Qin, Le Yan, Honglei Zhuang, Yi Tay, Rama Kumar Pasumarthi, Xuanhui Wang, Michael Bendersky, and Marc Najork. 2021. Are Neural Rankers still Outperformed by Gradient Boosted Decision Trees?. In Proceedings of the 9th International Conference on Learning Representations."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835928"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2501040.2501978"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911537"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271784"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390306"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539072"},{"key":"e_1_3_2_1_31_1","volume-title":"Learning to Rank when Grades Matter. arXiv preprint arXiv:2306.08650","author":"Yan Le","year":"2023","unstructured":"Le Yan , Zhen Qin , Xuanhui Wang , Gil Shamir , and Mike Bendersky . 2023. Learning to Rank when Grades Matter. arXiv preprint arXiv:2306.08650 ( 2023 ). Le Yan, Zhen Qin, Xuanhui Wang, Gil Shamir, and Mike Bendersky. 2023. Learning to Rank when Grades Matter. arXiv preprint arXiv:2306.08650 (2023)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531837"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371814"}],"event":{"name":"CIKM '23: The 32nd ACM International Conference on Information and Knowledge Management","location":"Birmingham United Kingdom","acronym":"CIKM '23","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 32nd ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3614712","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583780.3614712","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:30Z","timestamp":1750178790000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3614712"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,21]]},"references-count":33,"alternative-id":["10.1145\/3583780.3614712","10.1145\/3583780"],"URL":"https:\/\/doi.org\/10.1145\/3583780.3614712","relation":{},"subject":[],"published":{"date-parts":[[2023,10,21]]},"assertion":[{"value":"2023-10-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}