A Cognac Shot To Forget Bad Memories: Corrective Unlearning for Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
Graph Neural Networks (GNNs) are increasingly being used for a variety of ML applications on graph data. Because graph data does not follow the independently and identically distributed (i.i.d.) assumption, adversarial manipulations or incorrect data can propagate to other data points through message passing, which deteriorates the model's performance. To allow model developers to remove the adverse effects of manipulated entities from a trained GNN, we study the recently formulated problem of Corrective Unlearning. We find that current graph unlearning methods fail to unlearn the effect of manipulations even when the whole manipulated set is known. We introduce a new graph unlearning method, Cognac, which can unlearn the effect of the manipulation set even when only 5% of it is identified. It recovers most of the performance of a strong oracle with fully corrected training data, even beating retraining from scratch without the deletion set while being 8x more efficient. We hope our work assists GNN developers in mitigating harmful effects caused by issues in real-world data, post-training. Our code is publicly available at https://github.com/cognac-gnn-unlearning/corrective-unlearning-for-gnns
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 49 of its 64 references that are in the map. First posted on arXiv 1 Dec 2024.
Builds on
49 of 64 references.
References · 49
- 2022Training language models to follow instructions with human feedbackcited by 15,971
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
- 2017BadNets: Identifying Vulnerabilities in the Machine Learning Model Supply Chaincited by 1,106
- 2019Machine Unlearningcited by 1,061
- 2024TOFU: A Task of Fictitious Unlearning for LLMscited by 533
- 2024The WMDP Benchmark: Measuring and Reducing Malicious Use With Unlearningcited by 509
- 2020Graph Neural Networks in Recommender Systems: A Surveycited by 494
- 2018Adversarial Attacks on Neural Networks for Graph Datacited by 397
- 2021Pervasive Label Errors in Test Sets Destabilize Machine Learning Benchmarkscited by 395
37 more
- 2020Graph Structure Learning for Robust Graph Neural Networkscited by 371
- 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 335
- 2023Large Language Model Unlearningcited by 302
- 2018Adversarial Attack on Graph Structured Datacited by 301
- 2023Towards Unbounded Machine Unlearningcited by 268
- 2023LEACE: Perfect linear concept erasure in closed formcited by 267
- 2019Adversarial Attacks on Graph Neural Networks via Meta Learningcited by 261
- 2021Machine Unlearning of Features and Labelscited by 229
- 2021Is Homophily a Necessity for Graph Neural Networks?cited by 182
- 2021Graph Unlearningcited by 138
- 2018Adversarial Attacks on Node Embeddings via Graph Poisoningcited by 109
- 2021Robustness of Graph Neural Networks at Scalecited by 100
- 2024Position: Graph Foundation Models are Already Herecited by 86
- 2022Towards Adversarial Evaluations for Inexact Machine Unlearningcited by 84
- 2022Debiasing Graph Neural Networks via Learning Disentangled Causal Substructurecited by 83
- 2022Recommendation Unlearningcited by 80
- 2019Certifiable Robustness to Graph Perturbationscited by 62
- 2023GIF: A General Graph Unlearning Strategy via Influence Functioncited by 60
- 2020How benign is benign overfitting?cited by 40
- 2024Machine Unlearning Fails to Remove Data Poisoning Attackscited by 37
- 2019Data Poisoning Attack against Knowledge Graph Embeddingcited by 36
- 2024Towards Effective and General Graph Unlearning via Mutual Evolutioncited by 29
- 2024Corrective Machine Unlearningcited by 29
- 2023Revisiting Robustness in Graph Machine Learningcited by 19
- 2021Fairness-Aware PAC Learning from Corrupted Datacited by 18
- 2022How unfair is private learning ?cited by 18
- 2022Characterizing the Influence of Graph Elementscited by 16
- 2019Node Injection Attacks on Graphs via Reinforcement Learningcited by 15
- 2024Potion: Towards Poison Unlearningcited by 14
- 2024Delta-Influence: Unlearning Poisons via Influence Functionscited by 13
- 2023A Survey of Graph Unlearningcited by 12
- 2024Unlink to Unlearn: Simplifying Edge Unlearning in GNNscited by 11
- 2022A law of adversarial risk, interpolation, and label noisecited by 8
- 2024Analysis of Using Sigmoid Loss for Contrastive Learningcited by 6
- 2023On the Security Risks of Knowledge Graph Reasoningcited by 5
- 2024Untargeted Adversarial Attack on Knowledge Graph Embeddingscited by 3
- 2023CAFIN: Centrality Aware Fairness inducing IN-processing for Unsupervised Representation Learning on Graphscited by 1
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2023GNNDelete: A General Strategy for Unlearning in Graph Neural Networks
- 2024Graph Unlearning with Efficient Partial Retraining
- 2022Certified Graph Unlearning
- 2025Forget and Explain: Transparent Verification of GNN Unlearning
- 2024GraphMU: Repairing Robustness of Graph Neural Networks via Machine Unlearning
- 2026Re-understanding Graph Unlearning through Memorization
- 2024Erase then Rectify: A Training-Free Parameter Editing Approach for Cost-Effective Graph Unlearning
- 2025Unlearning Inversion Attacks for Graph Neural Networks