Lethe: Link Inference Attacks For Evaluation of Edge Unlearning Methods
To address this gap, we introduce Lethe, the first comprehensive benchmark for Edge Unlearning, featuring 15 methods and 8 datasets.
ProofPaper ↗
Key points
- Graph Unlearning (GU) aims to remove the influence of specific training data from a Graph Neural Network without retraining anew.
- While most methods address removal of nodes and features, Edge Unlearning (EU), aiming at forgetting edges, has recently attracted dedicated attention as a standalone problem due to the hardness of completely removing the impact of an edge in the model.
- As such, we show two systematic limitations in existing evaluations: dedicated EU methods can be slower than retraining anew, and accuracy metrics are uninformative due to the negligible impact of edge removal.
- Our benchmark emphasizes large graphs, introduces evaluation tasks of varying difficulty, and proposes empirical measures based on link inference attacks rather than proxy accuracy metrics.
Sources (1)
- [1]Lethe: Link Inference Attacks For Evaluation of Edge Unlearning MethodsarXiv (AI, ML, NLP, CV, robotics, multi-agent) · Oct 15, 01:41 PM
To address this gap, we introduce Lethe, the first comprehensive benchmark for Edge Unlearning, featuring 15 methods and 8 datasets.
Graph Unlearning (GU) aims to remove the influence of specific training data from a Graph Neural Network without retraining anew.
Extractive summary: sentences quoted from the sources.
Before this
- Oct 15, 2026I didn't do it, I did something else that might be even better
- Oct 15, 2026StepFun Releases Step 5 Preview Open Weights: 600B MoE, 27B Active, 1M Context
- Oct 14, 2026Video to surface normals-map with NormalCrafter
- Oct 14, 2026GPT-Image-style photo editing on your own GPU (12 GB+): I built a zero-setup app for Qwen-Image 2.1 on stable-diffusion.cpp
- Oct 14, 2026Dynamic Graph World Modelling: Learning Future Dynamics from Temporal Context
- Oct 13, 2026Comfy-Org/ComfyUI v0.40.0