Sign inGet started
Paper · arXiv

A Lightweight Plastic-Memory Framework for Graph Few-Shot Class-Incremental Learning

Graph Incremental Learning has garnered increasing attention as dynamic graph data continues to emerge across diverse fields. Conventional approaches primarily address catastrophic forgetting by preserving node-related knowledge through replay or distillation techniques; however, they often incur high computational costs and inefficiency. This issue is further exacerbated in real-world scenarios where labeled data for new classes is scarce. In this paper, we propose a novel lightweight plastic-memory framework specifically designed for few-shot incremental learning on graphs. The core idea of our framework is the construction of a plastic-memory module that evolves over time, continuously...

AuthorsZihan Mei, Zhili Qin, Tongze Zhang et al.
Primary categorycs.LG
Published22 September 2026
Last updated at source22 September 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/d537c289-7c95-4022-8e23-35c2868a93cc" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.