mlsanityData to 14 Oct 2026

Unlink to Unlearn: Simplifying Edge Unlearning in GNNs

arXiv 2402.10695 ↗First posted 16 Feb 2024cs.LG cs.AI cs.CRcited by 11

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

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Graph Attention Networkscited by 8,923
  3. 2018How Powerful are Graph Neural Networks?cited by 4,393
  4. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
  5. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  6. 2019Machine Unlearningcited by 1,061
  7. 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
  8. 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 335
  9. 2021Graph Unlearningcited by 138
  10. 2022Recommendation Unlearningcited by 80
  11. 2023GIF: A General Graph Unlearning Strategy via Influence Functioncited by 60
  12. 2023Efficiently Forgetting What You Have Learned in Graph Representation Learning via Projectioncited by 20

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 3; 2025: 6; 2026: 2.

11 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2023GNNDelete: A General Strategy for Unlearning in Graph Neural Networks
  2. 2025Unlearning Inversion Attacks for Graph Neural Networks
  3. 2022Certified Graph Unlearning
  4. 2023Distill to Delete: Unlearning in Graph Networks with Knowledge Distillation
  5. 2024Erase then Rectify: A Training-Free Parameter Editing Approach for Cost-Effective Graph Unlearning
  6. 2025Graph Unlearning: Efficient Node Removal in Graph Neural Networks
  7. 2024IDEA: A Flexible Framework of Certified Unlearning for Graph Neural Networks
  8. 2024TCGU: Data-centric Graph Unlearning based on Transferable Condensation