mlsanityData to 14 Oct 2026

Analytic Drift Resister for Non-Exemplar Continual Graph Learning

arXiv 2604.02633 ↗First posted 3 Apr 2026cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Non-Exemplar Continual Graph Learning (NECGL) seeks to eliminate the privacy risks intrinsic to rehearsal-based paradigms by retaining solely class-level prototype representations rather than raw graph examples for mitigating catastrophic forgetting. However, this design choice inevitably precipitates feature drift. As a nascent alternative, Analytic Continual Learning (ACL) capitalizes on the intrinsic generalization properties of frozen pre-trained models to bolster continual learning performance. Nonetheless, a key drawback resides in the pronounced attenuation of model plasticity. To surmount these challenges, we propose Analytic Drift Resister (ADR), a novel and theoretically grounded NECGL framework. ADR exploits iterative backpropagation to break free from the frozen pre-trained constraint, adapting to evolving task graph distributions and fortifying model plasticity. Since parameter updates trigger feature drift, we further propose Hierarchical Analytic Merging (HAM), performing layer-wise merging of linear transformations in Graph Neural Networks (GNNs) via ridge regression, thereby ensuring absolute resistance to feature drift. On this basis, Analytic Classifier Reconstruction (ACR) enables theoretically zero-forgetting class-incremental learning. Empirical evaluation on four node classification benchmarks demonstrates that ADR maintains strong competitiveness against existing state-of-the-art methods.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 32 of its 51 references that are in the map. First posted on arXiv 3 Apr 2026.

Builds on

32 of 51 references.

References · 32

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Inductive Representation Learning on Large Graphscited by 6,320
  3. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  4. 2016Learning without Forgettingcited by 2,496
  5. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  6. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
  7. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
  8. 2022Editing Models with Task Arithmeticcited by 1,120
  9. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,105
  10. 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
  11. 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
  12. 2021Merging Models with Fisher-Weighted Averagingcited by 621
20 more
  1. 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 521
  2. 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 387
  3. 2019Maintaining Discrimination and Fairness in Class Incremental Learningcited by 283
  4. 2021Graph Condensation for Graph Neural Networkscited by 150
  5. 2022Learning Fast, Learning Slow: A General Continual Learning Method based on Complementary Learning Systemcited by 112
  6. 2022Fusing finetuned models for better pretrainingcited by 110
  7. 2020Overcoming Catastrophic Forgetting in Graph Neural Networkscited by 95
  8. 2024MagMax: Leveraging Model Merging for Seamless Continual Learningcited by 67
  9. 2022Graph Condensation via Receptive Field Distribution Matchingcited by 60
  10. 2022ACIL: Analytic Class-Incremental Learning with Absolute Memorization and Privacy Protectioncited by 57
  11. 2023CaT: Balanced Continual Graph Learning with Graph Condensationcited by 52
  12. 2024Model Merging and Safety Alignment: One Bad Model Spoils the Bunchcited by 43
  13. 2024Elastic Feature Consolidation for Cold Start Exemplar-Free Incremental Learningcited by 37
  14. 2024Exemplar-free Continual Representation Learning via Learnable Drift Compensationcited by 31
  15. 2024DS-AL: A Dual-Stream Analytic Learning for Exemplar-Free Class-Incremental Learningcited by 28
  16. 2024GACL: Exemplar-Free Generalized Analytic Continual Learningcited by 22
  17. 2024Graph Continual Learning with Debiased Lossless Memory Replaycited by 9
  18. 2025Semantic Shift Estimation via Dual-Projection and Classifier Reconstruction for Exemplar-Free Class-Incremental Learningcited by 7
  19. 2024REAL: Representation Enhanced Analytic Learning for Exemplar-free Class-incremental Learningcited by 6
  20. 2025Can LLMs Alleviate Catastrophic Forgetting in Graph Continual Learning? A Systematic Studycited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.