{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T05:46:44Z","timestamp":1777873604370,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":74,"publisher":"ACM","funder":[{"name":"Zhejiang Province ?JianBingLingYan+X? Research and Development Plan","award":["2025C02020"],"award-info":[{"award-number":["2025C02020"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,8,3]]},"DOI":"10.1145\/3711896.3736866","type":"proceedings-article","created":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T20:52:41Z","timestamp":1754254361000},"page":"3542-3552","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Breaking the Top-\n                    <i>K<\/i>\n                    Barrier: Advancing Top-\n                    <i>K<\/i>\n                    Ranking Metrics Optimization in Recommender Systems"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5750-5515","authenticated-orcid":false,"given":"Weiqin","family":"Yang","sequence":"first","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4752-2629","authenticated-orcid":false,"given":"Jiawei","family":"Chen","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-0209-2276","authenticated-orcid":false,"given":"Shengjia","family":"Zhang","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7154-8880","authenticated-orcid":false,"given":"Peng","family":"Wu","sequence":"additional","affiliation":[{"name":"Beijing Technology and Business University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-2701-4641","authenticated-orcid":false,"given":"Yuegang","family":"Sun","sequence":"additional","affiliation":[{"name":"Intelligence Indeed, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3605-5404","authenticated-orcid":false,"given":"Yan","family":"Feng","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6198-7481","authenticated-orcid":false,"given":"Chun","family":"Chen","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5890-4307","authenticated-orcid":false,"given":"Can","family":"Wang","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]}],"member":"320","published-online":{"date-parts":[[2025,8,3]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2559952"},{"key":"e_1_3_2_2_2_1","volume-title":"Mathematical statistics: basic ideas and selected topics, volumes I-II package","author":"Bickel Peter J","unstructured":"Peter J Bickel and Kjell A Doksum. 2015. Mathematical statistics: basic ideas and selected topics, volumes I-II package. Chapman and Hall\/CRC."},{"key":"e_1_3_2_2_3_1","volume-title":"Accuracy at the top. Advances in neural information processing systems","author":"Boyd Stephen","year":"2012","unstructured":"Stephen Boyd, Corinna Cortes, Mehryar Mohri, and Ana Radovanovic. 2012. Accuracy at the top. Advances in neural information processing systems, Vol. 25 (2012)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3341981.3344221"},{"key":"e_1_3_2_2_5_1","volume-title":"Learning to rank with nonsmooth cost functions. Advances in neural information processing systems","author":"Burges Christopher","year":"2006","unstructured":"Christopher Burges, Robert Ragno, and Quoc Le. 2006. Learning to rank with nonsmooth cost functions. Advances in neural information processing systems, Vol. 19 (2006)."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1201\/9781003456285"},{"key":"e_1_3_2_2_10_1","volume-title":"Gradient descent optimization of smoothed information retrieval metrics. Information retrieval","author":"Chapelle Olivier","year":"2010","unstructured":"Olivier Chapelle and Mingrui Wu. 2010. Gradient descent optimization of smoothed information retrieval metrics. Information retrieval, Vol. 13 (2010), 216-235."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462919"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3522672"},{"key":"e_1_3_2_2_13_1","volume-title":"International conference on machine learning. PMLR, 1597-1607","author":"Chen Ting","year":"2020","unstructured":"Ting Chen, Simon Kornblith, Mohammad Norouzi, and Geoffrey Hinton. 2020. A simple framework for contrastive learning of visual representations. In International conference on machine learning. PMLR, 1597-1607."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020579"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2987380"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591636"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3592100"},{"key":"e_1_3_2_2_18_1","unstructured":"Aditya Grover Eric Wang Aaron Zweig and Stefano Ermon. 2019. Stochastic optimization of sorting networks via continuous relaxations. arXiv preprint arXiv:1903.08850(2019)."},{"key":"e_1_3_2_2_19_1","article-title":"Noise-contrastive estimation of unnormalized statistical models, with applications to natural image statistics","volume":"13","author":"Gutmann Michael U","year":"2012","unstructured":"Michael U Gutmann and Aapo Hyv\u00e4rinen. 2012. Noise-contrastive estimation of unnormalized statistical models, with applications to natural image statistics. Journal of machine learning research, Vol. 13, 2 (2012).","journal-title":"Journal of machine learning research"},{"key":"e_1_3_2_2_20_1","volume-title":"Quantile regression. Number 149","author":"Hao Lingxin","unstructured":"Lingxin Hao and Daniel Q Naiman. 2007. Quantile regression. Number 149. Sage."},{"key":"e_1_3_2_2_21_1","volume-title":"The movielens datasets: History and context. Acm transactions on interactive intelligent systems (tiis)","author":"Maxwell Harper F","year":"2015","unstructured":"F Maxwell Harper and Joseph A Konstan. 2015. The movielens datasets: History and context. Acm transactions on interactive intelligent systems (tiis), Vol. 5, 4 (2015), 1-19."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2872427.2883037"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080777"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06028-6_67"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1944339.1944341"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531849"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3130348.3130374"},{"key":"e_1_3_2_2_31_1","volume-title":"Sur les fonctions convexes et les in\u00e9galit\u00e9s entre les valeurs moyennes. Acta mathematica","author":"William Valdemar Jensen Johan Ludwig","year":"1906","unstructured":"Johan Ludwig William Valdemar Jensen. 1906. Sur les fonctions convexes et les in\u00e9galit\u00e9s entre les valeurs moyennes. Acta mathematica, Vol. 30, 1 (1906), 175-193."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00996"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00035"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.3390\/electronics11010141"},{"key":"e_1_3_2_2_35_1","volume-title":"Quantile Regression Cambridge","author":"Koenker R","unstructured":"R Koenker. 2005. Quantile Regression Cambridge, UK: Cambridge Univ."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403262"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.52202\/075280-0169"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3701551.3703579"},{"key":"e_1_3_2_2_40_1","first-page":"225","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."},{"key":"e_1_3_2_2_41_1","volume-title":"Self-supervised learning: Generative or contrastive","author":"Liu Xiao","year":"2021","unstructured":"Xiao Liu, Fanjin Zhang, Zhenyu Hou, Li Mian, Zhaoyu Wang, Jing Zhang, and Jie Tang. 2021. Self-supervised learning: Generative or contrastive. IEEE transactions on knowledge and data engineering, Vol. 35, 1 (2021), 857-876."},{"key":"e_1_3_2_2_42_1","volume-title":"Individual choice behavior","author":"Luce R Duncan","unstructured":"R Duncan Luce. 1959. Individual choice behavior. Vol. 4. Wiley New York."},{"key":"e_1_3_2_2_43_1","unstructured":"Bodhisattwa Prasad Majumder Shuyang Li Jianmo Ni and Julian McAuley. 2019. Generating personalized recipes from historical user preferences. arXiv preprint arXiv:1909.00105(2019)."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767755"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3343031.3350923"},{"key":"e_1_3_2_2_46_1","unstructured":"Aaron van den Oord Yazhe Li and Oriol Vinyals. 2018. Representation learning with contrastive predictive coding. arXiv preprint arXiv:1807.03748(2018)."},{"key":"e_1_3_2_2_47_1","volume-title":"On estimation of a probability density function and mode. The annals of mathematical statistics","author":"Parzen Emanuel","year":"1962","unstructured":"Emanuel Parzen. 1962. On estimation of a probability density function and mode. The annals of mathematical statistics, Vol. 33, 3 (1962), 1065-1076."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.2307\/2346567"},{"key":"e_1_3_2_2_49_1","volume-title":"Neuralndcg: Direct optimisation of a ranking metric via differentiable relaxation of sorting. arXiv preprint arXiv:2102.07831(2021).","author":"Pobrotyn Przemys\u0142aw","year":"2021","unstructured":"Przemys\u0142aw Pobrotyn and Rados\u0142aw Bia\u0142obrzeski. 2021. Neuralndcg: Direct optimisation of a ranking metric via differentiable relaxation of sorting. arXiv preprint arXiv:2102.07831(2021)."},{"key":"e_1_3_2_2_50_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). http:\/\/arxiv.org\/abs\/1306.2597"},{"key":"e_1_3_2_2_51_1","unstructured":"Zi-Hao Qiu Quanqi Hu Yongjian Zhong Lijun Zhang and Tianbao Yang. 2022. Large-scale stochastic optimization of NDCG surrogates for deep learning with provable convergence. arXiv preprint arXiv:2202.12183(2022)."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462864"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018686"},{"key":"e_1_3_2_2_54_1","volume-title":"Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence. 452-461","author":"Rendle Steffen","year":"2009","unstructured":"Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars Schmidt-Thieme. 2009. BPR: Bayesian personalized ranking from implicit feedback. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence. 452-461."},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"crossref","unstructured":"Herbert Robbins and Sutton Monro. 1951. A stochastic approximation method. The annals of mathematical statistics(1951) 400-407.","DOI":"10.1214\/aoms\/1177729586"},{"key":"e_1_3_2_2_56_1","volume-title":"Collective classification in network data. AI magazine","author":"Sen Prithviraj","year":"2008","unstructured":"Prithviraj Sen, Galileo Namata, Mustafa Bilgic, Lise Getoor, Brian Galligher, and Tina Eliassi-Rad. 2008. Collective classification in network data. AI magazine, Vol. 29, 3 (2008), 93-93."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1058297"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583223"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645371"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"crossref","unstructured":"Xiaoyuan Su. 2009. A Survey of Collaborative Filtering Techniques. (2009).","DOI":"10.1155\/2009\/421425"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645598"},{"key":"e_1_3_2_2_62_1","volume-title":"MSL: Not All Tokens Are What You Need for Tuning LLM as a Recommender. arXiv preprint arXiv:2504.04178(2025).","author":"Wang Bohao","year":"2025","unstructured":"Bohao Wang, Feng Liu, Jiawei Chen, Xingyu Lou, Changwang Zhang, Jun Wang, Yuegang Sun, Yan Feng, Chun Chen, and Can Wang. 2025. MSL: Not All Tokens Are What You Need for Tuning LLM as a Recommender. arXiv preprint arXiv:2504.04178(2025)."},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"crossref","unstructured":"Bohao Wang Feng Liu Changwang Zhang Jiawei Chen Yudi Wu Sheng Zhou Xingyu Lou Jun Wang Yan Feng Chun Chen et al. 2024b. Llm4dsr: Leveraing large language model for denoising sequential recommendation. arXiv preprint arXiv:2408.08208(2024).","DOI":"10.1145\/3762182"},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1017-3"},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462962"},{"key":"e_1_3_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271784"},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3347037"},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE60146.2024.00068"},{"key":"e_1_3_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/3637061"},{"key":"e_1_3_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390306"},{"key":"e_1_3_2_2_71_1","volume-title":"PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for Recommendation. arXiv preprint arXiv:2411.00163(2024).","author":"Yang Weiqin","year":"2024","unstructured":"Weiqin Yang, Jiawei Chen, Xin Xin, Sheng Zhou, Binbin Hu, Yan Feng, Chun Chen, and Can Wang. 2024. PSL: Rethinking and Improving Softmax Loss from Pairwise Perspective for Recommendation. arXiv preprint arXiv:2411.00163(2024)."},{"key":"e_1_3_2_2_72_1","volume-title":"Nguyen Quoc Viet Hung, and Hongzhi Yin","author":"Yu Junliang","year":"2023","unstructured":"Junliang Yu, Xin Xia, Tong Chen, Lizhen Cui, Nguyen Quoc Viet Hung, and Hongzhi Yin. 2023. XSimGCL: Towards extremely simple graph contrastive learning for recommendation. IEEE Transactions on Knowledge and Data Engineering(2023)."},{"key":"e_1_3_2_2_73_1","volume-title":"Advances in Neural Information Processing Systems","volume":"36","author":"Zhang An","year":"2024","unstructured":"An Zhang, Leheng Sheng, Zhibo Cai, Xiang Wang, and Tat-Seng Chua. 2024. Empowering Collaborative Filtering with Principled Adversarial Contrastive Loss. Advances in Neural Information Processing Systems, Vol. 36 (2024)."},{"key":"e_1_3_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313678"}],"event":{"name":"KDD '25: The 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Toronto ON Canada","acronym":"KDD '25","sponsor":["SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3711896.3736866","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T18:05:00Z","timestamp":1777572300000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3711896.3736866"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,3]]},"references-count":74,"alternative-id":["10.1145\/3711896.3736866","10.1145\/3711896"],"URL":"https:\/\/doi.org\/10.1145\/3711896.3736866","relation":{},"subject":[],"published":{"date-parts":[[2025,8,3]]},"assertion":[{"value":"2025-08-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}