Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning
Not on the map. Why?
Abstract (arXiv)
Continual Graph Learning(CGL)focuses on acquiring new knowledge while retaining previously learned information, essential for real-world graph applications. Current methods grapple with two main issues:1) The Stability-Plasticity Dilemma: Replay-based methods often create an imbalance between the Dilemma, while incurring significant storage costs.2) The Resource-Heavy Pre-training: Leading replay-free methods critically depend on extensively pre-trained backbones, this reliance imposes a substantial resource burden.In this paper, we argue that the key to overcoming these challenges lies not in replaying data or fine-tuning the entire network, but in dynamically modulating the internal computational flow of a frozen backbone. We posit that lightweight, task-specific modules can effectively steer a GNN's reasoning process. Motivated by this insight, we propose Task-Aware Adaptive Modulation(TAAM), a replay-free, resource-efficient approach that charts a new path for navigating the stability-plasticity dilemma. TAAM's core is its Neural Synapse Modulators(NSM), which are trained and then frozen for each task to store expert knowledge. A pivotal prototype-guided strategy governs these modulators: 1) For training, it initializes a new NSM by deep-copying from a similar past modulator to boost knowledge transfer. 2) For inference, it selects the most relevant frozen NSM for each task. These NSMs insert into a frozen GNN backbone to perform fine-grained, node-attentive modulation of its internal flow-different from the static perturbations of prior methods. Extensive experiments show that TAAM comprehensively outperforms state-of-the-art methods across six GCIL benchmark datasets. The code will be released upon acceptance of the paper.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 16 of its 32 references that are in the map. First posted on arXiv 31 Aug 2025.
Builds on
16 of 32 references.
References · 16
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
- 2016Learning without Forgettingcited by 2,496
- 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,234
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
- 2019Simplifying Graph Convolutional Networkscited by 1,477
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
- 2023CaT: Balanced Continual Graph Learning with Graph Condensationcited by 52
- 2023Continual Learning on Dynamic Graphs via Parameter Isolationcited by 36
- 2020Lifelong Graph Learningcited by 31
4 more
- 2024Beyond Prompt Learning: Continual Adapter for Efficient Rehearsal-Free Continual Learningcited by 29
- 2024Towards Robust Graph Incremental Learning on Evolving Graphscited by 18
- 2024Continual Learning on Graphs: A Surveycited by 12
- 2023PUMA: Efficient Continual Graph Learning for Node Classification with Graph Condensationcited by 9
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026TAAM:Inductive Graph-Class Incremental Learning with Task-Aware Adaptive Modulation
- 2025HERO: Preserving Structure and Semantics in Heterogeneous Continual Graph Learning
- 2026MAEM: Mitigating Recency Bias via a Replay-Free, Capacity-Controlled Dynamic Mixture of Experts for Class-Incremental Graph Learning
- 2026SAOT: Self-Supervised Continual Graph Learning with Structure-Aware Optimal Transport
- 2024Graph Memory Learning: Imitating Lifelong Remembering and Forgetting of Brain Networks
- 2025Efficient Graph Knowledge Distillation from GNNs to Kolmogorov--Arnold Networks via Self-Attention Dynamic Sampling
- 2025A Generative Adaptive Replay Continual Learning Model for Temporal Knowledge Graph Reasoning
- 2026Continual Learning in Modern Hopfield Networks with an Application to Diffusion Models