Adversarial Attacks and Defenses on Graph-aware Large Language Models (LLMs)
Iyiola E. Olatunji, Franziska Boenisch, Jing Xu, Adam Dziedzic

TL;DR
This paper investigates the vulnerabilities of graph-aware large language models to adversarial attacks, demonstrating their susceptibility and proposing a combined defense framework to improve robustness against various attack types.
Contribution
It is the first to systematically analyze adversarial attacks on graph-aware LLMs and introduces GALGUARD, an end-to-end defense framework integrating feature correction and structural defenses.
Findings
Node sequence templates increase vulnerability in LLAGA
GNN encoder in GRAPHPROMPTER shows greater robustness
Both models are susceptible to imperceptible feature perturbations
Abstract
Large Language Models (LLMs) are increasingly integrated with graph-structured data for tasks like node classification, a domain traditionally dominated by Graph Neural Networks (GNNs). While this integration leverages rich relational information to improve task performance, their robustness against adversarial attacks remains unexplored. We take the first step to explore the vulnerabilities of graph-aware LLMs by leveraging existing adversarial attack methods tailored for graph-based models, including those for poisoning (training-time attacks) and evasion (test-time attacks), on two representative models, LLAGA (Chen et al. 2024) and GRAPHPROMPTER (Liu et al. 2024). Additionally, we discover a new attack surface for LLAGA where an attacker can inject malicious nodes as placeholders into the node sequence template to severely degrade its performance. Our systematic analysis reveals…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
