mlsanityData to 14 Oct 2026

MAGIC: Topology-Aware Analytic Graph Few-Shot Class-Incremental Learning

arXiv 2610.04963 ↗First posted 4 Oct 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Graph few-shot class-incremental learning (GFSCIL) requires a model to continually recognize emerging classes from only a few labeled nodes while preserving previously acquired knowledge. Beyond the catastrophic forgetting inherited from conventional graph continual learning, GFSCIL presents two distinctive challenges: extremely limited novel-class supervision causes severe overfitting, while cross-session edges---edges connecting newly arriving nodes with historical nodes---alter historical propagation neighborhoods and thereby induce representation drift. We propose MAGIC, a replay-free GFSCIL framework that combines a frozen graph representation backbone (e.g., an intrinsically parameter-free backbone such as SGC or a pretrained graph foundation model) with closed-form analytic continual learning. To alleviate novel-session overfitting, MAGIC learns a topological prior from the base graph that can characterize both homophilous and heterophilous relations, and injects this prior through Potts Markov random field inference to refine supervision for novel classes. To mitigate representation drift, MAGIC transfers previous predictions from the old representations of affected historical nodes to their updated representations through drift-aware analytic distillation. Experiments across five datasets and eight baselines demonstrate the effectiveness of MAGIC. Under the 5-shot setting, MAGIC improves Mean Accuracy and Final Accuracy by 5.48 percentage points and 9.33 percentage points on average, and reduces Performance Drop by 10.78 percentage points on average compared with the best baselines. MAGIC also shows clear advantages under the 1- and 3-shot settings, with larger gains as the number of supports increases. Moreover, MAGIC requires substantially less training time.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 29 of its 37 references that are in the map. First posted on arXiv 4 Oct 2026.

Builds on

29 of 37 references.

References · 29

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  3. 2017Graph Attention Networkscited by 8,923
  4. 2017Inductive Representation Learning on Large Graphscited by 6,320
  5. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  6. 2016Learning without Forgettingcited by 2,496
  7. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  8. 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,105
  9. 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
  10. 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 993
  11. 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 335
  12. 2020Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networkscited by 260
17 more
  1. 2020Few-Shot Class-Incremental Learningcited by 251
  2. 2021Few-Shot Incremental Learning with Continually Evolved Classifierscited by 187
  3. 2022Forward Compatible Few-Shot Class-Incremental Learningcited by 127
  4. 2020Overcoming Catastrophic Forgetting in Graph Neural Networkscited by 95
  5. 2022ACIL: Analytic Class-Incremental Learning with Absolute Memorization and Privacy Protectioncited by 57
  6. 2024AnyGraph: Graph Foundation Model in the Wildcited by 53
  7. 2023CaT: Balanced Continual Graph Learning with Graph Condensationcited by 52
  8. 2020Graph Convolutional Networks using Heat Kernel for Semi-supervised Learningcited by 51
  9. 2021Graph Few-shot Class-incremental Learningcited by 41
  10. 2022Geometer: Graph Few-Shot Class-Incremental Learning via Prototype Representationcited by 22
  11. 2024An Efficient Memory Module for Graph Few-Shot Class-Incremental Learningcited by 10
  12. 2023PUMA: Efficient Continual Graph Learning for Node Classification with Graph Condensationcited by 9
  13. 2024Graph Continual Learning with Debiased Lossless Memory Replaycited by 9
  14. 2020Semi-Supervised Node Classification on Graphs: Markov Random Fields vs. Graph Neural Networkscited by 6
  15. 2025View Space: Learning Representation across Arbitrary Graphscited by 5
  16. 2025GraphKeeper: Graph Domain-Incremental Learning via Knowledge Disentanglement and Preservationcited by 4
  17. 2024Inductive Graph Few-shot Class Incremental Learningcited by 3

Built on by

Not cited yet.