{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T17:26:59Z","timestamp":1791048419412,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Supercomputing Center of Hangzhou City University"},{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372399"],"award-info":[{"award-number":["62372399"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Starry Night Science Fund of Zhejiang University Shanghai Institute for Advanced Study","award":["SN-ZJU-SIAS-001"],"award-info":[{"award-number":["SN-ZJU-SIAS-001"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,5,13]]},"DOI":"10.1145\/3589334.3645598","type":"proceedings-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T07:08:13Z","timestamp":1715152093000},"page":"3777-3788","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":47,"title":["Distributionally Robust Graph-based Recommendation System"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-8264-3182","authenticated-orcid":false,"given":"Bohao","family":"Wang","sequence":"first","affiliation":[{"name":"The State Key Laboratory of Blockchain and Data Security, Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4752-2629","authenticated-orcid":false,"given":"Jiawei","family":"Chen","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-5152-1630","authenticated-orcid":false,"given":"Changdong","family":"Li","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3645-1041","authenticated-orcid":false,"given":"Sheng","family":"Zhou","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7883-9848","authenticated-orcid":false,"given":"Qihao","family":"Shi","sequence":"additional","affiliation":[{"name":"Hangzhou City University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8886-2569","authenticated-orcid":false,"given":"Yang","family":"Gao","sequence":"additional","affiliation":[{"name":"Intelligence Indeed, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3605-5404","authenticated-orcid":false,"given":"Yan","family":"Feng","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6198-7481","authenticated-orcid":false,"given":"Chun","family":"Chen","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5890-4307","authenticated-orcid":false,"given":"Can","family":"Wang","sequence":"additional","affiliation":[{"name":"The State Key Laboratory of Blockchain and Data Security, Zhejiang University, Hangzhou, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Graph convolutional matrix completion. arXiv preprint arXiv:1706.02263","author":"van den Berg Rianne","year":"2017","unstructured":"Rianne van den Berg, Thomas N Kipf, and Max Welling. 2017. Graph convolutional matrix completion. arXiv preprint arXiv:1706.02263 (2017)."},{"key":"e_1_3_2_2_2_1","volume-title":"LightGCL: Simple Yet Effective Graph Contrastive Learning for Recommendation. arXiv preprint arXiv:2302.08191","author":"Cai Xuheng","year":"2023","unstructured":"Xuheng Cai, Chao Huang, Lianghao Xia, and Xubin Ren. 2023. LightGCL: Simple Yet Effective Graph Contrastive Learning for Recommendation. arXiv preprint arXiv:2302.08191 (2023)."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313493"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462919"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564284"},{"key":"e_1_3_2_2_6_1","volume-title":"2023 a. Uncertainty-Aware Robust Learning on Noisy Graphs. arXiv preprint arXiv:2306.08210","author":"Chen Shuyi","year":"2023","unstructured":"Shuyi Chen, Kaize Ding, and Shixiang Zhu. 2023 a. Uncertainty-Aware Robust Learning on Noisy Graphs. arXiv preprint arXiv:2306.08210 (2023)."},{"key":"e_1_3_2_2_7_1","first-page":"3900","article-title":"Graph Convolution Network based Recommender Systems: Learning Guarantee and Item Mixture Powered Strategy","volume":"35","author":"Deng Leyan","year":"2022","unstructured":"Leyan Deng, Defu Lian, Chenwang Wu, and Enhong Chen. 2022. Graph Convolution Network based Recommender Systems: Learning Guarantee and Item Mixture Powered Strategy. Advances in Neural Information Processing Systems , Vol. 35 (2022), 3900--3912.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449927"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Wenqi Fan Yao Ma Qing Li Yuan He Eric Zhao Jiliang Tang and Dawei Yin. 2019. Graph neural networks for social recommendation. In The world wide web conference. 417--426.","DOI":"10.1145\/3308558.3313488"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591994"},{"key":"e_1_3_2_2_11_1","volume-title":"Alleviating Matthew Effect of Offline Reinforcement Learning in Interactive Recommendation. arXiv preprint arXiv:2307.04571","author":"Gao Chongming","year":"2023","unstructured":"Chongming Gao, Kexin Huang, Jiawei Chen, Yuan Zhang, Biao Li, Peng Jiang, Shiqi Wang, Zhong Zhang, and Xiangnan He. 2023. Alleviating Matthew Effect of Offline Reinforcement Learning in Interactive Recommendation. arXiv preprint arXiv:2307.04571 (2023)."},{"key":"e_1_3_2_2_12_1","volume-title":"Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997","author":"Gasteiger Johannes","year":"2018","unstructured":"Johannes Gasteiger, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2018. Predict then propagate: Graph neural networks meet personalized pagerank. arXiv preprint arXiv:1810.05997 (2018)."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2911451.2911489"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3511969"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3511969"},{"key":"e_1_3_2_2_18_1","volume-title":"Kullback-Leibler divergence constrained distributionally robust optimization. Available at Optimization Online","author":"Hu Zhaolin","year":"2013","unstructured":"Zhaolin Hu and L Jeff Hong. 2013. Kullback-Leibler divergence constrained distributionally robust optimization. Available at Optimization Online, Vol. 1, 2 (2013), 9."},{"key":"e_1_3_2_2_19_1","volume-title":"Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907","author":"Kipf Thomas N","year":"2016","unstructured":"Thomas N Kipf and Max Welling. 2016. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907 (2016)."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482225"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1639714.1639717"},{"key":"e_1_3_2_2_23_1","volume-title":"Foundations of machine learning","author":"Mohri Mehryar","unstructured":"Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar. 2018. Foundations of machine learning. MIT press."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3291016"},{"key":"e_1_3_2_2_25_1","volume-title":"Distributionally robust language modeling. arXiv preprint arXiv:1909.02060","author":"Oren Yonatan","year":"2019","unstructured":"Yonatan Oren, Shiori Sagawa, Tatsunori B Hashimoto, and Percy Liang. 2019. Distributionally robust language modeling. arXiv preprint arXiv:1909.02060 (2019)."},{"key":"e_1_3_2_2_26_1","volume-title":"Distributionally robust semi-supervised learning over graphs. arXiv preprint arXiv:2110.10582","author":"Sadeghi Alireza","year":"2021","unstructured":"Alireza Sadeghi, Meng Ma, Bingcong Li, and Georgios B Giannakis. 2021. Distributionally robust semi-supervised learning over graphs. arXiv preprint arXiv:2110.10582 (2021)."},{"key":"e_1_3_2_2_27_1","volume-title":"Tatsunori B Hashimoto, and Percy Liang.","author":"Sagawa Shiori","year":"2019","unstructured":"Shiori Sagawa, Pang Wei Koh, Tatsunori B Hashimoto, and Percy Liang. 2019. Distributionally robust neural networks for group shifts: On the importance of regularization for worst-case generalization. arXiv preprint arXiv:1911.08731 (2019)."},{"key":"e_1_3_2_2_28_1","volume-title":"international conference on machine learning. PMLR, 1670--1679","author":"Schnabel Tobias","year":"2016","unstructured":"Tobias Schnabel, Adith Swaminathan, Ashudeep Singh, Navin Chandak, and Thorsten Joachims. 2016. Recommendations as treatments: Debiasing learning and evaluation. In international conference on machine learning. PMLR, 1670--1679."},{"key":"e_1_3_2_2_29_1","volume-title":"Peyman M Mohajerin Esfahani, and Daniel Kuhn","author":"Abadeh Soroosh Shafieezadeh","year":"2015","unstructured":"Soroosh Shafieezadeh Abadeh, Peyman M Mohajerin Esfahani, and Daniel Kuhn. 2015. Distributionally robust logistic regression. Advances in Neural Information Processing Systems , Vol. 28 (2015)."},{"key":"e_1_3_2_2_30_1","volume-title":"Certifying some distributional robustness with principled adversarial training. arXiv preprint arXiv:1710.10571","author":"Sinha Aman","year":"2017","unstructured":"Aman Sinha, Hongseok Namkoong, Riccardo Volpi, and John Duchi. 2017. Certifying some distributional robustness with principled adversarial training. arXiv preprint arXiv:1710.10571 (2017)."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290989"},{"key":"e_1_3_2_2_32_1","volume-title":"Advances in Neural Information Processing Systems","volume":"32","author":"Staib Matthew","year":"2019","unstructured":"Matthew Staib and Stefanie Jegelka. 2019. Distributionally robust optimization and generalization in kernel methods. Advances in Neural Information Processing Systems , Vol. 32 (2019)."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401123"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531889"},{"key":"e_1_3_2_2_35_1","article-title":"Visualizing data using t-SNE","volume":"9","author":"der Maaten Laurens Van","year":"2008","unstructured":"Laurens Van der Maaten and Geoffrey Hinton. 2008. Visualizing data using t-SNE. Journal of machine learning research, Vol. 9, 11 (2008).","journal-title":"Journal of machine learning research"},{"key":"e_1_3_2_2_36_1","volume-title":"Attention is all you need. Advances in neural information processing systems","author":"Vaswani Ashish","year":"2017","unstructured":"Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, \u0141ukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. Advances in neural information processing systems , Vol. 30 (2017)."},{"key":"e_1_3_2_2_37_1","volume-title":"Graph attention networks. arXiv preprint arXiv:1710.10903","author":"Petar Velivc","year":"2017","unstructured":"Petar Velivc kovi\u0107, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)."},{"key":"e_1_3_2_2_38_1","volume-title":"Generalizing to unseen domains via adversarial data augmentation. Advances in neural information processing systems","author":"Volpi Riccardo","year":"2018","unstructured":"Riccardo Volpi, Hongseok Namkoong, Ozan Sener, John C Duchi, Vittorio Murino, and Silvio Savarese. 2018. Generalizing to unseen domains via adversarial data augmentation. Advances in neural information processing systems , Vol. 31 (2018)."},{"key":"e_1_3_2_2_39_1","volume-title":"Robust distillation for worst-class performance. arXiv preprint arXiv:2206.06479","author":"Wang Serena","year":"2022","unstructured":"Serena Wang, Harikrishna Narasimhan, Yichen Zhou, Sara Hooker, Michal Lukasik, and Aditya Krishna Menon. 2022c. Robust distillation for worst-class performance. arXiv preprint arXiv:2206.06479 (2022)."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512251"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330989"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599324"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539439"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512255"},{"key":"e_1_3_2_2_45_1","volume-title":"2023 a. Understanding contrastive learning via distributionally robust optimization. arXiv preprint arXiv:2310.11048","author":"Wu Junkang","year":"2023","unstructured":"Junkang Wu, Jiawei Chen, Jiancan Wu, Wentao Shi, Xiang Wang, and Xiangnan He. 2023 a. Understanding contrastive learning via distributionally robust optimization. arXiv preprint arXiv:2310.11048 (2023)."},{"key":"e_1_3_2_2_46_1","volume-title":"2023 b. BSL: Understanding and Improving Softmax Loss for Recommendation. arXiv preprint arXiv:2312.12882","author":"Wu Junkang","year":"2023","unstructured":"Junkang Wu, Jiawei Chen, Jiancan Wu, Wentao Shi, Jizhi Zhang, and Xiang Wang. 2023 b. BSL: Understanding and Improving Softmax Loss for Recommendation. arXiv preprint arXiv:2312.12882 (2023)."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462862"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3604915.3608784"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539618.3591624"},{"key":"e_1_3_2_2_50_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_51_1","volume-title":"Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval. 1294--1303","author":"Yu Junliang","year":"2022","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 Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval. 1294--1303."},{"key":"e_1_3_2_2_52_1","volume-title":"International Conference on Machine Learning. PMLR, 10936--10945","author":"Yu Wenhui","year":"2020","unstructured":"Wenhui Yu and Zheng Qin. 2020. Graph convolutional network for recommendation with low-pass collaborative filters. In International Conference on Machine Learning. PMLR, 10936--10945."},{"key":"e_1_3_2_2_53_1","volume-title":"International Conference on Machine Learning. PMLR, 12345--12355","author":"Zhai Runtian","year":"2021","unstructured":"Runtian Zhai, Chen Dan, Zico Kolter, and Pradeep Ravikumar. 2021. Doro: Distributional and outlier robust optimization. In International Conference on Machine Learning. PMLR, 12345--12355."},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583461"},{"key":"e_1_3_2_2_55_1","volume-title":"Robust graph learning under Wasserstein uncertainty. arXiv preprint arXiv:2105.04210","author":"Zhang Xiang","year":"2021","unstructured":"Xiang Zhang, Yinfei Xu, Qinghe Liu, Zhicheng Liu, Jian Lu, and Qiao Wang. 2021. Robust graph learning under Wasserstein uncertainty. arXiv preprint arXiv:2105.04210 (2021)."},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1561\/1500000066"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599377"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3511808.3557680"},{"key":"e_1_3_2_2_59_1","volume-title":"Popularity bias is not always evil: Disentangling benign and harmful bias for recommendation","author":"Zhao Zihao","year":"2022","unstructured":"Zihao Zhao, Jiawei Chen, Sheng Zhou, Xiangnan He, Xuezhi Cao, Fuzheng Zhang, and Wei Wu. 2022a. Popularity bias is not always evil: Disentangling benign and harmful bias for recommendation. IEEE Transactions on Knowledge and Data Engineering (2022)."},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"crossref","unstructured":"Huachi Zhou Hao Chen Junnan Dong Daochen Zha Chuang Zhou and Xiao Huang. 2023. Adaptive Popularity Debiasing Aggregator for Graph Collaborative Filtering. (2023). io","DOI":"10.1145\/3539618.3591635"}],"event":{"name":"WWW '24: The ACM Web Conference 2024","location":"Singapore Singapore","acronym":"WWW '24","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645598","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589334.3645598","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:22:35Z","timestamp":1755822155000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645598"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":60,"alternative-id":["10.1145\/3589334.3645598","10.1145\/3589334"],"URL":"https:\/\/doi.org\/10.1145\/3589334.3645598","relation":{},"subject":[],"published":{"date-parts":[[2024,5,13]]},"assertion":[{"value":"2024-05-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}