{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T18:22:29Z","timestamp":1775586149460,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","funder":[{"name":"Science and Technology Projects in Liaoning Province","award":["2023JH3\/10200005"],"award-info":[{"award-number":["2023JH3\/10200005"]}]},{"name":"National Natural Science Foundation of China","award":["62032013, 62102074"],"award-info":[{"award-number":["62032013, 62102074"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,13]]},"DOI":"10.1145\/3726302.3729943","type":"proceedings-article","created":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T01:18:36Z","timestamp":1752455916000},"page":"1466-1475","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Data Augmentation as Free Lunch: Exploring the Test-Time Augmentation for Sequential Recommendation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7402-4553","authenticated-orcid":false,"given":"Yizhou","family":"Dang","sequence":"first","affiliation":[{"name":"Software College, Software College, Northeastern University, Shenyang, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0774-0007","authenticated-orcid":false,"given":"Yuting","family":"Liu","sequence":"additional","affiliation":[{"name":"Software College, Northeastern University, Shenyang, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5419-5286","authenticated-orcid":false,"given":"Enneng","family":"Yang","sequence":"additional","affiliation":[{"name":"Software College, Northeastern University, Shenyang, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-9916-0763","authenticated-orcid":false,"given":"Minhan","family":"Huang","sequence":"additional","affiliation":[{"name":"Software College, Northeastern University, Shenyang, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1709-5056","authenticated-orcid":false,"given":"Guibing","family":"Guo","sequence":"additional","affiliation":[{"name":"Software College, Northeastern University, Shenyang, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4492-5075","authenticated-orcid":false,"given":"Jianzhe","family":"Zhao","sequence":"additional","affiliation":[{"name":"Software College, Northeastern University, Shenyang, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2856-4716","authenticated-orcid":false,"given":"Xingwei","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Northeastern University, Shenyang, China"}]}],"member":"320","published-online":{"date-parts":[[2025,7,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Xu Chen Hongteng Xu Yongfeng Zhang Jiaxi Tang Yixin Cao Zheng Qin and Hongyuan Zha. 2018. Sequential recommendation with user memory networks. In WSDM. 108--116.","DOI":"10.1145\/3159652.3159668"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Yizhou Dang Yuting Liu Enneng Yang Guibing Guo Linying Jiang Xingwei Wang and Jianzhe Zhao. 2024a. Repeated Padding for Sequential Recommendation. In RecSys. 497--506.","DOI":"10.1145\/3640457.3688110"},{"key":"e_1_3_2_1_3_1","volume-title":"TiCoSeRec: Augmenting data to uniform sequences by time intervals for effective recommendation. TKDE","author":"Dang Yizhou","year":"2023","unstructured":"Yizhou Dang, Enneng Yang, Guibing Guo, Linying Jiang, Xingwei Wang, Xiaoxiao Xu, Qinghui Sun, and Hong Liu. 2023a. TiCoSeRec: Augmenting data to uniform sequences by time intervals for effective recommendation. TKDE (2023)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Yizhou Dang Enneng Yang Guibing Guo Linying Jiang Xingwei Wang Xiaoxiao Xu Qinghui Sun and Hong Liu. 2023b. Uniform sequence better: Time interval aware data augmentation for sequential recommendation. In AAAI.","DOI":"10.1609\/aaai.v37i4.25540"},{"key":"e_1_3_2_1_5_1","volume-title":"Data Augmentation for Sequential Recommendation: A Survey. arXiv preprint arXiv:2409.13545","author":"Dang Yizhou","year":"2024","unstructured":"Yizhou Dang, Enneng Yang, Yuting Liu, Guibing Guo, Linying Jiang, Jianzhe Zhao, and Xingwei Wang. 2024b. Data Augmentation for Sequential Recommendation: A Survey. arXiv preprint arXiv:2409.13545 (2024)."},{"key":"e_1_3_2_1_6_1","volume-title":"Augmenting Sequential Recommendation with Balanced Relevance and Diversity. arXiv preprint arXiv:2412.08300","author":"Dang Yizhou","year":"2024","unstructured":"Yizhou Dang, Jiahui Zhang, Yuting Liu, Enneng Yang, Yuliang Liang, Guibing Guo, Jianzhe Zhao, and Xingwei Wang. 2024c. Augmenting Sequential Recommendation with Balanced Relevance and Diversity. arXiv preprint arXiv:2412.08300 (2024)."},{"key":"e_1_3_2_1_7_1","volume-title":"Xing Xie, and Ji-Rong Wen.","author":"Fan Xinyan","year":"2021","unstructured":"Xinyan Fan, Zheng Liu, Jianxun Lian, Wayne Xin Zhao, Xing Xie, and Ji-Rong Wen. 2021. Lighter and better: low-rank decomposed self-attention networks for next-item recommendation. In SIGIR. 1733--1737."},{"key":"e_1_3_2_1_8_1","volume-title":"Explaining and harnessing adversarial examples. arXiv preprint arXiv:1412.6572","author":"Goodfellow Ian J","year":"2014","unstructured":"Ian J Goodfellow. 2014. Explaining and harnessing adversarial examples. arXiv preprint arXiv:1412.6572 (2014)."},{"key":"e_1_3_2_1_9_1","volume-title":"Fusing similarity models with markov chains for sparse sequential recommendation","author":"He Ruining","unstructured":"Ruining He and Julian McAuley. 2016. Fusing similarity models with markov chains for sparse sequential recommendation. In ICDM. IEEE, 191--200."},{"key":"e_1_3_2_1_10_1","volume-title":"Session-based recommendations with recurrent neural networks. arXiv preprint arXiv:1511.06939","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. arXiv preprint arXiv:1511.06939 (2015)."},{"key":"e_1_3_2_1_11_1","volume-title":"Empowering graph representation learning with test-time graph transformation. ICLR","author":"Jin Wei","year":"2023","unstructured":"Wei Jin, Tong Zhao, Jiayuan Ding, Yozen Liu, Jiliang Tang, and Neil Shah. 2023. Empowering graph representation learning with test-time graph transformation. ICLR (2023)."},{"key":"e_1_3_2_1_12_1","volume-title":"How Does Message Passing Improve Collaborative Filtering? arXiv preprint arXiv:2404.08660","author":"Ju Mingxuan","year":"2024","unstructured":"Mingxuan Ju, William Shiao, Zhichun Guo, Yanfang Ye, Yozen Liu, Neil Shah, and Tong Zhao. 2024a. How Does Message Passing Improve Collaborative Filtering? arXiv preprint arXiv:2404.08660 (2024)."},{"key":"e_1_3_2_1_13_1","volume-title":"NIPS","volume":"36","author":"Ju Mingxuan","year":"2024","unstructured":"Mingxuan Ju, Tong Zhao, Wenhao Yu, Neil Shah, and Yanfang Ye. 2024b. GRAPHPATCHER: mitigating degree bias for graph neural networks via test-time augmentation. NIPS, Vol. 36 (2024)."},{"key":"e_1_3_2_1_14_1","volume-title":"Self-attentive sequential recommendation","author":"Kang Wang-Cheng","unstructured":"Wang-Cheng Kang and Julian McAuley. 2018. Self-attentive sequential recommendation. In ICDM. IEEE, 197--206."},{"key":"e_1_3_2_1_15_1","first-page":"4163","article-title":"Learning loss for test-time augmentation","volume":"33","author":"Kim Ildoo","year":"2020","unstructured":"Ildoo Kim, Younghoon Kim, and Sungwoong Kim. 2020. Learning loss for test-time augmentation. NIPS, Vol. 33 (2020), 4163--4174.","journal-title":"NIPS"},{"key":"e_1_3_2_1_16_1","volume-title":"Understanding test-time augmentation","author":"Kimura Masanari","unstructured":"Masanari Kimura. 2021. Understanding test-time augmentation. In ICNIP. Springer, 558--569."},{"key":"e_1_3_2_1_17_1","volume-title":"Test-Time Augmentation Meets Variational Bayes. arXiv preprint arXiv:2409.12587","author":"Kimura Masanari","year":"2024","unstructured":"Masanari Kimura and Howard Bondell. 2024. Test-Time Augmentation Meets Variational Bayes. arXiv preprint arXiv:2409.12587 (2024)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Walid Krichene and Steffen Rendle. 2020. On sampled metrics for item recommendation. In KDD. 1748--1757.","DOI":"10.1145\/3394486.3403226"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Jing Li Pengjie Ren Zhumin Chen Zhaochun Ren Tao Lian and Jun Ma. 2017. Neural attentive session-based recommendation. In CIKM. 1419--1428.","DOI":"10.1145\/3132847.3132926"},{"key":"e_1_3_2_1_20_1","first-page":"5124","article-title":"Noisy recurrent neural networks","volume":"34","author":"Lim Soon Hoe","year":"2021","unstructured":"Soon Hoe Lim, N Benjamin Erichson, Liam Hodgkinson, and Michael W Mahoney. 2021. Noisy recurrent neural networks. NIPS, Vol. 34 (2021), 5124--5137.","journal-title":"NIPS"},{"key":"e_1_3_2_1_21_1","unstructured":"Jianghao Lin Xinyi Dai Yunjia Xi Weiwen Liu Bo Chen Hao Zhang Yong Liu Chuhan Wu Xiangyang Li Chenxu Zhu et al. 2023. How can recommender systems benefit from large language models: A survey. arXiv preprint arXiv:2306.05817 (2023)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Qidong Liu Fan Yan Xiangyu Zhao Zhaocheng Du Huifeng Guo Ruiming Tang and Feng Tian. 2023. Diffusion augmentation for sequential recommendation. In CIKM. 1576--1586.","DOI":"10.1145\/3583780.3615134"},{"key":"e_1_3_2_1_23_1","volume-title":"CoRA: Collaborative Information Perception by Large Language Model's Weights for Recommendation. arXiv preprint arXiv:2408.10645","author":"Liu Yuting","year":"2024","unstructured":"Yuting Liu, Jinghao Zhang, Yizhou Dang, Yuliang Liang, Qiang Liu, Guibing Guo, Jianzhe Zhao, and Xingwei Wang. 2024. CoRA: Collaborative Information Perception by Large Language Model's Weights for Recommendation. arXiv preprint arXiv:2408.10645 (2024)."},{"key":"e_1_3_2_1_24_1","volume-title":"Contrastive self-supervised sequential recommendation with robust augmentation. arXiv preprint arXiv:2108.06479","author":"Liu Zhiwei","year":"2021","unstructured":"Zhiwei Liu, Yongjun Chen, Jia Li, Philip S Yu, Julian McAuley, and Caiming Xiong. 2021a. Contrastive self-supervised sequential recommendation with robust augmentation. arXiv preprint arXiv:2108.06479 (2021)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Zhiwei Liu Ziwei Fan Yu Wang and Philip S Yu. 2021b. Augmenting sequential recommendation with pseudo-prior items via reversely pre-training transformer. In SIGIR. 1608--1612.","DOI":"10.1145\/3404835.3463036"},{"key":"e_1_3_2_1_26_1","unstructured":"Alexander Lyzhov Yuliya Molchanova Arsenii Ashukha Dmitry Molchanov and Dmitry Vetrov. 2020. Greedy policy search: A simple baseline for learnable test-time augmentation. In UAI. PMLR 1308--1317."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Julian McAuley Rahul Pandey and Jure Leskovec. 2015. Inferring networks of substitutable and complementary products. In KDD. 785--794.","DOI":"10.1145\/2783258.2783381"},{"key":"e_1_3_2_1_28_1","volume-title":"CmnRec: Sequential Recommendations with Chunk-accelerated Memory Network. TKDE","author":"Qu Shilin","year":"2022","unstructured":"Shilin Qu, Fajie Yuan, Guibing Guo, Liguang Zhang, and Wei Wei. 2022. CmnRec: Sequential Recommendations with Chunk-accelerated Memory Network. TKDE (2022)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Zhaochun Ren Na Huang Yidan Wang Pengjie Ren Jun Ma Jiahuan Lei Xinlei Shi Hengliang Luo Joemon Jose and Xin Xin. 2023. Contrastive state augmentations for reinforcement learning-based recommender systems. In SIGIR. 922--931.","DOI":"10.1145\/3539618.3591656"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Steffen Rendle Christoph Freudenthaler and Lars Schmidt-Thieme. 2010. Factorizing personalized markov chains for next-basket recommendation. In WWW. 811--820.","DOI":"10.1145\/1772690.1772773"},{"key":"e_1_3_2_1_31_1","volume-title":"When and why test-time augmentation works. arXiv preprint arXiv:2011.11156","author":"Shanmugam Divya","year":"2020","unstructured":"Divya Shanmugam, Davis Blalock, Guha Balakrishnan, and John Guttag. 2020. When and why test-time augmentation works. arXiv preprint arXiv:2011.11156 (2020)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Divya Shanmugam Davis Blalock Guha Balakrishnan and John Guttag. 2021. Better aggregation in test-time augmentation. In ICCV. 1214--1223.","DOI":"10.1109\/ICCV48922.2021.00125"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Fei Sun Jun Liu Jian Wu Changhua Pei Xiao Lin Wenwu Ou and Peng Jiang. 2019. BERT4Rec: Sequential recommendation with bidirectional encoder representations from transformer. In CIKM. 1441--1450.","DOI":"10.1145\/3357384.3357895"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Jiaxi Tang and Ke Wang. 2018. Personalized top-n sequential recommendation via convolutional sequence embedding. In WSDM. 565--573.","DOI":"10.1145\/3159652.3159656"},{"key":"e_1_3_2_1_35_1","volume-title":"Attention is all you need. NIPS","author":"Vaswani A","year":"2017","unstructured":"A Vaswani. 2017. Attention is all you need. NIPS (2017)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2019.01.103"},{"key":"e_1_3_2_1_37_1","volume-title":"Wayne Xin Zhao, and Ji-Rong Wen","author":"Wang Zhenlei","year":"2021","unstructured":"Zhenlei Wang, Jingsen Zhang, Hongteng Xu, Xu Chen, Yongfeng Zhang, Wayne Xin Zhao, and Ji-Rong Wen. 2021. Counterfactual data-augmented sequential recommendation. In SIGIR. 347--356."},{"key":"e_1_3_2_1_38_1","volume-title":"Contrastive learning for sequential recommendation","author":"Xie Xu","unstructured":"Xu Xie, Fei Sun, Zhaoyang Liu, Shiwen Wu, Jinyang Gao, Jiandong Zhang, Bolin Ding, and Bin Cui. 2022. Contrastive learning for sequential recommendation. In ICDE. IEEE, 1259--1273."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"Junliang Yu Hongzhi Yin Xin Xia Tong Chen Lizhen Cui and Quoc Viet Hung Nguyen. 2022. Are graph augmentations necessary? simple graph contrastive learning for recommendation. In SIGIR. 1294--1303.","DOI":"10.1145\/3477495.3531937"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Fajie Yuan Alexandros Karatzoglou Ioannis Arapakis Joemon M Jose and Xiangnan He. 2019. A simple convolutional generative network for next item recommendation. In WSDM. 582--590.","DOI":"10.1145\/3289600.3290975"},{"key":"e_1_3_2_1_41_1","first-page":"38629","article-title":"Memo: Test time robustness via adaptation and augmentation","volume":"35","author":"Zhang Marvin","year":"2022","unstructured":"Marvin Zhang, Sergey Levine, and Chelsea Finn. 2022. Memo: Test time robustness via adaptation and augmentation. NIPS, Vol. 35 (2022), 38629--38642.","journal-title":"NIPS"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Xiaokun Zhang Bo Xu Youlin Wu Yuan Zhong Hongfei Lin and Fenglong Ma. 2024. FineRec: Exploring Fine-grained Sequential Recommendation. In SIGIR. 1599--1608.","DOI":"10.1145\/3626772.3657761"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Chuang Zhao Xinyu Li Ming He Hongke Zhao and Jianping Fan. 2023a. Sequential Recommendation via an Adaptive Cross-domain Knowledge Decomposition. In CIKM. 3453--3463.","DOI":"10.1145\/3583780.3615058"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Chuang Zhao Hongke Zhao Ming He Jian Zhang and Jianping Fan. 2023b. Cross-domain recommendation via user interest alignment. In WWW. 887--896.","DOI":"10.1145\/3543507.3583263"},{"key":"e_1_3_2_1_45_1","volume-title":"Wayne Xin Zhao, and Ji-Rong Wen","author":"Zhou Kun","year":"2022","unstructured":"Kun Zhou, Hui Yu, Wayne Xin Zhao, and Ji-Rong Wen. 2022. Filter-enhanced MLP is all you need for sequential recommendation. In WWW. 2388--2399."}],"event":{"name":"SIGIR '25: The 48th International ACM SIGIR Conference on Research and Development in Information Retrieval","location":"Padua Italy","acronym":"SIGIR '25","sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3726302.3729943","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T18:31:27Z","timestamp":1755887487000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3726302.3729943"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,13]]},"references-count":45,"alternative-id":["10.1145\/3726302.3729943","10.1145\/3726302"],"URL":"https:\/\/doi.org\/10.1145\/3726302.3729943","relation":{},"subject":[],"published":{"date-parts":[[2025,7,13]]},"assertion":[{"value":"2025-07-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}