{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T16:40:52Z","timestamp":1786120852676,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T00:00:00Z","timestamp":1786147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"HORIZON EUROPE Digital, Industry and Space","award":["101120763"],"award-info":[{"award-number":["101120763"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,8,9]]},"DOI":"10.1145\/3770855.3817918","type":"proceedings-article","created":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T01:08:33Z","timestamp":1786064913000},"page":"1164-1175","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounded-Abstention Pairwise Learning to Rank"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0784-1115","authenticated-orcid":false,"given":"Antonio","family":"Ferrara","sequence":"first","affiliation":[{"name":"Intesa Sanpaolo AI Research, Turin, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9138-8212","authenticated-orcid":false,"given":"Andrea","family":"Pugnana","sequence":"additional","affiliation":[{"name":"University of Trento, Trento, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9464-8315","authenticated-orcid":false,"given":"Francesco","family":"Bonchi","sequence":"additional","affiliation":[{"name":"Intesa Sanpaolo AI Research, Turin, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1917-6087","authenticated-orcid":false,"given":"Salvatore","family":"Ruggieri","sequence":"additional","affiliation":[{"name":"University of Pisa, Pisa, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,8,8]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.2307\/2334029"},{"key":"e_1_3_2_2_2_1","first-page":"23","article-title":"From ranknet to lambdarank to lambdamart: An overview","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.","journal-title":"Learning"},{"key":"e_1_3_2_2_3_1","volume-title":"Yahoo! Learning to Rank Challenge (JMLR Proceedings","author":"Chapelle Olivier","unstructured":"Olivier Chapelle and Yi Chang. 2011. Yahoo! Learning to Rank Challenge Overview. In Yahoo! Learning to Rank Challenge (JMLR Proceedings, Vol. 14). JMLR.org, 1-24."},{"key":"e_1_3_2_2_4_1","first-page":"785","article-title":"XGBoost","author":"Chen Tianqi","year":"2016","unstructured":"Tianqi Chen and Carlos Guestrin. 2016. XGBoost: A Scalable Tree Boosting System. In KDD. ACM, 785-794.","journal-title":"A Scalable Tree Boosting System. In KDD. ACM"},{"key":"e_1_3_2_2_5_1","first-page":"2510","article-title":"Label Ranking with Partial Abstention based on Thresholded Probabilistic Models","author":"Cheng Weiwei","year":"2012","unstructured":"Weiwei Cheng, Eyke H\u00fcllermeier, Willem Waegeman, and Volkmar Welker. 2012. Label Ranking with Partial Abstention based on Thresholded Probabilistic Models. In NIPS. 2510-2518.","journal-title":"NIPS."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15880-3_20"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054406"},{"key":"e_1_3_2_2_8_1","first-page":"1340","article-title":"Classification with reject option using contextual information","author":"Condessa Filipe","year":"2013","unstructured":"Filipe Condessa, Jos\u00e9 M. Bioucas-Dias, Carlos A. Castro, John A. Ozolek, and Jelena Kovacevic. 2013. Classification with reject option using contextual information. In ISBI. IEEE, 1340-1343.","journal-title":"ISBI. IEEE"},{"key":"e_1_3_2_2_9_1","first-page":"68","article-title":"An Adaptive Reject Option for LVQ Classifiers. In ICIAP (Lecture Notes in Computer Science, Vol. 974)","author":"Cordella Luigi P.","year":"1995","unstructured":"Luigi P. Cordella, Claudio De Stefano, Carlo Sansone, and Mario Vento. 1995. An Adaptive Reject Option for LVQ Classifiers. In ICIAP (Lecture Notes in Computer Science, Vol. 974). Springer, 68-73.","journal-title":"Springer"},{"key":"e_1_3_2_2_10_1","first-page":"1660","article-title":"Boosting with Abstention","author":"Cortes Corinna","year":"2016","unstructured":"Corinna Cortes, Giulia DeSalvo, and Mehryar Mohri. 2016. Boosting with Abstention. In NIPS. 1660-1668.","journal-title":"NIPS."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-023-09899-2"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1080\/10485252.2019.1689241"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1756006.1859904"},{"key":"e_1_3_2_2_14_1","volume-title":"Hossein Hajimirsadeghi, and Amir H. Abdi.","author":"Feng Leo","year":"2023","unstructured":"Leo Feng, Mohamed Osama Ahmed, Hossein Hajimirsadeghi, and Amir H. Abdi. 2023. Towards Better Selective Classification. In ICLR. OpenReview.net."},{"key":"e_1_3_2_2_15_1","article-title":"Optimal Strategies for Reject Option Classifiers","volume":"24","author":"Franc Vojtech","year":"2023","unstructured":"Vojtech Franc, Daniel Pr\u016f\u0161a, and V\u00e1clav Vor\u00e1cek. 2023. Optimal Strategies for Reject Option Classifiers. J. Mach. Learn. Res., Vol. 24 (2023), 11:1-11:49.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_2_16_1","first-page":"4878","article-title":"Selective Classification for Deep Neural Networks","author":"Geifman Yonatan","year":"2017","unstructured":"Yonatan Geifman and Ran El-Yaniv. 2017. Selective Classification for Deep Neural Networks. In NIPS. 4878-4887.","journal-title":"NIPS."},{"key":"e_1_3_2_2_17_1","first-page":"2151","volume-title":"ICML","volume":"97","author":"Geifman Yonatan","year":"2019","unstructured":"Yonatan Geifman and Ran El-Yaniv. 2019. SelectiveNet: A Deep Neural Network with an Integrated Reject Option. In ICML, Vol. 97. PMLR, 2151-2159."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-024-06534-x"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/cjs.5550340410"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-2099-5_20"},{"key":"e_1_3_2_2_21_1","volume-title":"Lightgbm: A highly efficient gradient boosting decision tree. Advances in neural information processing systems","author":"Ke Guolin","year":"2017","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. Advances in neural information processing systems, Vol. 30 (2017)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-70368-3_25"},{"key":"e_1_3_2_2_23_1","first-page":"6150","article-title":"Predict Responsibly: Improving Fairness and Accuracy by Learning to Defer","author":"Madras David","year":"2018","unstructured":"David Madras, Toniann Pitassi, and Richard S. Zemel. 2018. Predict Responsibly: Improving Fairness and Accuracy by Learning to Defer. In NeurIPS. 6150-6160.","journal-title":"NeurIPS."},{"key":"e_1_3_2_2_24_1","volume-title":"Ranking with Abstention. CoRR","author":"Mao Anqi","year":"2035","unstructured":"Anqi Mao, Mehryar Mohri, and Yutao Zhong. 2023. Ranking with Abstention. CoRR, Vol. abs\/2307.02035 (2023)."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"crossref","unstructured":"Lorenzo Perini and Jesse Davis. 2023. Unsupervised Anomaly Detection with Rejection. In NeurIPS.","DOI":"10.52202\/075280-3052"},{"key":"e_1_3_2_2_26_1","volume-title":"Anna Veronika Dorogush, and Andrey Gulin","author":"Prokhorenkova Liudmila","year":"2018","unstructured":"Liudmila Prokhorenkova, Gleb Gusev, Aleksandr Vorobev, Anna Veronika Dorogush, and Andrey Gulin. 2018. CatBoost: unbiased boosting with categorical features. Advances in neural information processing systems, Vol. 31 (2018)."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Daniel Prusa and Vojtech Franc. 2025. Constrained Binary Decision Making. In NeurIPS.","DOI":"10.52202\/079017-1942"},{"key":"e_1_3_2_2_28_1","first-page":"1","article-title":"Deep Neural Network Benchmarks for Selective Classification","volume":"1","author":"Pugnana Andrea","year":"2024","unstructured":"Andrea Pugnana, Lorenzo Perini, Jesse Davis, and Salvatore Ruggieri. 2024. Deep Neural Network Benchmarks for Selective Classification. Journal of Data-centric Machine Learning Research (DMLR), Vol. 1, 17 (2024), 1-58.","journal-title":"Journal of Data-centric Machine Learning Research (DMLR)"},{"key":"e_1_3_2_2_29_1","volume-title":"AISTATS (Proceedings of Machine Learning Research","volume":"2514","author":"Pugnana Andrea","year":"2023","unstructured":"Andrea Pugnana and Salvatore Ruggieri. 2023a. AUC-based Selective Classification. In AISTATS (Proceedings of Machine Learning Research, Vol. 206). PMLR, 2494-2514."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i8.26133"},{"key":"e_1_3_2_2_31_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). arXiv:1306.2597 http:\/\/arxiv.org\/abs\/1306.2597"},{"key":"e_1_3_2_2_32_1","volume-title":"Xuanhui Wang, Michael Bendersky, and Marc Najork.","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 ICLR. OpenReview.net."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Stephan Rabanser and Nicolas Papernot. 2025. What Does It Take to Build a Performant Selective Classifier?. In NeurIPS.","DOI":"10.52202\/085713-2635"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1967.10482901"},{"key":"e_1_3_2_2_35_1","volume-title":"Things Machine Learning Models Know That They Don't Know","author":"Ruggieri Salvatore","unstructured":"Salvatore Ruggieri and Andrea Pugnana. 2025. Things Machine Learning Models Know That They Don't Know. In AAAI. AAAI Press, 28684-28693."},{"key":"e_1_3_2_2_36_1","volume-title":"UAI (Proceedings of Machine Learning Research)","author":"Schreuder Nicolas","unstructured":"Nicolas Schreuder and Evgenii Chzhen. 2021. Classification with abstention but without disparities. In UAI (Proceedings of Machine Learning Research). AUAI Press, 1227-1236."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.3233\/FAIA240749"},{"key":"e_1_3_2_2_38_1","volume-title":"Learning to Reject Low-Quality Explanations via User Feedback. CoRR","author":"Stradiotti Luca","year":"2025","unstructured":"Luca Stradiotti, Dario Pesenti, Stefano Teso, and Jesse Davis. 2025. Learning to Reject Low-Quality Explanations via User Feedback. CoRR, Vol. abs\/2507.12900 (2025)."},{"key":"e_1_3_2_2_39_1","volume-title":"A law of comparative judgment. Psychological review","author":"Thurstone Louis L","year":"1994","unstructured":"Louis L Thurstone. 1994. A law of comparative judgment. Psychological review, Vol. 101, 2 (1994), 266."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2004.09.004"},{"key":"e_1_3_2_2_41_1","unstructured":"Ahmed Zaoui Christophe Denis and Mohamed Hebiri. 2020. Regression with reject option and application to kNN. In NeurIPS."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390382"}],"event":{"name":"KDD '26: The 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Jeju Island Republic of Korea","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2"],"original-title":[],"deposited":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T01:09:43Z","timestamp":1786064983000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3770855.3817918"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8,8]]},"references-count":42,"alternative-id":["10.1145\/3770855.3817918","10.1145\/3770855"],"URL":"https:\/\/doi.org\/10.1145\/3770855.3817918","relation":{},"subject":[],"published":{"date-parts":[[2026,8,8]]},"assertion":[{"value":"2026-08-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}