AGNNCert: Defending Graph Neural Networks against Arbitrary Perturbations with Deterministic Certification
Not on the map. Why?
Abstract (arXiv)
Graph neural networks (GNNs) achieve the state-of-the-art on graph-relevant tasks such as node and graph classification. However, recent works show GNNs are vulnerable to adversarial perturbations include the perturbation on edges, nodes, and node features, the three components forming a graph. Empirical defenses against such attacks are soon broken by adaptive ones. While certified defenses offer robustness guarantees, they face several limitations: 1) almost all restrict the adversary's capability to only one type of perturbation, which is impractical; 2) all are designed for a particular GNN task, which limits their applicability; and 3) the robustness guarantees of all methods except one are not 100% accurate. We address all these limitations by developing AGNNCert, the first certified defense for GNNs against arbitrary (edge, node, and node feature) perturbations with deterministic robustness guarantees, and applicable to the two most common node and graph classification tasks. AGNNCert also encompass existing certified defenses as special cases. Extensive evaluations on multiple benchmark node/graph classification datasets and two real-world graph datasets, and multiple GNNs validate the effectiveness of AGNNCert to provably defend against arbitrary perturbations. AGNNCert also shows its superiority over the state-of-the-art certified defenses against the individual edge perturbation and node perturbation.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 2 Feb 2025.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 4.
4 papers.
- 2025Backdoor Attacks on Discrete Graph Diffusion Modelscited by 3
- 2025Deterministic Certification of Graph Neural Networks against Graph Poisoning Attacks with Arbitrary Perturbationscited by 2
- 2025AuditVotes: Elevating Provable Defense for GNNs with Efficient Augmentation and Conditional Smoothingcited by 2
- 2025Provably Robust Adaptation for Language-Empowered Foundation Modelscited by 0
- 2025Provably Robust Adaptation for Language-Empowered Foundation Models9 Oct 2025
- 2025AuditVotes: Elevating Provable Defense for GNNs with Efficient Augmentation and Conditional Smoothing29 Mar 2025
- 2025Deterministic Certification of Graph Neural Networks against Graph Poisoning Attacks with Arbitrary Perturbations24 Mar 2025
- 2025Backdoor Attacks on Discrete Graph Diffusion Models8 Mar 2025