Pith. sign in

REVIEW 2 cited by

Continual Learning on Graphs: A Survey

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.06330 v1 pith:Z5IAXH3J submitted 2024-02-09 cs.LG

classification cs.LG
keywords learningcontinualgraphperformancecatastrophiccontinuousdiscussforgetting
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recently, continual graph learning has been increasingly adopted for diverse graph-structured data processing tasks in non-stationary environments. Despite its promising learning capability, current studies on continual graph learning mainly focus on mitigating the catastrophic forgetting problem while ignoring continuous performance improvement. To bridge this gap, this article aims to provide a comprehensive survey of recent efforts on continual graph learning. Specifically, we introduce a new taxonomy of continual graph learning from the perspective of overcoming catastrophic forgetting. Moreover, we systematically analyze the challenges of applying these continual graph learning methods in improving performance continuously and then discuss the possible solutions. Finally, we present open issues and future directions pertaining to the development of continual graph learning and discuss how they impact continuous performance improvement.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Task-Aware Adaptive Modulation: A Replay-Free and Resource-Efficient Approach For Continual Graph Learning

    cs.LG 2025-08 conditional novelty 6.0 of 10

    TAAM achieves replay-free, pre-training-free continual graph learning by routing each task to a small node-attentive modulator inserted into a frozen GNN.

  2. PROL : Rehearsal Free Continual Learning in Streaming Data via Prompt Online Learning

    cs.LG 2025-07 conditional novelty 6.0 of 10

    PROL achieves state-of-the-art rehearsal-free online continual learning accuracy on CIFAR100, ImageNet-R, ImageNet-A, and CUB with a single lightweight prompt generator and 16 trainable numbers per class.

Pith tools