OpenGU: A Comprehensive Benchmark for Graph Unlearning
Bowen Fan, Yuming Ai, Xunkai Li, Zhilin Guo, Rong-Hua Li, Guoren Wang

TL;DR
OpenGU is the first comprehensive benchmark for graph unlearning, enabling fair comparison of 16 algorithms across diverse datasets and tasks, thus advancing research in privacy-preserving graph machine learning.
Contribution
This paper introduces OpenGU, a unified benchmark for graph unlearning, addressing evaluation inconsistencies and facilitating fair comparison of methods.
Findings
Identified key limitations of current GU methods.
Provided insights into the performance of 16 state-of-the-art algorithms.
Highlighted future research directions in graph unlearning.
Abstract
Graph Machine Learning is essential for understanding and analyzing relational data. However, privacy-sensitive applications demand the ability to efficiently remove sensitive information from trained graph neural networks (GNNs), avoiding the unnecessary time and space overhead caused by retraining models from scratch. To address this issue, Graph Unlearning (GU) has emerged as a critical solution, with the potential to support dynamic graph updates in data management systems and enable scalable unlearning in distributed data systems while ensuring privacy compliance. Unlike machine unlearning in computer vision or other fields, GU faces unique difficulties due to the non-Euclidean nature of graph data and the recursive message-passing mechanism of GNNs. Additionally, the diversity of downstream tasks and the complexity of unlearning requests further amplify these challenges. Despite…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Graph Theory and Algorithms
