mlsanityData to 14 Oct 2026

TCGU: Data-centric Graph Unlearning based on Transferable Condensation

arXiv 2410.06480 ↗First posted 9 Oct 2024cs.LGcited by 0

On the map: LLM safety and security → Graph unlearning

Abstract (arXiv)

With growing demands for data privacy and model robustness, graph unlearning (GU), which erases the influence of specific data on trained GNN models, has gained significant attention. However, existing exact unlearning methods suffer from either low efficiency or poor model performance. While being more utility-preserving and efficient, current approximate unlearning methods are not applicable in the zero-glance privacy setting, where the deleted samples cannot be accessed during unlearning due to immediate deletion requested by regulations. Besides, these approximate methods, which try to directly perturb model parameters still involve high privacy concerns in practice. To fill the gap, we propose Transferable Condensation Graph Unlearning (TCGU), a data-centric solution to zero-glance graph unlearning. Specifically, we first design a two-level alignment strategy to pre-condense the original graph into a small yet utility-preserving dataset. Upon receiving an unlearning request, we fine-tune the pre-condensed data with a low-rank plugin, to directly align its distribution with the remaining graph, thus efficiently revoking the information of deleted data without accessing them. A novel similarity distribution matching approach and a discrimination regularizer are proposed to effectively transfer condensed data and preserve its utility in GNN training, respectively. Finally, we retrain the GNN on the transferred condensed data. Extensive experiments on 6 benchmark datasets demonstrate that TCGU can achieve superior performance in terms of model utility, unlearning efficiency, and unlearning efficacy than existing GU methods.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Graph unlearning, one of 12 directions in LLM safety and security. Builds on 26 of its 45 references that are in the map. First posted on arXiv 9 Oct 2024.

Builds on

26 of 45 references.

Closest ancestors · 2

Same direction, newest first

  1. 2024Towards Effective and General Graph Unlearning via Mutual Evolution22 Jan
  2. 2023GIF: A General Graph Unlearning Strategy via Influence Function6 Apr

Other references · 24

  1. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  3. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  4. 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
  5. 2019Machine Unlearningcited by 1,061
  6. 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
  7. 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
  8. 2015Image-based Recommendations on Styles and Substitutescited by 706
  9. 2019Certified Data Removal from Machine Learning Modelscited by 535
  10. 2021The Intrinsic Dimension of Images and Its Impact on Learningcited by 315
  11. 2019Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networkscited by 242
  12. 2023Model Sparsity Can Simplify Machine Unlearningcited by 214
12 more
  1. 2020When Machine Unlearning Jeopardizes Privacycited by 198
  2. 2020GNNGuard: Defending Graph Neural Networks against Adversarial Attackscited by 195
  3. 2022Can Bad Teaching Induce Forgetting? Unlearning in Deep Networks using an Incompetent Teachercited by 194
  4. 2021Graph Condensation for Graph Neural Networkscited by 150
  5. 2023Improved Distribution Matching for Dataset Condensationcited by 124
  6. 2022Condensing Graphs via One-Step Gradient Matchingcited by 100
  7. 2023Structure-free Graph Condensation: From Large-scale Graphs to Condensed Graph-free Datacited by 71
  8. 2019DEMO-Net: Degree-specific Graph Neural Networks for Node and Graph Classificationcited by 59
  9. 2023CaT: Balanced Continual Graph Learning with Graph Condensationcited by 52
  10. 2022Algorithms that Approximate Data Removal: New Results and Limitationscited by 40
  11. 2023Fast Graph Condensation with Structure-based Neural Tangent Kernelcited by 36
  12. 2023FedGKD: Unleashing the Power of Collaboration in Federated Graph Neural Networkscited by 7

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025OpenGU: A Comprehensive Benchmark for Graph Unlearning
  2. 2025Graph Unlearning: Efficient Node Removal in Graph Neural Networks
  3. 2024Erase then Rectify: A Training-Free Parameter Editing Approach for Cost-Effective Graph Unlearning
  4. 2024Community-Centric Graph Unlearning
  5. 2024Unlink to Unlearn: Simplifying Edge Unlearning in GNNs
  6. 2025Adaptive Graph Unlearning
  7. 2023GNNDelete: A General Strategy for Unlearning in Graph Neural Networks
  8. 2023A Survey of Graph Unlearning