Graph Defense Diffusion Model
Xin He, Wenqi Fan, Yili Wang, Chengyi Liu, Rui Miao, Xin Juan, Xin Wang

TL;DR
The paper introduces GDDM, a diffusion-based graph purification model that effectively defends against multiple adversarial attacks by iteratively removing noise and restoring graph structures, outperforming existing methods.
Contribution
GDDM is a novel, flexible diffusion model-based approach that enhances graph defense by modeling attack processes and improving scalability across datasets.
Findings
GDDM outperforms state-of-the-art defenses on three real-world datasets.
It effectively defends against targeted and non-targeted adversarial attacks.
The model demonstrates strong scalability and transferability across datasets.
Abstract
Graph Neural Networks (GNNs) are highly vulnerable to adversarial attacks, which can greatly degrade their performance. Existing graph purification methods attempt to address this issue by filtering attacked graphs. However, they struggle to defend effectively against multiple types of adversarial attacks (e.g., targeted attacks and non-targeted attacks) simultaneously due to limited flexibility. Additionally, these methods lack comprehensive modeling of graph data, relying heavily on heuristic prior knowledge. To overcome these challenges, we introduce the Graph Defense Diffusion Model (GDDM), a flexible purification method that leverages the denoising and modeling capabilities of diffusion models. The iterative nature of diffusion models aligns well with the stepwise process of adversarial attacks, making them particularly suitable for defense. By iteratively adding and removing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
