BadGCL: Towards Persistent Backdoor Attack on Graph Continual Learning Systems

Dong Li, Yufei Han, Xintao Wu, Xujiang Zhao, Wei Cheng, Chen ZhaoarXiv 2026 · arXiv

TL;DR

Researchers have uncovered a "Persistence Paradox" in Graph Continual Learning (GCL): the very mechanisms designed to prevent models from forgetting old tasks can be hijacked to make malicious backdoors permanent. By aligning a backdoor's influence with a model’s "important" knowledge, the proposed BadGCL framework creates structural triggers that survive dozens of sequential updates, even when the attacker only intervenes during the very first task.

What Problem Does This Paper Address?

Machine learning models are increasingly deployed in dynamic environments where they must learn from a stream of data—a paradigm known as Continual Learning (CL). In the context of graphs (social networks, molecular structures, etc.), Graph Continual Learning (GCL) aims to update Graph Neural Networks (GNNs) on new tasks without losing performance on previous ones (avoiding "catastrophic forgetting").

Security researchers have long studied backdoor attacks, where an attacker poisons training data with a "trigger" (like a specific subgraph) that causes the model to misclassify inputs whenever that trigger is present. Traditionally, it was believed that continual learning naturally "cleanses" these backdoors; as the model updates to learn new tasks, the old, malicious associations should theoretically fade away.

This paper challenges that "false sense of security." The authors investigate whether an attacker can create a backdoor so deeply compatible with the model's core knowledge that the GCL system's own "anti-forgetting" mechanisms actively work to preserve the attack.

Methods

The authors introduce BadGCL, a model-agnostic framework designed to implant persistent backdoors during a strict "early-stage intervention" (poisoning only the first task). The method relies on three key technical pillars:

  1. Gradient Mutual Information (MI) Objective: This is the core innovation. Instead of just training the model to recognize a trigger, BadGCL optimizes the trigger so that its gradient (the direction the model needs to change to learn it) is statistically "compatible" with the clean task's gradient. If the GCL system decides that the clean task's information is worth saving, it inadvertently saves the backdoor as well.
  2. Propagation Consistency: GNNs work by passing messages between nodes across multiple layers. BadGCL ensures that the "representation shift" caused by the trigger remains stable across these layers, making the backdoor robust to the structural changes that occur during continual updates.
  3. Learnable Topology-Aware Triggers: Rather than using a fixed, hard-coded subgraph, BadGCL learns an optimal trigger structure. It uses a Structure Regularization term to keep the trigger sparse and stealthy, ensuring it doesn't stand out to topological defense algorithms.

Datasets

The framework was evaluated on four standard GCL benchmarks, ranging from small-scale citation networks to large-scale social and product graphs:

  • CoraFull: 35 tasks (70 classes).
  • OGB-Arxiv: 20 tasks (40 classes).
  • Reddit: 20 tasks (40 classes).
  • OGB-Products: 23 tasks (47 classes).

Key Insights and Ideas

  • The Persistence Paradox: The authors demonstrate that stability is a double-edged sword. Mechanisms like "experience replay" (rehearsing old data) or "parameter isolation" (freezing important weights) are the primary reasons these backdoors become permanent.
  • "Free-Riding" on Anti-Forgetting: A well-optimized backdoor doesn't fight the model's update process; it "free-rides" on it. By making the poisoned update look like a protected structural signal, the attacker forces the victim system to act as the backdoor's guardian.
  • Structural vs. Feature Triggers: The paper highlights that structural triggers (changing how nodes connect) are far more dangerous in GCL than feature-based triggers (changing node attributes) because they fundamentally rewire the GNN's computation graph.

Key Results

BadGCL was tested against various GCL strategies (replay-based, regularization-based, and isolation-based) and significantly outperformed existing graph and CL backdoor baselines:

  • Persistence: On the Reddit dataset, while traditional attacks saw their Attack Success Rate (ASR) collapse as tasks accumulated, BadGCL maintained an ASR of over 95% even after 20 tasks.
  • Stealth: The attack caused minimal degradation in Average Accuracy (AA) on clean data, often staying within 1% of a non-poisoned model.
  • Defense Robustness: BadGCL remained effective against five representative graph-backdoor defenses, including AGNNCert and A²GBD, proving that its structural regularization makes the triggers difficult to prune or detect.

Limitations and Future Work

While BadGCL is highly effective, the authors note some boundaries:

  • Early-Stage Constraint: The current study focuses on poisoning the first task. While the authors show that "revisiting" the poisoned task can re-consolidate the backdoor, they haven't fully explored attacks that begin in the middle of a long task stream.
  • Defense Gap: The paper concludes that current GCL defenses are blind to this vulnerability. Future work is needed to develop "backdoor-aware" GCL mechanisms that can distinguish between benign historical knowledge and malicious structural associations.
  • Graph Complexity: The study focuses on node classification; extending this to link prediction or graph-level classification remains an open area for research.

Summary updated

Abstract

Backdoor attacks pose a persistent security threat to machine learning systems, yet their behavior under graph continual learning (GCL) remains underexplored. Conventional graph backdoor attacks often lose effectiveness as models are updated across successive tasks, creating the impression that continual updates naturally weaken malicious associations. This work reveals a contrasting vulnerability: knowledge-preservation mechanisms in GCL can also preserve early injected backdoors when the poisoned update is compatible with the clean-task signal being retained. For graph data, this risk is amplified by structural triggers, which are embedded into the message-passing paths of graph neural networks (GNNs) and can induce stable representation shifts across tasks. To expose this risk, we propose BadGCL, a model-agnostic framework for persistent backdoor attacks under a strict early-stage intervention setting. BadGCL learns topology-aware structural triggers using a gradient mutual-information objective that couples poisoned gradients with clean-task optimization signals, together with a propagation consistency objective that stabilizes trigger-induced effects through graph message passing. We provide theoretical analysis showing that gradient compatibility and propagation stability jointly support long-term backdoor persistence under benign continual updates. Extensive experiments across task-IL and class-IL protocols, four GCL benchmarks, and diverse victim systems show that BadGCL achieves persistent attack effectiveness with limited clean-utility degradation, substantially outperforming graph and continual-learning backdoor baselines and remaining robust against representative defenses.
BibTeX
@misc{li2026badgcl,
  author = {Dong Li and Yufei Han and Xintao Wu and Xujiang Zhao and Wei Cheng and Chen Zhao},
  title = {{BadGCL: Towards Persistent Backdoor Attack on Graph Continual Learning Systems}},
  year = {2026},
  eprint = {2611.19656},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.19656},
}
Figure