Towards Inductive Robustness: Distilling and Fostering Wave-Induced Resonance in Transductive GCNs against Graph Adversarial Attacks
Ao Liu, Wenshan Li, Tao Li, Beibei Li, Hanyuan Huang, Pan Zhou
摘要
Graph neural networks (GNNs) have recently been shown to be vulnerable to adversarial attacks, where slight perturbations in the graph structure can lead to erroneous predictions. However, current robust models for defending against such attacks inherit the transductive limitations of graph convolutional networks (GCNs). As a result, they are constrained by fixed structures and do not naturally generalize to unseen nodes. Here, we discover that transductive GCNs inherently possess a distillable robustness, achieved through a wave-induced resonance process. Based on this, we foster this resonance to facilitate inductive and robust learning. Specifically, we first prove that the signal formed by GCN-driven message passing (MP) is equivalent to the edge-based Laplacian wave, where, within a wave system, resonance can naturally emerge between the signal and its transmitting medium. This resonance provides inherent resistance to malicious perturbations inflicted on the signal system. We then prove that merely three MP iterations within GCNs can induce signal resonance between nodes and edges, manifesting as a coupling between nodes and their distillable surrounding local subgraph. Consequently, we present Graph Resonance-fostering Network (GRN) to foster this resonance via learning node representations from their distilled resonating subgraphs. By capturing the edge-transmitted signals within this subgraph and integrating them with the node signal, GRN embeds these combined signals into the central node's representation. This node-wise embedding approach allows for generalization to unseen nodes. We validate our theoretical findings with experiments, and demonstrate that GRN generalizes robustness to unseen nodes, whilst maintaining state-of-the-art classification accuracy on perturbed graphs. Appendices can be found on arXiv version: https://arxiv.org/abs/2312.08651
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper3
- When Witnesses Defend: A Witness Graph Topological Layer for Adversarial Graph LearningNaheed Anjum Arafat, Debabrota Basu, Yulia Gel, Yuzhou ChenAAAI 2025 · 被引用 6 次
- Graph Agent Network: Empowering Nodes with Inference Capabilities for Adversarial ResilienceAo Liu, Wenshan Li, Tao Li, Beibei Li 等AAAI 2025 · 被引用 2 次
- Grimm: A Plug-and-Play Perturbation Rectifier for Graph Neural Networks Defending Against Poisoning AttacksAo Liu, Wenshan Li, Beibei Li, Wengang Ma 等AAAI 2025 · 被引用 1 次
它引用的顶会 Paper4
- Graph Structure Learning for Robust Graph Neural NetworksWei Jin, Yao Ma, Xiaorui Liu, Xianfeng Tang 等KDD 2020 · 被引用 604 次
- Elastic Graph Neural NetworksXiaorui Liu, Wei Jin, Yao Ma, Yaxin Li 等ICML 2021 · 被引用 128 次
- Reliable Representations Make A Stronger Defender: Unsupervised Structure Refinement for Robust GNNKuan Li, Yang Liu, Xiang Ao, Jianfeng Chi 等KDD 2022 · 被引用 63 次
- Unsupervised Graph Poisoning Attack via Contrastive Loss Back-propagationSixiao Zhang, Hongxu Chen, Xiangguo Sun, Yicong Li 等WWW 2022 · 被引用 52 次
相关 Paper
- Power up! Robust Graph Convolutional Network via Graph PoweringMing Jin, Heng Chang, Wenwu Zhu, Somayeh SojoudiAAAI 2021 · 被引用 31 次
- Towards Generalization Bounds of GCNs for Adversarially Robust Node ClassificationWen Wen, Han Li, Tieliang Gong, Hong ChenICLR 2025
- Not All Low-Pass Filters are Robust in Graph Convolutional NetworksHeng Chang, Yu Rong, Tingyang Xu, Yatao Bian 等NeurIPS 2021 · 被引用 65 次
- Robust Mid-Pass Filtering Graph Convolutional NetworksJincheng Huang, Lun Du, Xu Chen, Qiang Fu 等WWW 2023 · 被引用 57 次
- Provably Robust Explainable Graph Neural Networks against Graph Perturbation AttacksJiate Li, Meng Pang, Yun Dong, Jinyuan Jia 等ICLR 2025
