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