用提示学习让防御知识跨域迁移,提升图神经网络抗攻击能力。
Let Prompts Bridge Defense Knowledge: Transferable Graph Purification via Vulnerability-Aware GPL

- 通过漏洞感知提示注入,实现防御知识的跨域迁移。
- 相比现有方法提升1%-9%性能,推理速度加快最多2.2倍。
- 适合需要快速部署通用图对抗防御的工业场景。
图神经网络(GNN)已成为表示多模态任务中复杂关系依赖的核心技术,尤其在跨平台用户兴趣建模与跨模态语义对齐中表现突出。现实中亟需有效的图对抗扰动防御机制。然而,当前主流净化方法本质上是领域受限的防御策略,存在两大问题:(1) 单一领域数据结构与语义多样性不足,难以学习鲁棒净化准则;(2) 从零训练特定领域防御策略消耗大量计算资源。为此,本文提出可迁移的图净化方案ProGAP,通过漏洞感知图提示学习桥接对抗防御知识。首先,在数据丰富的图上联合建模拓扑与语义信息,预训练一个扰动捕获边检测器以捕捉普遍对抗模式;随后,设计漏洞感知提示,在下游图中向偏差节点注入定向净化引导,使预训练检测器无需大量参数更新即可适应分布偏移。实验表明,相较于先进基线方法,ProGAP实现1%-9%的性能提升,时间开销减少最多2.2倍。ProGAP代码已公开于https://github.com/Lieyoufffff/ProGAP。
原文摘要 · Abstract (English)
Graph Neural Networks (GNNs) have emerged as a cornerstone for representing complex relational dependencies in diverse multimedia tasks, particularly in cross-platform user interest modeling and cross-modal semantic alignment. In the real world, a practical defense against graph adversarial perturbations is needed. However, we observe that the prevailing adversarial purification methods are essentially domain-restricted defenses, which leads to the following shortcomings: (1) single-domain data provides insufficient structural and semantic diversity for learning robust purification criteria; (2) training of domain-specific defense strategies from scratch consumes substantial computational cost. To address the above limitations, we propose a transferable graph purification scheme, named ProGAP, to bridge adversarial defense knowledge via vulnerability-aware graph prompt learning. Firstly, to capture universal adversarial patterns, a perturbation-capture edge detector is pretrained on data-rich graphs by jointly modeling topological and semantic information. Subsequently, to achieve more knowledge transfer w.r.t. robustness, vulnerability-aware prompts are designed that inject targeted purification guidance into biased nodes, during which the pretrained detector adapts to distribution shifts in downstream graphs without parameter-laborious updates. Experimental results demonstrate that compared with state-of-the-art baselines, our ProGAP achieves 1%-9% improvement, and reduces the time consumption by up to 2.2x. The code for ProGAP is available at https://github.com/Lieyoufffff/ProGAP.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。