{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T05:40:52Z","timestamp":1770270052601,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62406347,62202302"],"award-info":[{"award-number":["62406347,62202302"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hong Kong RGC Theme-based Research Scheme","award":["T32-615-24\/R"],"award-info":[{"award-number":["T32-615-24\/R"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,10,27]]},"DOI":"10.1145\/3746027.3754941","type":"proceedings-article","created":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T06:47:18Z","timestamp":1761374838000},"page":"10857-10866","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Graph Unlearning Meets Influence-aware Negative Preference Optimization"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-4336-2392","authenticated-orcid":false,"given":"Qiang","family":"Chen","sequence":"first","affiliation":[{"name":"Central South University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-0307-5597","authenticated-orcid":false,"given":"Zhongze","family":"Wu","sequence":"additional","affiliation":[{"name":"Central South University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9853-1953","authenticated-orcid":false,"given":"Ang","family":"He","sequence":"additional","affiliation":[{"name":"Shanghai Maritime University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5303-1191","authenticated-orcid":false,"given":"Xi","family":"Lin","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3645-6301","authenticated-orcid":false,"given":"Shuo","family":"Jiang","sequence":"additional","affiliation":[{"name":"Tongji University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1964-0430","authenticated-orcid":false,"given":"Shan","family":"You","sequence":"additional","affiliation":[{"name":"SenseTime Research, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4756-0609","authenticated-orcid":false,"given":"Chang","family":"Xu","sequence":"additional","affiliation":[{"name":"University of Sydney, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4283-7485","authenticated-orcid":false,"given":"Yi","family":"Chen","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9863-5404","authenticated-orcid":false,"given":"Xiu","family":"Su","sequence":"additional","affiliation":[{"name":"Central South University, Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,10,27]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2018. Deep gaussian embedding of graphs: Unsupervised inductive learning via ranking. In ICLR."},{"key":"e_1_3_2_1_2_1","volume-title":"California Consumer Privacy Act of","author":"CCPA.","year":"2018","unstructured":"CCPA. 2018. California Consumer Privacy Act of 2018. https:\/\/leginfo.legislature.ca.gov\/faces\/billTextClient.xhtml?bill_id=201720180AB375. AB-375, Signed into law on June 28, 2018."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645521"},{"key":"e_1_3_2_1_4_1","unstructured":"Jiali Cheng George Dasoulas Huan He Chirag Agarwal and Marinka Zitnik. 2023. GNNDelete: A general unlearning strategy for graph neural networks. In ICLR."},{"key":"e_1_3_2_1_5_1","unstructured":"Bai Chenjia Zhang Yang Qiu Shuang Zhang Qiaosheng Xu Kang and Li Xuelong. 2025. ONLINE PREFERENCE ALIGNMENT FOR LANGUAGE MODELS VIA COUNT-BASED EXPLORATION. In ICLR."},{"key":"e_1_3_2_1_6_1","unstructured":"Li Chenliang Zeng Siliang Liao Zeyi Li Jiaxiang Kang Dongyeop Garcia Alfredo and Hong Mingyi. 2025. LEARNING REWARD AND POLICY JOINTLY FROM DEMONSTRATION AND PREFERENCE IMPROVES ALIGNMENT. In ICLR."},{"key":"e_1_3_2_1_7_1","volume-title":"SAFE RLHF: SAFE REINFORCEMENT LEARNING FROM HUMAN FEEDBACK. In ICLR.","author":"Dai Juntao","year":"2024","unstructured":"Juntao Dai, Xuehai Pan, Ruiyang Sun, Jiaming Ji, Xinbo Xu, Mickel Liu, Yizhou Wang, and Yaodong Yang. 2024. SAFE RLHF: SAFE REINFORCEMENT LEARNING FROM HUMAN FEEDBACK. In ICLR."},{"key":"e_1_3_2_1_8_1","unstructured":"Blakely Derrick Lanchantin Jack and Qi Yanjun. 2019. Time and Space Complexity of Graph Convolutional Networks. (2019). https:\/\/api.semanticscholar.org\/CorpusID:269411067"},{"key":"e_1_3_2_1_9_1","volume-title":"Wallis Phillip, Allen-Zhu Zeyuan, Li Yuanzhi, Wang Shean, Wang Lu, and Weizhu Chen.","author":"Hu Edward","year":"2022","unstructured":"Hu Edward J, shen yelong, Wallis Phillip, Allen-Zhu Zeyuan, Li Yuanzhi, Wang Shean, Wang Lu, and Weizhu Chen. 2022. LoRA: Low-Rank Adaptation of Large Language Models. In ICLR."},{"key":"e_1_3_2_1_10_1","volume-title":"Simplicity Prevails: Rethinking Negative Preference Optimization for LLM Unlearning. In NeurPIS.","author":"Fan Chongyu","year":"2024","unstructured":"Chongyu Fan, Jiancheng Liu, Licong Lin, Jinghan Jia, Ruiqi Zhang, Song Mei, and Sijia Liu. 2024. Simplicity Prevails: Rethinking Negative Preference Optimization for LLM Unlearning. In NeurPIS."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52734.2025.02376"},{"key":"e_1_3_2_1_12_1","volume-title":"International Conference on Machine Learning. PMLR, 1263-1272","author":"Gilmer Justin","unstructured":"Justin Gilmer, Samuel S. Schoenholz, Patrick F. Riley, Oriol Vinyals, and George E. Dahl. 2017. Neural message passing for quantum chemistry. In International Conference on Machine Learning. PMLR, 1263-1272."},{"key":"e_1_3_2_1_13_1","volume-title":"LLM Safety Alignment is Divergence Estimation in Disguise. arXiv preprint arXiv:2502.00657","author":"Haldar Rajdeep","year":"2025","unstructured":"Rajdeep Haldar, Wang Ziyi, Song Qifan, Lin Guang, and Xing Yue. 2025. LLM Safety Alignment is Divergence Estimation in Disguise. arXiv preprint arXiv:2502.00657 (2025)."},{"key":"e_1_3_2_1_14_1","unstructured":"William L. Hamilton Rex Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In NeurIPS."},{"key":"e_1_3_2_1_15_1","unstructured":"Weihua Hu Matthias Fey Marinka Zitnik Yuxiao Dong Hongyu Ren Bowen Liu Michele Catasta and Jure Leskovec. 2020. Open graph benchmark: datasets for machine learning on graphs. In NeurIPS."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Jiaming Ji Donghai Hong Borong Zhang Boyuan Chen Josef Dai Boren Zheng Tianyi Qiu Boxun Li and Yaodong Yang. 2024. PKU-SafeRLHF: Towards Multi-Level Safety Alignment for LLMs with Human Preference. In NeurPIS.","DOI":"10.18653\/v1\/2025.acl-long.1544"},{"key":"e_1_3_2_1_17_1","volume-title":"TOWARDS ROBUST ALIGNMENT OF LANGUAGE MODELS: DISTRIBUTIONALLY ROBUSTIFYING DIRECT PREFERENCE OPTIMIZATION. In ICLR.","author":"Junkang Wu","year":"2025","unstructured":"Wu Junkang, Xie Yuexiang, Yang Zhengyi, Wu Jiancan, Chen Jiawei, Gao Jinyang, Ding Bolin, Wang Xiang, and He Xiangnan. 2025. TOWARDS ROBUST ALIGNMENT OF LANGUAGE MODELS: DISTRIBUTIONALLY ROBUSTIFYING DIRECT PREFERENCE OPTIMIZATION. In ICLR."},{"key":"e_1_3_2_1_18_1","volume-title":"Kipf and Welling Max","author":"Thomas","year":"2017","unstructured":"Thomas N. Kipf and Welling Max. 2017. Semi-supervised classification with graph convolutional networks. In ICLR."},{"key":"e_1_3_2_1_19_1","unstructured":"Aaron Jiaxun Li Satyapriya Krishna and Himabindu Lakkaraju. 2025a. Joint Reward and Policy Learning with Demonstrations and Human Feedback Improves Alignment. In ICLR."},{"key":"e_1_3_2_1_20_1","unstructured":"Chenliang Li Siliang Zeng Zeyi Liao Jiaxiang Li Dongyeop Kang Alfredo Garcia and Hong Mingyi. 2025b. Joint Reward and Policy Learning with Demonstrations and Human Feedback Improves Alignment. In ICLR."},{"key":"e_1_3_2_1_21_1","volume-title":"Graph neural networks with deep mutual learning for designing multi-modal recommendation systems. Information Sciences","author":"Li Jianing","year":"2024","unstructured":"Jianing Li, Chaoqun Yang, Guanhua Ye, and Quoc Viet Hung Nguyen. 2024b. Graph neural networks with deep mutual learning for designing multi-modal recommendation systems. Information Sciences (2024)."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589334.3645389"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i12.29273"},{"key":"e_1_3_2_1_24_1","volume-title":"A survey of knowledge graph reasoning on graph types: Static, dynamic, and multi-modal","author":"Liang Ke","year":"2024","unstructured":"Ke Liang, Lingyuan Meng, Meng Liu, Yue Liu, Wenxuan Tu, Siwei Wang, Sihang Zhou, and Xinwang Liu. 2024a. A survey of knowledge graph reasoning on graph types: Static, dynamic, and multi-modal. IEEE Transactions on Pattern Analysis and Machine Intelligence (2024)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3656579"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796721"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467276"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPSISA52974.2021.00002"},{"key":"e_1_3_2_1_29_1","volume-title":"TOFU: A Task of Fictitious Unlearning for LLMs. In NeurIPS.","author":"Pratyush Maini","year":"2024","unstructured":"Maini Pratyush, Feng Zhili, Schwarzschild Avi, Lipton Zachary C., and Zico Kolter J., 2024. TOFU: A Task of Fictitious Unlearning for LLMs. In NeurIPS."},{"key":"e_1_3_2_1_30_1","unstructured":"Rafael Rafailov Archit Sharma Eric Mitchell Stefano Ermon Christopher D. Manning and Chelsea Finn. 2023. Direct Preference Optimization: Your Language Model is Secretly a Reward Model. In NeurPIS."},{"key":"e_1_3_2_1_31_1","unstructured":"Yao Rong Guanchu Wang Qizhang Feng Ninghao Liu Zirui Liu Enkelejda Kasneci and Xia Hu. 2023. Efficient GNN Explanation via Learning Removal-based Attribution. arXiv:2306.05760 [cs.LG]"},{"key":"e_1_3_2_1_32_1","volume-title":"Proceedings of the International Conference on Machine Learning.","author":"Sablayrolles Alexandre","year":"2019","unstructured":"Alexandre Sablayrolles, Matthijs Douze, Yann Ollivier, Cordelia Schmid, and Herv\u00e9 J\u00e9gou. 2019. White-box vs black-box: Bayes optimal strategies for membership inference. In Proceedings of the International Conference on Machine Learning."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3664647.3681693"},{"key":"e_1_3_2_1_34_1","volume-title":"MUSE: Machine Unlearning Six-Way Evaluation for Language Models. In ICLR.","author":"Shi Weijia","year":"2025","unstructured":"Weijia Shi, Jaechan Lee, Yangsibo Huang, Sadhika Malladi, Jieyu Zhao, Ari Holtzman, Daogao Liu, Luke Zettlemoyer, Noah A. Smith, and Chiyuan Zhang. 2025. MUSE: Machine Unlearning Six-Way Evaluation for Language Models. In ICLR."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3051315"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.01082"},{"key":"e_1_3_2_1_37_1","volume-title":"Locally free weight sharing for network width search. arXiv preprint arXiv:2102.05258","author":"Su Xiu","year":"2021","unstructured":"Xiu Su, Shan You, Tao Huang, Fei Wang, Chen Qian, Changshui Zhang, and Chang Xu. 2021b. Locally free weight sharing for network width search. arXiv preprint arXiv:2102.05258 (2021)."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00221"},{"key":"e_1_3_2_1_39_1","first-page":"8936","article-title":"Searching for network width with bilaterally coupled network","volume":"45","author":"Su Xiu","year":"2022","unstructured":"Xiu Su, Shan You, Jiyang Xie, Fei Wang, Chen Qian, Changshui Zhang, and Chang Xu. 2022a. Searching for network width with bilaterally coupled network. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 45, 7 (2022), 8936-8953.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-19803-8_9"},{"key":"e_1_3_2_1_41_1","volume-title":"International Conference on Machine Learning. PMLR, 9880-9890","author":"Su Xiu","year":"2021","unstructured":"Xiu Su, Shan You, Mingkai Zheng, Fei Wang, Chen Qian, Changshui Zhang, and Chang Xu. 2021 d. K-shot nas: Learnable weight-sharing for nas with k-shot supernets. In International Conference on Machine Learning. PMLR, 9880-9890."},{"key":"e_1_3_2_1_42_1","unstructured":"Cha Sungmin Cho Sungjun Hwang Dasol and Lee Moontae. 2025. TOWARDS ROBUST AND PARAMETER-EFFICIENT KNOWLEDGE UNLEARNING FOR LLMS. In ICLR."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589335.3651578"},{"key":"e_1_3_2_1_44_1","volume-title":"Proceedings of the 29th ACM International Conference on Information and Knowledge Management. Association for Computing Machinery, 1435-1444","author":"Tang Xianfeng","year":"2020","unstructured":"Xianfeng Tang, Huaxiu Yao, Yiwei Sun, Yiqi Wang, Jiliang Tang, Charu Aggarwal, Prasenjit Mitra, and Suhang Wang. 2020. Investigating and Mitigating Degree-Related Biases in Graph Convolutional Networks. In Proceedings of the 29th ACM International Conference on Information and Knowledge Management. Association for Computing Machinery, 1435-1444."},{"key":"e_1_3_2_1_45_1","volume-title":"The EU General Data Protection Regulation (GDPR): A Practical Guide","author":"Voigt Paul","unstructured":"Paul Voigt and Axel Von dem Bussche. 2017. The EU General Data Protection Regulation (GDPR): A Practical Guide (1st ed.). Springer International Publishing, Cham.","edition":"1"},{"key":"e_1_3_2_1_46_1","unstructured":"Qizhou Wang Bo Han Puning Yang Jianing Zhu Tongliang Liu and Masashi Sugiyama. 2025a. TOWARDS EFFECTIVE EVALUATIONS AND COMPARISONS FOR LLM UNLEARNING METHODS. In ICLR."},{"key":"e_1_3_2_1_47_1","volume-title":"Zhanke Zhou, Saebyeol Shin, Bo Han, and Kilian Q. Weinberger.","author":"Wang Qizhou","year":"2025","unstructured":"Qizhou Wang, Jin Peng Zhou, Zhanke Zhou, Saebyeol Shin, Bo Han, and Kilian Q. Weinberger. 2025c. RETHINKING LLM UNLEARNING OBJECTIVES: A GRADIENT PERSPECTIVE AND GO BEYOND. In ICLR."},{"key":"e_1_3_2_1_48_1","unstructured":"Yu Wang Tong Zhao Yuying Zhao Yunchao Liu Xueqi Cheng Neil Shah and Tyler Derr. 2025b. TOWARDS EFFECTIVE EVALUATIONS AND COMPARISONS FOR LLM UNLEARNING METHODS. In ICLR."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583521"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_3_2_1_51_1","unstructured":"Scholten Yan Gunnemann Stephan and Schwinn Leo. 2025. A PROBABILISTIC PERSPECTIVE ON UNLEARNING AND ALIGNMENT FOR LARGE LANGUAGE MODELS. In ICLR."},{"key":"e_1_3_2_1_52_1","volume-title":"ACM SIGSAC Conference on Computer and Communications Security.","author":"Yeom Samuel","year":"2019","unstructured":"Samuel Yeom, Irene Giacomelli, Matt Fredrikson, and Somesh Jha. 2019. Privacy risk in machine learning: Analyzing the connection to overfitting. In ACM SIGSAC Conference on Computer and Communications Security."},{"key":"e_1_3_2_1_53_1","volume-title":"XGNN: Towards Model-Level Explanations of Graph Neural Networks. arXiv:2006.02587 [cs.LG]","author":"Yuan Hao","year":"2020","unstructured":"Hao Yuan, Jiliang Tang, Xia Hu, and Shuiwang Ji. 2020. XGNN: Towards Model-Level Explanations of Graph Neural Networks. arXiv:2006.02587 [cs.LG]"},{"key":"e_1_3_2_1_54_1","unstructured":"Hao Yuan Haiyang Yu Jie Wang Kang Li and Shuiwang Ji. 2021. On Explainability of Graph Neural Networks via Subgraph Explorations. arXiv:2102.05152 [cs.LG]"},{"key":"e_1_3_2_1_55_1","unstructured":"Xiaojian Yuan Tianyu Pang Chao Du Kejiang Chen Weiming Zhang and Min Lin. 2025. A CLOSER LOOK AT MACHINE UNLEARNING FOR LARGE LANGUAGE MODELS. In ICLR."},{"key":"e_1_3_2_1_56_1","unstructured":"Ruiqi Zhang Licong Lin Yu Bai and Song Mei. 2024. Negative Preference Optimization: From Catastrophic Collapse to Effective Unlearning. In CoLM."},{"key":"e_1_3_2_1_57_1","unstructured":"Siyan Zhao Mingyi Hong Yang Liu Devamanyu Hazarika and Kaixiang Lin. 2025. In ICLR."},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52734.2025.00912"}],"event":{"name":"MM '25: The 33rd ACM International Conference on Multimedia","location":"Dublin Ireland","acronym":"MM '25","sponsor":["SIGMM ACM Special Interest Group on Multimedia"]},"container-title":["Proceedings of the 33rd ACM International Conference on Multimedia"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3746027.3754941","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T04:17:37Z","timestamp":1765340257000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3746027.3754941"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,27]]},"references-count":58,"alternative-id":["10.1145\/3746027.3754941","10.1145\/3746027"],"URL":"https:\/\/doi.org\/10.1145\/3746027.3754941","relation":{},"subject":[],"published":{"date-parts":[[2025,10,27]]},"assertion":[{"value":"2025-10-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}