SFR-GNN: Simple and Fast Robust GNNs against Structural Attacks
Graph Neural Networks (GNNs) have demonstrated commendable performance for graph-structured data. Yet, GNNs are often vulnerable to adversarial structural attacks as embedding generation relies on graph topology. Existing efforts are dedicated to purifying the maliciously modified structure or applying adaptive aggregation, thereby enhancing the robustness against adversarial structural attacks. It is inevitable for a defender to consume heavy computational costs due to lacking prior knowledge about modified structures. To this end, we propose an efficient defense method, called Simple and Fast Robust Graph Neural Network (SFR-GNN), supported by mutual information theory. The SFR-GNN first pre-trains a GNN model using node attributes and then fine-tunes it over the modified graph in the manner of contrastive learning, which is free of purifying modified structures and adaptive aggregation, thus achieving great efficiency gains. Consequently, SFR-GNN exhibits a 24%--162% speedup compared to advanced robust models, demonstrating superior robustness for node classification tasks.
Code (0)
등록된 구현이 없습니다.
Tasks
Contrastive LearningGraph Neural NetworkNode ClassificationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Ricci-GNN: Defending Against Structural Attacks Through a Geometric Approach
Graph neural networks (GNNs) rely heavily on the underlying graph topology and thus can be vulnerable to malicious attacks targeting at graph structures. We propose a novel GNN defense algorithm against structural attack…
Mitigating the Structural Bias in Graph Adversarial Defenses
In recent years, graph neural networks (GNNs) have shown great potential in addressing various graph structure-related downstream tasks. However, recent studies have found that current GNNs are susceptible to malicious a…
graph constructionHow does Heterophily Impact the Robustness of Graph Neural Networks? Theoretical Connections and Practical Implications
We bridge two research directions on graph neural networks (GNNs), by formalizing the relation between heterophily of node labels (i.e., connected nodes tend to have dissimilar labels) and the robustness of GNNs to adver…
Rethinking Generative Reconstruction Attacks against Graph Neural Network Models
The application of graph data in numerous disciplines raises the need for gathering and analyzing huge volumes of data, some of which is private and sensitive. The non-Euclidean nature of the graph data makes the analysi…
Graph Neural NetworkDefenseVGAE: Defending against Adversarial Attacks on Graph Data via a Variational Graph Autoencoder
Graph neural networks (GNNs) achieve remarkable performance for tasks on graph data. However, recent works show they are extremely vulnerable to adversarial structural perturbations, making their outcomes unreliable. In …