{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:05:51Z","timestamp":1775228751216,"version":"3.50.1"},"reference-count":66,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"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":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2024,11,30]]},"abstract":"<jats:p>\n            Learning to rank models are broadly applied in\n            <jats:italic>ad hoc<\/jats:italic>\n            retrieval for scoring and sorting documents based on their relevance to textual queries. The generalizability of the trained model in the learning to rank approach, however, can have an impact on the retrieval performance, particularly when data includes noise and outliers, or is incorrectly collected or measured. In this paper, we introduce a Self-Distilled Learning to Rank (SDLR) framework for\n            <jats:italic>ad hoc<\/jats:italic>\n            retrieval, and analyze its performance over a range of retrieval datasets and also in the presence of features\u2019 noise. SDLR assigns a confidence weight to each training sample, aiming at reducing the impact of noisy and outlier data in the training process. The confidence weight is approximated based on the feature\u2019s distributions derived from the values observed for the features of the documents labeled for a query in a listwise training sample. SDLR includes a distillation process that facilitates passing on the underlying patterns in assigning confidence weights from the teacher model to the student one. We empirically illustrate that SDLR outperforms state-of-the-art learning to rank models in\n            <jats:italic>ad hoc<\/jats:italic>\n            retrieval. We thoroughly investigate the SDLR performance in different settings including when no distillation strategy is applied; when different portion of data are used for training the teacher and the student models, and when both teacher and student models are trained over identical data. We show that SDLR is more effective when training data are split between a teacher and a student model. We also show that SDLR\u2019s performance is robust when data features are noisy.\n          <\/jats:p>","DOI":"10.1145\/3681784","type":"journal-article","created":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T16:11:36Z","timestamp":1721923896000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A Self-Distilled Learning to Rank Model for\n            <i>Ad Hoc<\/i>\n            Retrieval"],"prefix":"10.1145","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1403-6712","authenticated-orcid":false,"given":"Sanaz","family":"Keshvari","sequence":"first","affiliation":[{"name":"Ferdowsi University of Mashhad, Mashhad, Iran"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-5587-189X","authenticated-orcid":false,"given":"Farzan","family":"Saeedi","sequence":"additional","affiliation":[{"name":"Ferdowsi University of Mashhad, Mashhad, Iran"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6885-4956","authenticated-orcid":false,"given":"Hadi","family":"Sadoghi Yazdi","sequence":"additional","affiliation":[{"name":"Ferdowsi University of Mashhad, Mashhad, Iran"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8891-0249","authenticated-orcid":false,"given":"Faezeh","family":"Ensan","sequence":"additional","affiliation":[{"name":"Toronto Metropolitan University, Toronto, Ontario, Canada"}]}],"member":"320","published-online":{"date-parts":[[2024,10,22]]},"reference":[{"issue":"2","key":"e_1_3_3_2_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3439861","article-title":"Unbiased learning to rank: online or offline?","volume":"39","author":"Ai Qingyao","year":"2021","unstructured":"Qingyao Ai, Tao Yang, Huazheng Wang, and Jiaxin Mao. 2021. Unbiased learning to rank: online or offline? ACM Transactions on Information Systems (TOIS) 39, 2 (2021), 1\u201329.","journal-title":"ACM Transactions on Information Systems (TOIS)"},{"key":"e_1_3_3_3_2","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1145\/3442381.3449794","volume-title":"Proceedings of the Web Conference 2021","author":"Bruch Sebastian","year":"2021","unstructured":"Sebastian Bruch. 2021. An alternative cross entropy loss for learning-to-rank. In Proceedings of the Web Conference 2021, 118\u2013126."},{"key":"e_1_3_3_4_2","first-page":"23","article-title":"From ranknet to lambdarank to lambdamart: An overview","volume":"11","author":"Burges Christopher J. C.","year":"2010","unstructured":"Christopher J. C. Burges. 2010. From ranknet to lambdarank to lambdamart: An overview. Learning 11, 23\u2013581 (2010), 81.","journal-title":"Learning"},{"key":"e_1_3_3_5_2","first-page":"129","volume-title":"Proceedings of the 24th International Conference on Machine Learning","author":"Cao Zhe","year":"2007","unstructured":"Zhe Cao, Tao Qin, Tie-Yan Liu, Ming-Feng Tsai, and Hang Li. 2007. Learning to rank: From pairwise approach to listwise approach. In Proceedings of the 24th International Conference on Machine Learning, 129\u2013136."},{"key":"e_1_3_3_6_2","volume-title":"Proceedings of the SIGIR 2008 Workshop on Learning to Rank for Information Retrieval","volume":"1","author":"Carvalho Vitor R.","year":"2008","unstructured":"Vitor R. Carvalho, Jonathan L. Elsas, William W. Cohen, and Jaime G. Carbonell. 2008. A meta-learning approach for robust rank learning. In Proceedings of the SIGIR 2008 Workshop on Learning to Rank for Information Retrieval, Vol. 1."},{"key":"e_1_3_3_7_2","first-page":"1","volume-title":"Proceedings of the Learning to Rank Challenge","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. PMLR, 1\u201324."},{"key":"e_1_3_3_8_2","doi-asserted-by":"crossref","first-page":"106478","DOI":"10.1016\/j.knosys.2020.106478","article-title":"DeepRank: Learning to rank with neural networks for recommendation","volume":"209","author":"Chen Ming","year":"2020","unstructured":"Ming Chen and Xiuze Zhou. 2020. DeepRank: Learning to rank with neural networks for recommendation. Knowledge-Based Systems 209 (2020), 106478.","journal-title":"Knowledge-Based Systems"},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.bspc.2021.103177"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","unstructured":"Xiaoyang Chen Kai Hui Ben He Xianpei Han Le Sun and Zheng Ye. 2021. Co-BERT: A context-aware BERT retrieval model incorporating local and query-specific context. arXiv:2104.08523. Retrieved from 10.48550\/arXiv.2104.08523","DOI":"10.48550\/arXiv.2104.08523"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","unstructured":"Christopher Clark Mark Yatskar and Luke Zettlemoyer. 2020. Learning to model and ignore dataset bias with mixed capacity ensembles. arXiv:2011.03856. Retrieved from 10.18653\/v1\/2020.findings-emnlp.272","DOI":"10.18653\/v1\/2020.findings-emnlp.272"},{"key":"e_1_3_3_12_2","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/978-3-642-36973-5_36","volume-title":"Proceedings of the Advances in Information Retrieval: 35th European Conference on IR Research (ECIR \u201913)","author":"Dang Van","year":"2013","unstructured":"Van Dang, Michael Bendersky, and W Bruce Croft. 2013. Two-stage learning to rank for information retrieval. In Proceedings of the Advances in Information Retrieval: 35th European Conference on IR Research (ECIR \u201913). Springer, 423\u2013434."},{"issue":"1","key":"e_1_3_3_13_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2576230","article-title":"Learning to rank from noisy data","volume":"7","author":"Ding Wenkui","year":"2015","unstructured":"Wenkui Ding, Xiubo Geng, and Xu-Dong Zhang. 2015. Learning to rank from noisy data. ACM Transactions on Intelligent Systems and Technology (TIST) 7, 1 (2015), 1\u201321.","journal-title":"ACM Transactions on Intelligent Systems and Technology (TIST)"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2023.103404"},{"key":"e_1_3_3_15_2","first-page":"1607","volume-title":"Proceedings of the International Conference on Machine Learning.","author":"Furlanello Tommaso","year":"2018","unstructured":"Tommaso Furlanello, Zachary Lipton, Michael Tschannen, Laurent Itti, and Anima Anandkumar. 2018. Born again neural networks. In Proceedings of the International Conference on Machine Learning. PMLR, 1607\u20131616."},{"key":"e_1_3_3_16_2","first-page":"149","volume-title":"Proceedings of the 2020 ACM SIGIR on International Conference on Theory of Information Retrieval","author":"Gao Luyu","year":"2020","unstructured":"Luyu Gao, Zhuyun Dai, and Jamie Callan. 2020. Understanding BERT rankers under distillation. In Proceedings of the 2020 ACM SIGIR on International Conference on Theory of Information Retrieval, 149\u2013152."},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","unstructured":"Matt Gardner William Merrill Jesse Dodge Matthew E. Peters Alexis Ross Sameer Singh and Noah A. Smith. 2021. Competency problems: On finding and removing artifacts in language data. arXiv:2104.08646. Retrieved from 10.48550\/arXiv.2104.08646","DOI":"10.48550\/arXiv.2104.08646"},{"key":"e_1_3_3_18_2","doi-asserted-by":"crossref","first-page":"1789","DOI":"10.1007\/s11263-021-01453-z","article-title":"Knowledge distillation: A survey","volume":"129","author":"Gou Jianping","year":"2021","unstructured":"Jianping Gou, Baosheng Yu, Stephen J. Maybank, and Dacheng Tao. 2021. Knowledge distillation: A survey. International Journal of Computer Vision 129 (2021), 1789\u20131819.","journal-title":"International Journal of Computer Vision"},{"key":"e_1_3_3_19_2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-71688-6","volume-title":"Nonparametric Kernel Density Estimation and Its Computational Aspects","author":"Gramacki Artur","year":"2018","unstructured":"Artur Gramacki. 2018. Nonparametric Kernel Density Estimation and Its Computational Aspects. Vol. 37. Springer."},{"key":"e_1_3_3_20_2","first-page":"55","volume-title":"Proceedings of the 25th ACM International on Conference on Information and Knowledge Management","author":"Guo Jiafeng","year":"2016","unstructured":"Jiafeng Guo, Yixing Fan, Qingyao Ai, and W Bruce Croft. 2016. A deep relevance matching model for ad-hoc retrieval. In Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, 55\u201364."},{"issue":"6","key":"e_1_3_3_21_2","doi-asserted-by":"crossref","first-page":"102067","DOI":"10.1016\/j.ipm.2019.102067","article-title":"A deep look into neural ranking models for information retrieval","volume":"57","author":"Guo Jiafeng","year":"2020","unstructured":"Jiafeng Guo, Yixing Fan, Liang Pang, Liu Yang, Qingyao Ai, Hamed Zamani, Chen Wu, W. Bruce Croft, and Xueqi Cheng. 2020. A deep look into neural ranking models for information retrieval. Information Processing & Management 57, 6 (2020), 102067.","journal-title":"Information Processing & Management"},{"key":"e_1_3_3_22_2","unstructured":"Geoffrey Hinton Oriol Vinyals and Jeff Dean. 2015. Distilling the knowledge in a neural network. arXiv:1503.02531."},{"key":"e_1_3_3_23_2","doi-asserted-by":"crossref","unstructured":"Thi K. K. Ho and Jeonghwan Gwak. 2020. Utilizing knowledge distillation in deep learning for classification of chest X-ray abnormalities. IEEE Access 8 (2020) 160749\u2013160761.","DOI":"10.1109\/ACCESS.2020.3020802"},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/2866571"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018699"},{"issue":"4","key":"e_1_3_3_26_2","doi-asserted-by":"crossref","first-page":"102962","DOI":"10.1016\/j.ipm.2022.102962","article-title":"ListMAP: Listwise learning to rank as maximum a posteriori estimation","volume":"59","author":"Keshvari Sanaz","year":"2022","unstructured":"Sanaz Keshvari, Faezeh Ensan, and Hadi S. Yazdi. 2022. ListMAP: Listwise learning to rank as maximum a posteriori estimation. Information Processing & Management 59, 4 (2022), 102962.","journal-title":"Information Processing & Management"},{"key":"e_1_3_3_27_2","first-page":"196","volume-title":"Proceedings of the Uncertainty in Artificial Intelligence.","author":"Li Chang","year":"2020","unstructured":"Chang Li, Branislav Kveton, Tor Lattimore, Ilya Markov, Maarten de Rijke, Csaba Szepesv\u00e1ri, and Masrour Zoghi. 2020. BubbleRank: Safe online learning to re-rank via implicit click feedback. In Proceedings of the Uncertainty in Artificial Intelligence. PMLR, 196\u2013206."},{"issue":"4","key":"e_1_3_3_28_2","first-page":"1","article-title":"Midtd: A simple and effective distillation framework for distantly supervised relation extraction","volume":"40","author":"Li Rui","year":"2022","unstructured":"Rui Li, Cheng Yang, Tingwei Li, and Sen Su. 2022. Midtd: A simple and effective distillation framework for distantly supervised relation extraction. ACM Transactions on Information Systems (TOIS) 40, 4 (2022), 1\u201332.","journal-title":"ACM Transactions on Information Systems (TOIS)"},{"issue":"3","key":"e_1_3_3_29_2","first-page":"225","article-title":"Learning to rank for information retrieval","volume":"3","author":"al Tie-Yan Liu et","year":"2009","unstructured":"Tie-Yan Liu et al. 2009. Learning to rank for information retrieval. Foundations and Trends\u00ae in Information Retrieval 3, 3 (2009), 225\u2013331.","journal-title":"Foundations and Trends\u00ae in Information Retrieval"},{"key":"e_1_3_3_30_2","first-page":"700","volume-title":"Proceedings of the 26th ACM International Conference on Multimedia","author":"Liu Yongcheng","year":"2018","unstructured":"Yongcheng Liu, Lu Sheng, Jing Shao, Junjie Yan, Shiming Xiang, and Chunhong Pan. 2018. Multi-label image classification via knowledge distillation from weakly-supervised detection. In Proceedings of the 26th ACM International Conference on Multimedia, 700\u2013708."},{"key":"e_1_3_3_31_2","first-page":"895","volume-title":"Proceedings of the 16th ACM International Conference on Web Search and Data Mining","author":"Luo Dan","year":"2023","unstructured":"Dan Luo, Lixin Zou, Qingyao Ai, Zhiyu Chen, Dawei Yin, and Brian D. Davison. 2023. Model-based unbiased learning to rank. In Proceedings of the 16th ACM International Conference on Web Search and Data Mining, 895\u2013903."},{"key":"e_1_3_3_32_2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.cviu.2017.07.001","article-title":"Simple to complex cross-modal learning to rank","volume":"163","author":"Luo Minnan","year":"2017","unstructured":"Minnan Luo, Xiaojun Chang, Zhihui Li, Liqiang Nie, Alexander G. Hauptmann, and Qinghua Zheng. 2017. Simple to complex cross-modal learning to rank. Computer Vision and Image Understanding 163 (2017), 67\u201377.","journal-title":"Computer Vision and Image Understanding"},{"key":"e_1_3_3_33_2","doi-asserted-by":"crossref","first-page":"2559","DOI":"10.1145\/2396761.2398691","volume-title":"Proceedings of the 21st ACM International Conference on Information and Knowledge Management","author":"Macdonald Craig","year":"2012","unstructured":"Craig Macdonald, Rodrygo L. T. Santos, and Iadh Ounis. 2012. On the usefulness of query features for learning to rank. In Proceedings of the 21st ACM International Conference on Information and Knowledge Management, 2559\u20132562."},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/3539813.3545127"},{"key":"e_1_3_3_35_2","doi-asserted-by":"crossref","first-page":"3416","DOI":"10.1145\/3394486.3403394","volume-title":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","author":"Mehrotra Rishabh","year":"2020","unstructured":"Rishabh Mehrotra and Ashish Gupta. 2020. Learning with limited labels via momentum damped & differentially weighted optimization. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 3416\u20133425."},{"key":"e_1_3_3_36_2","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1145\/2766462.2767753","volume-title":"Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval","author":"Mehrotra Rishabh","year":"2015","unstructured":"Rishabh Mehrotra and Emine Yilmaz. 2015. Representative & informative query selection for learning to rank using submodular functions. In Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, 545\u2013554."},{"key":"e_1_3_3_37_2","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1145\/3397271.3401100","volume-title":"Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval","author":"Morik Marco","year":"2020","unstructured":"Marco Morik, Ashudeep Singh, Jessica Hong, and Thorsten Joachims. 2020. Controlling fairness and bias in dynamic learning-to-rank. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, 429\u2013438."},{"issue":"5","key":"e_1_3_3_38_2","first-page":"4695","article-title":"Distilled neural networks for efficient learning to rank","volume":"35","author":"Nardini Franco Maria","year":"2022","unstructured":"Franco Maria Nardini, Cosimo Rulli, Salvatore Trani, and Rossano Venturini. 2022. Distilled neural networks for efficient learning to rank. IEEE Transactions on Knowledge and Data Engineering 35, 5 (2022), 4695\u20134712.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_3_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401104"},{"key":"e_1_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3409256.3409819"},{"key":"e_1_3_3_41_2","doi-asserted-by":"publisher","DOI":"10.2307\/2346567"},{"key":"e_1_3_3_42_2","doi-asserted-by":"publisher","unstructured":"Przemys\u0142aw Pobrotyn Tomasz Bartczak Miko\u0142aj Synowiec Radosaw Biaobrzeski and Jaros\u0142aw Bojar. 2020. Context-aware learning to rank with self-attention. arXiv:2005.10084. Retrieved from 10.48550\/arXiv.2005.10084","DOI":"10.48550\/arXiv.2005.10084"},{"key":"e_1_3_3_43_2","doi-asserted-by":"publisher","unstructured":"Przemys\u0142aw Pobrotyn and Rados\u0142aw Bia\u0142obrzeski. 2021. NeuralNDCG: Direct optimisation of a ranking metric via differentiable relaxation of sorting. arXiv:2102.07831. Retrieved from 10.48550\/arXiv.2102.07831","DOI":"10.48550\/arXiv.2102.07831"},{"key":"e_1_3_3_44_2","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","volume":"31","author":"Qi Yi","year":"2018","unstructured":"Yi Qi, Qingyun Wu, Hongning Wang, Jie Tang, and Maosong Sun. 2018. Bandit learning with implicit feedback. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 31."},{"key":"e_1_3_3_45_2","doi-asserted-by":"publisher","unstructured":"Tao Qin and Tie-Yan Liu. 2013. Introducing LETOR 4.0 datasets. arXiv:1306.2597. Retrieved from 10.48550\/arXiv.1306.2597","DOI":"10.48550\/arXiv.1306.2597"},{"issue":"4","key":"e_1_3_3_46_2","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10791-009-9124-x","article-title":"A general approximation framework for direct optimization of information retrieval measures","volume":"13","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 13, 4 (2010), 375\u2013397.","journal-title":"Information Retrieval"},{"key":"e_1_3_3_47_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-009-9123-y"},{"key":"e_1_3_3_48_2","doi-asserted-by":"publisher","unstructured":"Zhen Qin Le Yan Yi Tay Honglei Zhuang Xuanhui Wang Michael Bendersky and Marc Najork. 2021. Improving neural ranking via lossless knowledge distillation. arXiv:2109.15285. Retrieved from 10.48550\/arXiv.2109.15285","DOI":"10.48550\/arXiv.2109.15285"},{"key":"e_1_3_3_49_2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1145\/3341981.3344245","volume-title":"Proceedings of the 2019 ACM SIGIR International Conference on Theory Of Information Retrieval","author":"Rahimi Razieh","year":"2019","unstructured":"Razieh Rahimi, Ali Montazeralghaem, and James Allan. 2019. Listwise neural ranking models. In Proceedings of the 2019 ACM SIGIR International Conference on Theory Of Information Retrieval, 101\u2013104."},{"key":"e_1_3_3_50_2","first-page":"2368","volume-title":"Proceedings of the International Conference on Artificial Intelligence and Statistics.","author":"Reddi Sashank","year":"2021","unstructured":"Sashank Reddi, Rama K. Pasumarthi, Aditya Menon, Ankit Singh Rawat, Felix Yu, Seungyeon Kim, Andreas Veit, and Sanjiv Kumar. 2021. Rankdistil: Knowledge distillation for ranking. In Proceedings of the International Conference on Artificial Intelligence and Statistics. PMLR, 2368\u20132376."},{"key":"e_1_3_3_51_2","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/j.ins.2022.04.012","article-title":"How to build high quality L2R training data: unsupervised compression-based selective sampling for learning to rank","volume":"601","author":"Silva Rodrigo M.","year":"2022","unstructured":"Rodrigo M. Silva, Guilherme C. M. Gomes, Mario S. Alvim, and Marcos A. Goncalves. 2022. How to build high quality L2R training data: unsupervised compression-based selective sampling for learning to rank. Information Sciences 601 (2022), 90\u2013113.","journal-title":"Information Sciences"},{"key":"e_1_3_3_52_2","doi-asserted-by":"crossref","first-page":"2289","DOI":"10.1145\/3219819.3220021","volume-title":"Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","author":"Tang Jiaxi","year":"2018","unstructured":"Jiaxi Tang and Ke Wang. 2018. Ranking distillation: Learning compact ranking models with high performance for recommender system. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2289\u20132298."},{"issue":"11","key":"e_1_3_3_53_2","doi-asserted-by":"crossref","first-page":"5251","DOI":"10.1109\/TKDE.2021.3056894","article-title":"Deep bayesian active learning for learning to rank: A case study in answer selection","volume":"34","author":"Wang Qunbo","year":"2021","unstructured":"Qunbo Wang, Wenjun Wu, Yuxing Qi, and Yongchi Zhao. 2021. Deep bayesian active learning for learning to rank: A case study in answer selection. IEEE Transactions on Knowledge and Data Engineering 34, 11 (2021), 5251\u20135262.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_3_54_2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/3578337.3605117","volume-title":"Proceedings of the 2023 ACM SIGIR International Conference on Theory of Information Retrieval","author":"Wang Shuyi","year":"2023","unstructured":"Shuyi Wang and Guido Zuccon. 2023. An analysis of untargeted poisoning attack and defense methods for federated online learning to rank systems. In Proceedings of the 2023 ACM SIGIR International Conference on Theory of Information Retrieval, 215\u2013224."},{"key":"e_1_3_3_55_2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/2911451.2911537","volume-title":"Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval","author":"Wang Xuanhui","year":"2016","unstructured":"Xuanhui Wang, Michael Bendersky, Donald Metzler, and Marc Najork. 2016. Learning to rank with selection bias in personal search. In Proceedings of the 39th International ACM SIGIR Conference on Research and Development in Information Retrieval, 115\u2013124."},{"key":"e_1_3_3_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159732"},{"key":"e_1_3_3_57_2","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/s10791-009-9112-1","article-title":"Adapting boosting for information retrieval measures","volume":"13","author":"Wu Qiang","year":"2010","unstructured":"Qiang Wu, Christopher J. C. Burges, Krysta M. Svore, and Jianfeng Gao. 2010. Adapting boosting for information retrieval measures. Information Retrieval 13 (2010), 254\u2013270.","journal-title":"Information Retrieval"},{"key":"e_1_3_3_58_2","first-page":"1192","volume-title":"Proceedings of the 25th International Conference on Machine Learning","author":"Xia Fen","year":"2008","unstructured":"Fen Xia, Tie-Yan Liu, Jue Wang, Wensheng Zhang, and Hang Li. 2008. Listwise approach to learning to rank: theory and algorithm. In Proceedings of the 25th International Conference on Machine Learning, 1192\u20131199."},{"key":"e_1_3_3_59_2","first-page":"5565","volume-title":"Proceedings of the AAAI Conference on Artificial Intelligence","volume":"33","author":"Xu Ting-Bing","year":"2019","unstructured":"Ting-Bing Xu and Cheng-Lin Liu. 2019. Data-distortion guided self-distillation for deep neural networks. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 33, 5565\u20135572."},{"key":"e_1_3_3_60_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2023.110183"},{"key":"e_1_3_3_61_2","doi-asserted-by":"crossref","unstructured":"George Zerveas Navid Rekabsaz Daniel Cohen and Carsten Eickhoff. 2021. CODER: An efficient framework for improving retrieval through contextual document embedding reranking. arXiv:2112.08766. Retrieved from https:\/\/arxiv.org\/abs\/2112.08766","DOI":"10.18653\/v1\/2022.emnlp-main.727"},{"key":"e_1_3_3_62_2","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1145\/3404835.3462904","volume-title":"Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval","author":"Zhang Chiqun","year":"2021","unstructured":"Chiqun Zhang, Michael R. Evans, Max Lepikhin, and Dragomir Yankov. 2021. Fast attention-based learning-to-rank model for structured map search. In Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, 942\u2013951."},{"key":"e_1_3_3_63_2","first-page":"3713","volume-title":"Proceedings of the IEEE\/CVF International Conference on Computer Vision","author":"Zhang Linfeng","year":"2019","unstructured":"Linfeng Zhang, Jiebo Song, Anni Gao, Jingwei Chen, Chenglong Bao, and Kaisheng Ma. 2019. Be your own teacher: Improve the performance of convolutional neural networks via self distillation. In Proceedings of the IEEE\/CVF International Conference on Computer Vision, 3713\u20133722."},{"key":"e_1_3_3_64_2","first-page":"2184","volume-title":"Proceedings of the Advances in Neural Information Processing Systems","volume":"33","author":"Zhang Zhilu","year":"2020","unstructured":"Zhilu Zhang and Mert Sabuncu. 2020. Self-distillation as instance-specific label smoothing. In Proceedings of the Advances in Neural Information Processing Systems, Vol. 33, 2184\u20132195."},{"key":"e_1_3_3_65_2","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1145\/3219819.3219823","volume-title":"Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","author":"Zhou Guorui","year":"2018","unstructured":"Guorui Zhou, Xiaoqiang Zhu, Chenru Song, Ying Fan, Han Zhu, Xiao Ma, Yanghui Yan, Junqi Jin, Han Li, and Kun Gai. 2018. Deep interest network for click-through rate prediction. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 1059\u20131068."},{"key":"e_1_3_3_66_2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1145\/3471158.3472238","volume-title":"Proceedings of the 2021 ACM SIGIR International Conference on Theory of Information Retrieval","author":"Zhuang Honglei","year":"2021","unstructured":"Honglei Zhuang, Zhen Qin, Shuguang Han, Xuanhui Wang, Michael Bendersky, and Marc Najork. 2021. Ensemble distillation for bert-based ranking models. In Proceedings of the 2021 ACM SIGIR International Conference on Theory of Information Retrieval, 131\u2013136."},{"key":"e_1_3_3_67_2","doi-asserted-by":"crossref","first-page":"3185","DOI":"10.1145\/3539618.3591818","volume-title":"Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval","author":"Zong Yuxuan","year":"2023","unstructured":"Yuxuan Zong and Benjamin Piwowarski. 2023. XpmIR: A modular library for learning to rank and neural IR experiments. In Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval, 3185\u20133189."}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3681784","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3681784","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:02Z","timestamp":1750295402000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3681784"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,22]]},"references-count":66,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,11,30]]}},"alternative-id":["10.1145\/3681784"],"URL":"https:\/\/doi.org\/10.1145\/3681784","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,22]]},"assertion":[{"value":"2023-09-18","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-21","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-10-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}