通过评估鲁棒性来剪枝图结构,提升GNN抗攻击能力
Pruning Graphs by Adversarial Robustness Evaluation to Strengthen GNN Defenses
- 用鲁棒性评分指导剪枝,识别并移除脆弱边
- 在高扰动下显著增强GNN防御能力
- 适用于需要强鲁棒性的图神经网络场景
图神经网络(GNN)凭借对节点特征与图拓扑关系信息的联合建模,成为图结构数据学习的主流方法。然而,这种联合建模也引入了关键弱点:结构或特征中的扰动会通过消息传递被放大,导致GNN极易受到对抗攻击和虚假连接的影响。本文提出一种基于对抗鲁棒性评估的剪枝框架,显式识别并移除图中脆弱或有害的组件。通过以鲁棒性得分作为指导,该方法选择性地剪除最可能降低模型可靠性的边,从而生成更清洁、更鲁棒的图表示。我们在三种典型的GNN架构上实现了该框架,并在多个基准数据集上进行了广泛实验。结果表明,该方法在高扰动环境下能显著提升GNN的防御能力。
原文摘要 · Abstract (English)
Graph Neural Networks (GNNs) have emerged as a dominant paradigm for learning on graph-structured data, thanks to their ability to jointly exploit node features and relational information encoded in the graph topology. This joint modeling, however, also introduces a critical weakness: perturbations or noise in either the structure or the features can be amplified through message passing, making GNNs highly vulnerable to adversarial attacks and spurious connections. In this work, we introduce a pruning framework that leverages adversarial robustness evaluation to explicitly identify and remove fragile or detrimental components of the graph. By using robustness scores as guidance, our method selectively prunes edges that are most likely to degrade model reliability, thereby yielding cleaner and more resilient graph representations. We instantiate this framework on three representative GNN architectures and conduct extensive experiments on benchmarks. The experimental results show that our approach can significantly enhance the defense capability of GNNs in the high-perturbation regime.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。