Research map / Graph learning / GNN architectures
Is Graph Unlearning Ready for Practice? A Benchmark on Efficiency, Utility, and Forgetting
Samyak Jain, Ronak Kalvani, sainyam galhotra, Sayan Ranu
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use PROJECTOR customised linear GNN instead of GCN-based methods | unlearning on Cora · Cora (10% nodes) | fidelity to GOLD: 0.99 vs MEGU 0.95 | Improved |
| evaluate with fidelity instead of accuracy alone | PROJECTOR · Roman-Empire / Cora | accuracy vs fidelity: accuracy 0.84 vs GOLD 0.88; fidelity 0.99 | Mixed |
| use IDEA instead of MEGU | unlearning · Cora (10% nodes) | logit L2 distance: 3.05 -> 18.03 | Hurt |
| use MEGU instead of retraining from scratch | unlearning · Ogbn-arxiv | total unlearning time (s): 9.90 -> 20.49 | Hurt |
| use GIF instead of retraining | unlearning · Ogbn-arxiv | total unlearning time (s): 9.90 -> 4.79 | Improved |
| use ETR instead of retraining | unlearning · Reddit | total unlearning time (s): 96.73 -> 54.86 | Improved |
| use COGNAC instead of retraining | unlearning · Reddit | total unlearning time (s): 96.73 -> 197.43 | Hurt |
| use GNNDELETE instead of GCN-based unlearners | unlearning · Cora | inversion attack AUROC: 0.78 vs MEGU 0.53 | Hurt |
| delete high-degree nodes instead of random nodes | GNNDELETE · Cora | fidelity to GOLD: 0.79 -> 0.69 | Hurt |
| delete nodes of the 2nd most frequent class instead of random | GRAPHERASER · Cora | fidelity to GOLD: 0.88 -> 0.74 | Hurt |
| raise unlearn ratio to 0.8 | MEGU/GIF/IDEA · Cora | fidelity and logit distance | Hurt |
Closest papers by meaning
- Erase Then Rectify: A Training-Free Parameter Editing Approach for Cost-Effective Graph Unlearning (AAAI 2025 · similarity 0.94)
- A Cognac Shot To Forget Bad Memories: Corrective Unlearning for Graph Neural Networks (ICML 2025 · similarity 0.93)
- Towards Effective and General Graph Unlearning via Mutual Evolution (AAAI 2024 · similarity 0.92)
- Community-Centric Graph Unlearning (AAAI 2025 · similarity 0.91)
- Efficient Unlearning for Spatio-temporal Graph (Student Abstract) (AAAI 2025 · similarity 0.89)
- Locality-Aware Graph Rewiring in GNNs (ICLR 2024 · similarity 0.88)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
