Efficient Low-Rank GNN Defense Against Structural Attacks
Abdullah Alchihabi, Qing En, Yuhong Guo

TL;DR
This paper introduces ELR-GNN, an efficient method that learns low-rank and sparse graph structures to defend against adversarial attacks on GNNs, improving robustness and training efficiency.
Contribution
The paper proposes a novel low-rank and sparse graph learning framework for GNN defense, combining SVD initialization with joint optimization for enhanced robustness and efficiency.
Findings
ELR-GNN outperforms existing defense methods in accuracy.
ELR-GNN is more efficient and easier to train.
The method effectively maintains valuable graph information while reducing redundancy.
Abstract
Graph Neural Networks (GNNs) have been shown to possess strong representation abilities over graph data. However, GNNs are vulnerable to adversarial attacks, and even minor perturbations to the graph structure can significantly degrade their performance. Existing methods either are ineffective against sophisticated attacks or require the optimization of dense adjacency matrices, which is time-consuming and prone to local minima. To remedy this problem, we propose an Efficient Low-Rank Graph Neural Network (ELR-GNN) defense method, which aims to learn low-rank and sparse graph structures for defending against adversarial attacks, ensuring effective defense with greater efficiency. Specifically, ELR-GNN consists of two modules: a Coarse Low-Rank Estimation Module and a Fine-Grained Estimation Module. The first module adopts the truncated Singular Value Decomposition (SVD) to initialize…
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
TopicsAdvanced Graph Neural Networks · Advanced Memory and Neural Computing · Machine Learning in Materials Science
MethodsGraph Neural Network · Pruning
