mlsanityData to 14 Oct 2026

TAAM:Inductive Graph-Class Incremental Learning with Task-Aware Adaptive Modulation

arXiv 2602.08036 ↗First posted 8 Feb 2026cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Graph Continual Learning (GCL) aims to solve the challenges of streaming graph data. However, current methods often depend on replay-based strategies, which raise concerns like memory limits and privacy issues, while also struggling to resolve the stability-plasticity dilemma. In this paper, we suggest that lightweight, task-specific modules can effectively guide the reasoning process of a fixed GNN backbone. Based on this idea, we propose Task-Aware Adaptive Modulation (TAAM). The key component of TAAM is its lightweight Neural Synapse Modulators (NSMs). For each new task, a dedicated NSM is trained and then frozen, acting as an "expert module." These modules perform detailed, node-attentive adaptive modulation on the computational flow of a shared GNN backbone. This setup ensures that new knowledge is kept within compact, task-specific modules, naturally preventing catastrophic forgetting without using any data replay. Additionally, to address the important challenge of unknown task IDs in real-world scenarios, we propose and theoretically prove a novel method named Anchored Multi-hop Propagation (AMP). Notably, we find that existing GCL benchmarks have flaws that can cause data leakage and biased evaluations. Therefore, we conduct all experiments in a more rigorous inductive learning scenario. Extensive experiments show that TAAM comprehensively outperforms state-of-the-art methods across eight datasets. Code and Datasets are available at: https://github.com/1iuJT/TAAM_AAMAS2026.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 24 of its 38 references that are in the map. First posted on arXiv 8 Feb 2026.

Builds on

24 of 38 references.

References · 24

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Inductive Representation Learning on Large Graphscited by 6,320
  3. 2019Parameter-Efficient Transfer Learning for NLPcited by 4,236
  4. 2016Learning without Forgettingcited by 2,496
  5. 2017FiLM: Visual Reasoning with a General Conditioning Layercited by 2,333
  6. 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,234
  7. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  8. 2019Simplifying Graph Convolutional Networkscited by 1,477
  9. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,105
  10. 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 993
  11. 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
  12. 2015Image-based Recommendations on Styles and Substitutescited by 706
12 more
  1. 2020SIGN: Scalable Inception Graph Neural Networkscited by 284
  2. 2023One for All: Towards Training One Graph Model for All Classification Taskscited by 243
  3. 2022Universal Prompt Tuning for Graph Neural Networkscited by 100
  4. 2020Overcoming Catastrophic Forgetting in Graph Neural Networkscited by 95
  5. 2019GNN-FiLM: Graph Neural Networks with Feature-wise Linear Modulationcited by 75
  6. 2023CaT: Balanced Continual Graph Learning with Graph Condensationcited by 52
  7. 2023Continual Learning on Dynamic Graphs via Parameter Isolationcited by 36
  8. 2024Beyond Prompt Learning: Continual Adapter for Efficient Rehearsal-Free Continual Learningcited by 29
  9. 2024Towards Robust Graph Incremental Learning on Evolving Graphscited by 18
  10. 2024Topology-aware Embedding Memory for Continual Learning on Expanding Networkscited by 14
  11. 2024Continual Learning on Graphs: A Surveycited by 12
  12. 2024Graph Continual Learning with Debiased Lossless Memory Replaycited by 9

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2025Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning
  2. 2024An Efficient Memory Module for Graph Few-Shot Class-Incremental Learning
  3. 2023Heterogeneous Continual Learning
  4. 2024TinySubNets: An efficient and low capacity continual learning strategy
  5. 2024Continual Learning with Neuromorphic Computing: Foundations, Methods, and Emerging Applications
  6. 2026SAOT: Self-Supervised Continual Graph Learning with Structure-Aware Optimal Transport
  7. 2025HERO: Preserving Structure and Semantics in Heterogeneous Continual Graph Learning
  8. 2025Efficient Graph Knowledge Distillation from GNNs to Kolmogorov--Arnold Networks via Self-Attention Dynamic Sampling