{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:19:23Z","timestamp":1779175163785,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":39,"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"}],"funder":[{"name":"National Natural Science Foundation of China","award":["62177033"],"award-info":[{"award-number":["62177033"]}]},{"name":"Shanghai Artificial Intelligence Innovation and Development Fund","award":["2020-RGZN-02026"],"award-info":[{"award-number":["2020-RGZN-02026"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,10,21]]},"DOI":"10.1145\/3583780.3615031","type":"proceedings-article","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T07:45:42Z","timestamp":1697874342000},"page":"1004-1013","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Replace Scoring with Arrangement: A Contextual Set-to-Arrangement Framework for Learning-to-Rank"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6458-1586","authenticated-orcid":false,"given":"Jiarui","family":"Jin","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9368-9526","authenticated-orcid":false,"given":"Xianyu","family":"Chen","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"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"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4175-8398","authenticated-orcid":false,"given":"Mengyue","family":"Yang","sequence":"additional","affiliation":[{"name":"University College London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6125-183X","authenticated-orcid":false,"given":"Yang","family":"Wang","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5683-2621","authenticated-orcid":false,"given":"Yali","family":"Du","sequence":"additional","affiliation":[{"name":"King's College London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"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"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4021-4228","authenticated-orcid":false,"given":"Jun","family":"Wang","sequence":"additional","affiliation":[{"name":"University College London, London, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,10,21]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Qingyao Ai Keping Bi Jiafeng Guo and W Bruce Croft. 2018. Learning a deep listwise context model for ranking refinement. In SIGIR.  Qingyao Ai Keping Bi Jiafeng Guo and W Bruce Croft. 2018. Learning a deep listwise context model for ranking refinement. In SIGIR."},{"key":"e_1_3_2_1_2_1","volume-title":"Xiyang Luo, Alan Mackey, and Ofer Meshi.","author":"Bello Irwan","year":"2018","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 preprint arXiv:1810.02019 (2018). 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 preprint arXiv:1810.02019 (2018)."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Chris Burges Tal Shaked Erin Renshaw Ari Lazier Matt Deeds Nicole Hamilton and Greg Hullender. 2005. Learning to rank using gradient descent. In ICML.  Chris Burges Tal Shaked Erin Renshaw Ari Lazier Matt Deeds Nicole Hamilton and Greg Hullender. 2005. Learning to rank using gradient descent. In ICML.","DOI":"10.1145\/1102351.1102363"},{"key":"e_1_3_2_1_4_1","volume-title":"From ranknet to lambdarank to lambdamart: An overview. Learning","author":"Burges Christopher JC","year":"2010","unstructured":"Christopher JC Burges . 2010. From ranknet to lambdarank to lambdamart: An overview. Learning ( 2010 ). Christopher JC Burges. 2010. From ranknet to lambdarank to lambdamart: An overview. Learning (2010)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","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 ICML.  Zhe Cao Tao Qin Tie-Yan Liu Ming-Feng Tsai and Hang Li. 2007. Learning to rank: from pairwise approach to listwise approach. In ICML.","DOI":"10.1145\/1273496.1273513"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the learning to rank challenge. 1--24","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. 1--24 . Olivier Chapelle and Yi Chang. 2011. Yahoo! learning to rank challenge overview. In Proceedings of the learning to rank challenge. 1--24."},{"key":"e_1_3_2_1_7_1","volume-title":"Click models for web search. Synthesis lectures on information concepts, retrieval, and services 7, 3","author":"Chuklin Aleksandr","year":"2015","unstructured":"Aleksandr Chuklin , Ilya Markov , and Maarten de Rijke . 2015. Click models for web search. Synthesis lectures on information concepts, retrieval, and services 7, 3 ( 2015 ), 1--115. Aleksandr Chuklin, Ilya Markov, and Maarten de Rijke. 2015. Click models for web search. Synthesis lectures on information concepts, retrieval, and services 7, 3 (2015), 1--115."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412756"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873781.1873815"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Georges E Dupret and Benjamin Piwowarski. 2008. A user browsing model to predict search engine click data from past observations.. In SIGIR.  Georges E Dupret and Benjamin Piwowarski. 2008. A user browsing model to predict search engine click data from past observations.. In SIGIR.","DOI":"10.1145\/1390334.1390392"},{"key":"e_1_3_2_1_11_1","volume-title":"Greedy function approximation: a gradient boosting machine. Annals of statistics","author":"Friedman Jerome H","year":"2001","unstructured":"Jerome H Friedman . 2001. Greedy function approximation: a gradient boosting machine. Annals of statistics ( 2001 ), 1189--1232. Jerome H Friedman. 2001. Greedy function approximation: a gradient boosting machine. Annals of statistics (2001), 1189--1232."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553423"},{"key":"e_1_3_2_1_13_1","unstructured":"Huifeng Guo Ruiming Tang Yunming Ye Zhenguo Li and Xiuqiang He. 2017. DeepFM: a factorization-machine based neural network for CTR prediction. In IJCAI.  Huifeng Guo Ruiming Tang Yunming Ye Zhenguo Li and Xiuqiang He. 2017. DeepFM: a factorization-machine based neural network for CTR prediction. In IJCAI."},{"key":"e_1_3_2_1_14_1","volume-title":"Session-based recommendations with recurrent neural networks. ICLR","author":"Hidasi Bal\u00e1zs","year":"2015","unstructured":"Bal\u00e1zs Hidasi , Alexandros Karatzoglou , Linas Baltrunas , and Domonkos Tikk . 2015. Session-based recommendations with recurrent neural networks. ICLR ( 2015 ). Bal\u00e1zs Hidasi, Alexandros Karatzoglou, Linas Baltrunas, and Domonkos Tikk. 2015. Session-based recommendations with recurrent neural networks. ICLR (2015)."},{"key":"e_1_3_2_1_15_1","volume-title":"Long short-term memory. Neural computation 9, 8","author":"Hochreiter Sepp","year":"1997","unstructured":"Sepp Hochreiter and J\u00fcrgen Schmidhuber . 1997. Long short-term memory. Neural computation 9, 8 ( 1997 ), 1735--1780. Sepp Hochreiter and J\u00fcrgen Schmidhuber. 1997. Long short-term memory. Neural computation 9, 8 (1997), 1735--1780."},{"key":"e_1_3_2_1_16_1","volume-title":"MM algorithms for generalized Bradley-Terry models. The annals of statistics","author":"Hunter David R","year":"2004","unstructured":"David R Hunter . 2004. MM algorithms for generalized Bradley-Terry models. The annals of statistics ( 2004 ). David R Hunter. 2004. MM algorithms for generalized Bradley-Terry models. The annals of statistics (2004)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Thorsten Joachims. 2002. Optimizing search engines using clickthrough data. In KDD.  Thorsten Joachims. 2002. Optimizing search engines using clickthrough data. In KDD.","DOI":"10.1145\/775047.775067"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Thorsten Joachims. 2006. Training linear SVMs in linear time. In KDD.  Thorsten Joachims. 2006. Training linear SVMs in linear time. In KDD.","DOI":"10.1145\/1150402.1150429"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Thorsten Joachims Laura Granka Bing Pan Helene Hembrooke and Geri Gay. 2017. Accurately interpreting clickthrough data as implicit feedback. In SIGIR.  Thorsten Joachims Laura Granka Bing Pan Helene Hembrooke and Geri Gay. 2017. Accurately interpreting clickthrough data as implicit feedback. In SIGIR.","DOI":"10.1145\/3130332.3130334"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Thorsten Joachims Laura A Granka Bing Pan Helene Hembrooke and Geri Gay. 2005. Accurately interpreting clickthrough data as implicit feedback. In SIGIR.  Thorsten Joachims Laura A Granka Bing Pan Helene Hembrooke and Geri Gay. 2005. Accurately interpreting clickthrough data as implicit feedback. In SIGIR.","DOI":"10.1145\/1076034.1076063"},{"key":"e_1_3_2_1_21_1","unstructured":"Juho Lee Yoonho Lee Jungtaek Kim Adam Kosiorek Seungjin Choi and Yee Whye Teh. 2019. Set transformer: A framework for attention-based permutation-invariant neural networks. In ICML.  Juho Lee Yoonho Lee Jungtaek Kim Adam Kosiorek Seungjin Choi and Yee Whye Teh. 2019. Set transformer: A framework for attention-based permutation-invariant neural networks. In ICML."},{"key":"e_1_3_2_1_22_1","unstructured":"Tie-Yan Liu. 2011. Learning to rank for information retrieval. (2011).  Tie-Yan Liu. 2011. Learning to rank for information retrieval. (2011)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401104"},{"key":"e_1_3_2_1_24_1","volume-title":"The analysis of permutations. Journal of the Royal Statistical Society: Series C (Applied Statistics)","author":"Plackett Robin L","year":"1975","unstructured":"Robin L Plackett . 1975. The analysis of permutations. Journal of the Royal Statistical Society: Series C (Applied Statistics) ( 1975 ). Robin L Plackett. 1975. The analysis of permutations. Journal of the Royal Statistical Society: Series C (Applied Statistics) (1975)."},{"key":"e_1_3_2_1_25_1","volume":"201","author":"Qi Charles R","unstructured":"Charles R Qi , Hao Su , Kaichun Mo , and Leonidas J Guibas. 201 7. Pointnet: Deep learning on point sets for 3d classification and segmentation. In CVPR. Charles R Qi, Hao Su, Kaichun Mo, and Leonidas J Guibas. 2017. Pointnet: Deep learning on point sets for 3d classification and segmentation. In CVPR.","journal-title":"Leonidas J Guibas."},{"key":"e_1_3_2_1_26_1","volume-title":"LETOR: A benchmark collection for research on learning to rank for information retrieval. Information Retrieval","author":"Qin Tao","year":"2010","unstructured":"Tao Qin , Tie-Yan Liu , Jun Xu , and Hang Li . 2010 . LETOR: A benchmark collection for research on learning to rank for information retrieval. Information Retrieval (2010). Tao Qin, Tie-Yan Liu, Jun Xu, and Hang Li. 2010. LETOR: A benchmark collection for research on learning to rank for information retrieval. Information Retrieval (2010)."},{"key":"e_1_3_2_1_27_1","unstructured":"Yanru Qu Han Cai Kan Ren Weinan Zhang Yong Yu Ying Wen and Jun Wang. 2016. Product-based neural networks for user response prediction. In ICDM.  Yanru Qu Han Cai Kan Ren Weinan Zhang Yong Yu Ying Wen and Jun Wang. 2016. Product-based neural networks for user response prediction. In ICDM."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Steffen Rendle. 2010. Factorization machines. In ICDM.  Steffen Rendle. 2010. Factorization machines. In ICDM.","DOI":"10.1109\/ICDM.2010.127"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Matthew Richardson Ewa Dominowska and Robert Ragno. 2007. Predicting clicks: estimating the click-through rate for new ads. In WWW.  Matthew Richardson Ewa Dominowska and Robert Ragno. 2007. Predicting clicks: estimating the click-through rate for new ads. In WWW.","DOI":"10.1145\/1242572.1242643"},{"key":"e_1_3_2_1_30_1","volume-title":"The probability ranking principle in IR. Journal of documentation","author":"Robertson Stephen E","year":"1977","unstructured":"Stephen E Robertson . 1977. The probability ranking principle in IR. Journal of documentation ( 1977 ). Stephen E Robertson. 1977. The probability ranking principle in IR. Journal of documentation (1977)."},{"key":"e_1_3_2_1_31_1","volume-title":"A re-evaluation of knowledge graph completion methods. ACL","author":"Sun Zhiqing","year":"2019","unstructured":"Zhiqing Sun , Shikhar Vashishth , Soumya Sanyal , Partha Talukdar , and Yiming Yang . 2019. A re-evaluation of knowledge graph completion methods. ACL ( 2019 ). Zhiqing Sun, Shikhar Vashishth, Soumya Sanyal, Partha Talukdar, and Yiming Yang. 2019. A re-evaluation of knowledge graph completion methods. ACL (2019)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Michael Taylor John Guiver Stephen Robertson and Tom Minka. 2008. Softrank: optimizing non-smooth rank metrics. In WSDM.  Michael Taylor John Guiver Stephen Robertson and Tom Minka. 2008. Softrank: optimizing non-smooth rank metrics. In WSDM.","DOI":"10.1145\/1341531.1341544"},{"key":"e_1_3_2_1_33_1","unstructured":"Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N Gomez Lukasz Kaiser and Illia Polosukhin. 2017. Attention is all you need. In NIPS.  Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N Gomez Lukasz Kaiser and Illia Polosukhin. 2017. Attention is all you need. In NIPS."},{"key":"e_1_3_2_1_34_1","volume-title":"Pointer networks. arXiv preprint arXiv:1506.03134","author":"Vinyals Oriol","year":"2015","unstructured":"Oriol Vinyals , Meire Fortunato , and Navdeep Jaitly . 2015. Pointer networks. arXiv preprint arXiv:1506.03134 ( 2015 ). Oriol Vinyals, Meire Fortunato, and Navdeep Jaitly. 2015. Pointer networks. arXiv preprint arXiv:1506.03134 (2015)."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Fen Xia Tie-Yan Liu Jue Wang Wensheng Zhang and Hang Li. 2008. Listwise approach to learning to rank: theory and algorithm. In ICML.  Fen Xia Tie-Yan Liu Jue Wang Wensheng Zhang and Hang Li. 2008. Listwise approach to learning to rank: theory and algorithm. In ICML.","DOI":"10.1145\/1390156.1390306"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Emine Yilmaz Manisha Verma Nick Craswell Filip Radlinski and Peter Bailey. 2014. Relevance and effort: An analysis of document utility. In CIKM.  Emine Yilmaz Manisha Verma Nick Craswell Filip Radlinski and Peter Bailey. 2014. Relevance and effort: An analysis of document utility. In CIKM.","DOI":"10.1145\/2661829.2661953"},{"key":"e_1_3_2_1_37_1","volume-title":"Deep sets. arXiv preprint arXiv:1703.06114","author":"Zaheer Manzil","year":"2017","unstructured":"Manzil Zaheer , Satwik Kottur , Siamak Ravanbakhsh , Barnabas Poczos , Ruslan Salakhutdinov , and Alexander Smola . 2017. Deep sets. arXiv preprint arXiv:1703.06114 ( 2017 ). Manzil Zaheer, Satwik Kottur, Siamak Ravanbakhsh, Barnabas Poczos, Ruslan Salakhutdinov, and Alexander Smola. 2017. Deep sets. arXiv preprint arXiv:1703.06114 (2017)."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Guorui Zhou Na Mou Ying Fan Qi Pi Weijie Bian Chang Zhou Xiaoqiang Zhu and Kun Gai. 2019. Deep interest evolution network for click-through rate prediction. In AAAI.  Guorui Zhou Na Mou Ying Fan Qi Pi Weijie Bian Chang Zhou Xiaoqiang Zhu and Kun Gai. 2019. Deep interest evolution network for click-through rate prediction. In AAAI.","DOI":"10.1609\/aaai.v33i01.33015941"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","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 KDD.  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 KDD.","DOI":"10.1145\/3219819.3219823"}],"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.3615031","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583780.3615031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:36:55Z","timestamp":1750178215000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583780.3615031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,21]]},"references-count":39,"alternative-id":["10.1145\/3583780.3615031","10.1145\/3583780"],"URL":"https:\/\/doi.org\/10.1145\/3583780.3615031","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"}}]}}