用大模型生成通用攻击,让文本图模型性能下降76.3%
Can LLMs Fool Graph Learning? Exploring Universal Adversarial Attacks on Text-Attributed Graphs
- 借大模型理解图常识,同时篡改节点文本和拓扑结构
- 在多种模型上实现通用攻击,最高使性能下降76.3%
- 适合研究图学习安全性的研究人员参考
文本属性图(TAGs)通过融合节点的丰富文本语义与拓扑结构,提升了图学习的表达能力。然而,这种增强也带来了新的安全漏洞——基于文本的对抗攻击面。当前方法采用图神经网络(GNNs)和预训练语言模型(PLMs)等多样化骨干网络来捕捉文本与结构信息,这引发了关键问题:如何设计跨架构的通用对抗攻击以评估标签模型的安全性?挑战在于,不同骨干网络(如GNN与PLM)对图模式的感知与编码方式差异巨大,且多数PLM仅可通过API访问,导致攻击只能在黑盒环境下进行。为此,我们提出BadGraph框架,深度利用大语言模型(LLMs)对通用图知识的理解,联合扰动节点拓扑与文本语义。具体地,设计目标影响者检索模块,借助图先验构建跨模态对齐的攻击捷径,从而实现高效的基于LLM的扰动推理。实验表明,BadGraph在多种基于GNN和LLM的推理器上均实现了通用有效攻击,最高可导致76.3%的性能下降;理论与实证分析进一步验证了其隐蔽且可解释的特性。
原文摘要 · Abstract (English)
Text-attributed graphs (TAGs) enhance graph learning by integrating rich textual semantics and topological context for each node. While boosting expressiveness, they also expose new vulnerabilities in graph learning through text-based adversarial surfaces. Recent advances leverage diverse backbones, such as graph neural networks (GNNs) and pre-trained language models (PLMs), to capture both structural and textual information in TAGs. This diversity raises a key question: How can we design universal adversarial attacks that generalize across architectures to assess the security of TAG models? The challenge arises from the stark contrast in how different backbones-GNNs and PLMs-perceive and encode graph patterns, coupled with the fact that many PLMs are only accessible via APIs, limiting attacks to black-box settings. To address this, we propose BadGraph, a novel attack framework that deeply elicits large language models (LLMs) understanding of general graph knowledge to jointly perturb both node topology and textual semantics. Specifically, we design a target influencer retrieval module that leverages graph priors to construct cross-modally aligned attack shortcuts, thereby enabling efficient LLM-based perturbation reasoning. Experiments show that BadGraph achieves universal and effective attacks across GNN- and LLM-based reasoners, with up to a 76.3% performance drop, while theoretical and empirical analyses confirm its stealthy yet interpretable nature.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。