{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:15:26Z","timestamp":1755839726290,"version":"3.41.0"},"reference-count":72,"publisher":"Association for Computing Machinery (ACM)","issue":"8","license":[{"start":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T00:00:00Z","timestamp":1722384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62177033"],"award-info":[{"award-number":["62177033"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Huawei Innovation Research Program"},{"name":"Wu Wen Jun Honorary Doctoral Scholarship"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2024,9,30]]},"abstract":"<jats:p>\n            As a critical task for large-scale commercial recommender systems, reranking rearranges items in the initial ranking lists from the previous ranking stage to better meet users\u2019 demands. Foundational work in reranking has shown the potential of improving recommendation results by uncovering mutual influence among items. However, rather than considering the context of initial lists as most existing methods do, an ideal reranking algorithm should consider the\n            <jats:italic>counterfactual context\u2014<\/jats:italic>\n            the position and the alignment of the items in the\n            <jats:italic>reranked lists<\/jats:italic>\n            . In this work, we propose a novel pairwise reranking framework, Utility-oriented Reranking with Counterfactual Context (URCC), which maximizes the overall utility after reranking efficiently. Specifically, we first design a utility-oriented evaluator, which applies Bi-LSTM and graph attention mechanism to estimate the listwise utility via the\n            <jats:italic>counterfactual context<\/jats:italic>\n            modeling. Then, under the guidance of the evaluator, we propose a pairwise reranker model to find the most suitable position for each item by swapping misplaced item pairs. Extensive experiments on two benchmark datasets and a proprietary real-world dataset demonstrate that URCC significantly outperforms the state-of-the-art models in terms of both relevance-based metrics and utility-based metrics.\n          <\/jats:p>","DOI":"10.1145\/3671004","type":"journal-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T15:56:48Z","timestamp":1717516608000},"page":"1-22","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Utility-Oriented Reranking with Counterfactual Context"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6883-881X","authenticated-orcid":false,"given":"Yunjia","family":"Xi","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9148-3997","authenticated-orcid":false,"given":"Weiwen","family":"Liu","sequence":"additional","affiliation":[{"name":"Noah\u2019s Ark Lab, Huawei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3351-5401","authenticated-orcid":false,"given":"Xinyi","family":"Dai","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9224-2431","authenticated-orcid":false,"given":"Ruiming","family":"Tang","sequence":"additional","affiliation":[{"name":"Noah\u2019s Ark Lab, Huawei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9597-4881","authenticated-orcid":false,"given":"Qing","family":"Liu","sequence":"additional","affiliation":[{"name":"Noah\u2019s Ark Lab, Huawei, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0127-2425","authenticated-orcid":false,"given":"Weinan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0281-8271","authenticated-orcid":false,"given":"Yong","family":"Yu","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2024,7,31]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"2020. MindSpore. Retrieved from https:\/\/www.mindspore.cn\/"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3209985"},{"key":"e_1_3_2_4_2","first-page":"470","volume-title":"European Conference on Information Retrieval, Nazli Goharian, Nicola Tonellotto","author":"Baldelli Davide","year":"2024","unstructured":"Davide Baldelli, Junfeng Jiang, Akiko Aizawa, and Paolo Torroni. 2024. TWOLAR: A TWO-Step LLM-Augmented Distillation Method for Passage Reranking. In European Conference on Information Retrieval, Nazli Goharian, Nicola Tonellotto, Yulan He, Aldo Lipani, Graham McDonald, Craig Macdonald, and Iadh Ounis (Eds.), Springer Nature Switzerland, Cham, 470\u2013485."},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","unstructured":"Irwan Bello Sayali Kulkarni Sagar Jain Craig Boutilier Ed Chi Elad Eban Xiyang Luo Alan Mackey and Ofer Meshi. 2018. Seq2Slate: Re-Ranking and Slate Optimization with RNNs. arXiv:1810.02019. Retrieved from https:\/\/doi.org\/10.48550\/arXiv.1810.02019","DOI":"10.48550\/arXiv.1810.02019"},{"key":"e_1_3_2_6_2","first-page":"193","volume-title":"Advances in Neural Information Processing Systems","author":"Burges Christopher","year":"2007","unstructured":"Christopher Burges, Robert Ragno, and Quoc Le. 2007. Learning to Rank with Nonsmooth Cost Functions. In Advances in Neural Information Processing Systems, B. Scholkopf and J. Platt and T. Hoffman (Eds.), 19, MIT Press, 193\u2013200."},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102363"},{"issue":"23","key":"e_1_3_2_8_2","first-page":"81","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-581 (2010), 81.","journal-title":"Learning"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/290941.291025"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","unstructured":"Diego Carraro and Derek Bridge. 2024. Enhancing Recommendation Diversity by Re-Ranking with Large Language Models. arXiv:2401.11506. Retrieved from https:\/\/doi.org\/10.48550\/arXiv.2401.11506","DOI":"10.48550\/arXiv.2401.11506"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599796"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3624918.3625311"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959190"},{"key":"e_1_3_2_15_2","first-page":"641","article-title":"Pranking with Ranking","volume":"14","author":"Crammer Koby","year":"2001","unstructured":"Koby Crammer and Yoram Singer. 2001. Pranking with Ranking. Advances in Neural Information Processing Systems 14, 641\u2013647.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412756"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242610"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390392"},{"key":"e_1_3_2_20_2","first-page":"417","volume-title":"Proceedings of the World Wide Web Conference (WWW \u201919)","author":"Fan Wenqi","year":"2019","unstructured":"Wenqi Fan, Yao Ma, Qing Li, Yuan He, Eric Zhao, Jiliang Tang, and Dawei Yin. 2019. Graph Neural Networks for Social Recommendation. In Proceedings of the World Wide Web Conference (WWW \u201919). 417\u2013426."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","unstructured":"Yufei Feng Yu Gong Fei Sun Junfeng Ge and Wenwu Ou. 2021a. Revisit Recommender System in the Permutation Prospective. arXiv:2102.12057. Retrieved from https:\/\/doi.org\/10.48550\/arXiv.2102.12057","DOI":"10.48550\/arXiv.2102.12057"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","unstructured":"Yufei Feng Binbin Hu Yu Gong Fei Sun Qingwen Liu and Wenwu Ou. 2021b. GRN: Generative Rerank Network for Context-wise Recommendation. arXiv:2104.00860. Retrieved from https:\/\/doi.org\/10.48550\/arXiv.2104.00860","DOI":"10.48550\/arXiv.2104.00860"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1013203451"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9473(01)00065-2"},{"key":"e_1_3_2_25_2","first-page":"249","volume-title":"Proceedings of the 13th International Conference on Artificial Intelligence and Statistics","author":"Glorot Xavier","year":"2010","unstructured":"Xavier Glorot and Yoshua Bengio. 2010. Understanding the Difficulty of Training Deep Feedforward Neural Networks. In Proceedings of the 13th International Conference on Artificial Intelligence and Statistics. JMLR Workshop and Conference Proceedings, 249\u2013256."},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/2843948"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557065"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412700"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-46661-8_12"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3098898"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","unstructured":"Meng Jiang Keqin Bao Jizhi Zhang Wenjie Wang Zhengyi Yang Fuli Feng and Xiangnan He. 2024. Item-Side Fairness of Large Language Model-Based Recommendation System. arXiv:2402.15215. Retrieved from https:\/\/doi.org\/10.48550\/arXiv.2402.15215","DOI":"10.48550\/arXiv.2402.15215"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150429"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3130332.3130334"},{"key":"e_1_3_2_36_2","first-page":"1","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Kingma Diederik P.","year":"2014","unstructured":"Diederik P. Kingma and Jimmy Ba. 2014. Adam: A Method for Stochastic Optimization. In Proceedings of the International Conference on Learning Representations, 1\u201315."},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009937"},{"key":"e_1_3_2_38_2","first-page":"897","volume-title":"Advances in Neural Information Processing Systems","author":"Li Ping","year":"2007","unstructured":"Ping Li, Christopher Burges, and Qiang Wu. 2007. McRank: Learning to Rank Using Multiple Classification and Gradient Boosting. In Advances in Neural Information Processing Systems, J. Platt and D. Koller and Y. Singer and S. Roweis (Eds.), Vol. 20. MIT Press, 897\u2013904."},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/3487553.3524208"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512109"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539130"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3208633"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599364"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412332"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00067"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2022\/771"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4398"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.5555\/1364846.1364849"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2005.10.001"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","unstructured":"Xueguang Ma Xinyu Zhang Ronak Pradeep and Jimmy Lin. 2023. Zero-Shot Listwise Document Reranking with a Large Language Model. arXiv:2305.02156. Retrieved from https:\/\/doi.org\/10.48550\/arXiv.2305.02156","DOI":"10.48550\/arXiv.2305.02156"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531959"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.3389\/fcomp.2019.00002"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401104"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3347000"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1145\/3603781.3603836"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3498403"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570380"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242643"},{"issue":"3","key":"e_1_3_2_59_2","doi-asserted-by":"crossref","first-page":"183343","DOI":"10.1007\/s11704-024-3803-z","article-title":"XGCN: A Library for Large-Scale Graph Neural network Recommendations","volume":"18","author":"Song Xiran","year":"2024","unstructured":"Xiran Song, Hong Huang, Jianxun Lian, and Hai Jin. 2024. XGCN: A Library for Large-Scale Graph Neural network Recommendations. Frontiers of Computer Science 18, 3 (2024), 183343.","journal-title":"Frontiers of Computer Science"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341544"},{"key":"e_1_3_2_61_2","first-page":"10","article-title":"Graph Attention Networks","volume":"20","author":"Velickovic Petar","year":"2017","unstructured":"Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph Attention Networks. stat 1050, 20 (2017), 10\u201348550.","journal-title":"stat"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271784"},{"key":"e_1_3_2_63_2","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570399"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599878"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3532026"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390306"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i5.16580"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583296"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277809"},{"key":"e_1_3_2_70_2","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599869"},{"key":"e_1_3_2_71_2","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3084154"},{"key":"e_1_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277792"},{"key":"e_1_3_2_73_2","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219823"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3671004","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3671004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:09:55Z","timestamp":1750295395000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3671004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,31]]},"references-count":72,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2024,9,30]]}},"alternative-id":["10.1145\/3671004"],"URL":"https:\/\/doi.org\/10.1145\/3671004","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2024,7,31]]},"assertion":[{"value":"2022-08-16","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-05-24","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-31","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}