系统评估文本图模型在攻击下的鲁棒性,发现文本与结构鲁棒性存在权衡。
Robustness in Text-Attributed Graph Learning: Insights, Trade-offs, and New Defenses
- 构建统一框架,测试多种模型在文本、结构及混合攻击下的表现
- 发现GNNs对文本编码器和攻击类型敏感,GraphLLMs易受训练数据污染
- 提出SFT-auto框架,实现文本与结构攻击的均衡防御
尽管图神经网络(GNNs)和大语言模型(LLMs)在文本属性图(TAGs)学习中表现强大,但其鲁棒性的全面理解仍不充分。现有评估零散,未能系统分析文本与结构扰动在不同模型和攻击场景中的影响。为此,本文提出一个统一且全面的评估框架,涵盖十大数据集(来自四个领域)、四种经典GNN、鲁棒GNN(RGNNs)和GraphLLMs,在文本、结构及混合扰动下,分别于投毒与逃避攻击场景中进行测试。分析揭示三个关键发现:1)模型在文本与结构鲁棒性之间存在固有权衡;2)GNN与RGNN性能高度依赖文本编码器与攻击类型;3)GraphLLMs特别易受训练数据污染。为克服该权衡,我们提出SFT-auto框架,单模型内实现对文本与结构攻击的优异且均衡的鲁棒性。本工作为未来文本属性图安全研究奠定基础,并提供实际解决方案。代码已开源:https://github.com/Leirunlin/TGRB。
原文摘要 · Abstract (English)
While Graph Neural Networks (GNNs) and Large Language Models (LLMs) are powerful approaches for learning on Text-Attributed Graphs (TAGs), a comprehensive understanding of their robustness remains elusive. Current evaluations are fragmented, failing to systematically investigate the distinct effects of textual and structural perturbations across diverse models and attack scenarios. To address these limitations, we introduce a unified and comprehensive framework to evaluate robustness in TAG learning. Our framework evaluates classical GNNs, robust GNNs (RGNNs), and GraphLLMs across ten datasets from four domains, under diverse text-based, structure-based, and hybrid perturbations in both poisoning and evasion scenarios. Our extensive analysis reveals multiple findings, among which three are particularly noteworthy: 1) models have inherent robustness trade-offs between text and structure, 2) the performance of GNNs and RGNNs depends heavily on the text encoder and attack type, and 3) GraphLLMs are particularly vulnerable to training data corruption. To overcome the identified trade-offs, we introduce SFT-auto, a novel framework that delivers superior and balanced robustness against both textual and structural attacks within a single model. Our work establishes a foundation for future research on TAG security and offers practical solutions for robust TAG learning in adversarial environments. Our code is available at: https://github.com/Leirunlin/TGRB.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。