ADEdgeDrop: Adversarial Edge Dropping for Robust Graph Neural Networks
Zhaoliang Chen, Zhihao Wu, Ylli Sadikaj, Claudia Plant, Hong-Ning Dai,, Shiping Wang, Yiu-Ming Cheung, Wenzhong Guo

TL;DR
This paper introduces ADEdgeDrop, an adversarial edge-dropping technique for GNNs that enhances robustness and generalization by intelligently removing edges guided by an adversarial predictor, outperforming existing methods.
Contribution
The paper proposes a novel adversarial edge-dropping method using an edge predictor based on line graphs, improving robustness and interpretability in GNN training.
Findings
Outperforms state-of-the-art baselines on six benchmark datasets.
Enhances GNN robustness against noisy and redundant data.
Improves generalization across various GNN architectures.
Abstract
Although Graph Neural Networks (GNNs) have exhibited the powerful ability to gather graph-structured information from neighborhood nodes via various message-passing mechanisms, the performance of GNNs is limited by poor generalization and fragile robustness caused by noisy and redundant graph data. As a prominent solution, Graph Augmentation Learning (GAL) has recently received increasing attention. Among prior GAL approaches, edge-dropping methods that randomly remove edges from a graph during training are effective techniques to improve the robustness of GNNs. However, randomly dropping edges often results in bypassing critical edges, consequently weakening the effectiveness of message passing. In this paper, we propose a novel adversarial edge-dropping method (ADEdgeDrop) that leverages an adversarial edge predictor guiding the removal of edges, which can be flexibly incorporated…
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.
Taxonomy
TopicsAdversarial Robustness in Machine Learning
