Unlink to Unlearn: Simplifying Edge Unlearning in GNNs
Not on the map. Why?
Abstract (arXiv)
As concerns over data privacy intensify, unlearning in Graph Neural Networks (GNNs) has emerged as a prominent research frontier in academia. This concept is pivotal in enforcing the textitright to be forgotten, which entails the selective removal of specific data from trained GNNs upon user request. Our research focuses on edge unlearning, a process of particular relevance to real-world applications. Current state-of-the-art approaches like GNNDelete can eliminate the influence of specific edges yet suffer from textitover-forgetting, which means the unlearning process inadvertently removes excessive information beyond needed, leading to a significant performance decline for remaining edges. Our analysis identifies the loss functions of GNNDelete as the primary source of over-forgetting and also suggests that loss functions may be redundant for effective edge unlearning. Building on these insights, we simplify GNNDelete to develop Unlink to Unlearn (UtU), a novel method that facilitates unlearning exclusively through unlinking the forget edges from graph structure. Our extensive experiments demonstrate that UtU delivers privacy protection on par with that of a retrained model while preserving high accuracy in downstream tasks, by upholding over 97.3% of the retrained model's privacy protection capabilities and 99.8% of its link prediction accuracy. Meanwhile, UtU requires only constant computational demands, underscoring its advantage as a highly lightweight and practical edge unlearning solution.
Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 12 of its 18 references that are in the map. First posted on arXiv 16 Feb 2024.
Builds on
12 of 18 references.
References · 12
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
- 2019Machine Unlearningcited by 1,061
- 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
- 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 335
- 2021Graph Unlearningcited by 138
- 2022Recommendation Unlearningcited by 80
- 2023GIF: A General Graph Unlearning Strategy via Influence Functioncited by 60
- 2023Efficiently Forgetting What You Have Learned in Graph Representation Learning via Projectioncited by 20
Built on by
Citing papers per year: 2024: 3; 2025: 6; 2026: 2.
11 papers.
- 2024Threats, Attacks, and Defenses in Machine Unlearning: A Surveycited by 39
- 2024On Effects of Steering Latent Representation for Large Language Model Unlearningcited by 32
- 2025OpenGU: A Comprehensive Benchmark for Graph Unlearningcited by 8
- 2025FROG: Fair Removal on Graphscited by 4
- 2025Graph Unlearning Meets Influence-aware Negative Preference Optimizationcited by 3
- 2024A Cognac Shot To Forget Bad Memories: Corrective Unlearning for Graph Neural Networkscited by 2
- 2025Toward Scalable Graph Unlearning: A Node Influence Maximization based Approachcited by 2
- 2025Adaptive Graph Unlearningcited by 2
- 2026Re-understanding Graph Unlearning through Memorizationcited by 2
- 2025Forget and Explain: Transparent Verification of GNN Unlearningcited by 0
- 2026CUNO: Curriculum and Preference Optimization for Stable Graph Unlearning under Mass Deletioncited by 0
- 2026CUNO: Curriculum and Preference Optimization for Stable Graph Unlearning under Mass Deletion8 Sep 2026
- 2026Re-understanding Graph Unlearning through Memorization21 Jan 2026
- 2025Forget and Explain: Transparent Verification of GNN Unlearning8 Dec 2025
- 2025Graph Unlearning Meets Influence-aware Negative Preference Optimization22 Oct 2025
- 2025Adaptive Graph Unlearning19 May 2025
- 2025FROG: Fair Removal on Graphs23 Mar 2025
- 2025Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach21 Jan 2025
- 2025OpenGU: A Comprehensive Benchmark for Graph Unlearning6 Jan 2025
- 2024A Cognac Shot To Forget Bad Memories: Corrective Unlearning for Graph Neural Networks1 Dec 2024
- 2024On Effects of Steering Latent Representation for Large Language Model Unlearning12 Aug 2024
- 2024Threats, Attacks, and Defenses in Machine Unlearning: A Survey20 Mar 2024
Similar, not cited
Close in wording, no citation either way
- 2023GNNDelete: A General Strategy for Unlearning in Graph Neural Networks
- 2025Unlearning Inversion Attacks for Graph Neural Networks
- 2022Certified Graph Unlearning
- 2023Distill to Delete: Unlearning in Graph Networks with Knowledge Distillation
- 2024Erase then Rectify: A Training-Free Parameter Editing Approach for Cost-Effective Graph Unlearning
- 2025Graph Unlearning: Efficient Node Removal in Graph Neural Networks
- 2024IDEA: A Flexible Framework of Certified Unlearning for Graph Neural Networks
- 2024TCGU: Data-centric Graph Unlearning based on Transferable Condensation