Robustness Inspired Graph Backdoor Defense
원문 초록
Graph Neural Networks (GNNs) have achieved promising results in tasks such as node classification and graph classification. However, recent studies reveal that GNNs are vulnerable to backdoor attacks, posing a significant threat to their real-world adoption. Despite initial efforts to defend against specific graph backdoor attacks, there is no work on defending against various types of backdoor attacks where generated triggers have different properties. Hence, we first empirically verify that prediction variance under edge dropping is a crucial indicator for identifying poisoned nodes. With this observation, we propose using random edge dropping to detect backdoors and theoretically show that it can efficiently distinguish poisoned nodes from clean ones. Furthermore, we introduce a novel robust training strategy to efficiently counteract the impact of the triggers. Extensive experiments on real-world datasets show that our framework can effectively identify poisoned nodes, significantly degrade the attack success rate, and maintain clean accuracy when defending against various types of graph backdoor attacks with different properties.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Improving the Effective Receptive Field of Message-Passing Neural Networks
Scalable Graph Generative Modeling via Substructure Sequences
Efficient Mixed Precision Quantization in Graph Neural Networks
Graph Fourier Transformer with Structure-Frequency Information
Unlocking the Potential of Classic GNNs for Graph-level Tasks: Simple Architectures Meet Excellence
Beyond Message Passing: Neural Graph Pattern Machine
토론
이 논문과 연결된 포럼 글이 아직 없습니다.