GraphKeeper: Graph Domain-Incremental Learning via Knowledge Disentanglement and Preservation
Not on the map. Why?
Abstract (arXiv)
Graph incremental learning (GIL), which continuously updates graph models by sequential knowledge acquisition, has garnered significant interest recently. However, existing GIL approaches focus on task-incremental and class-incremental scenarios within a single domain. Graph domain-incremental learning (Domain-IL), aiming at updating models across multiple graph domains, has become critical with the development of graph foundation models (GFMs), but remains unexplored in the literature. In this paper, we propose Graph Domain-Incremental Learning via Knowledge Dientanglement and Preservation (GraphKeeper), to address catastrophic forgetting in Domain-IL scenario from the perspectives of embedding shifts and decision boundary deviations. Specifically, to prevent embedding shifts and confusion across incremental graph domains, we first propose the domain-specific parameter-efficient fine-tuning together with intra- and inter-domain disentanglement objectives. Consequently, to maintain a stable decision boundary, we introduce deviation-free knowledge preservation to continuously fit incremental domains. Additionally, for graphs with unobservable domains, we perform domain-aware distribution discrimination to obtain precise embeddings. Extensive experiments demonstrate the proposed GraphKeeper achieves state-of-the-art results with 6.5%~16.6% improvement over the runner-up with negligible forgetting. Moreover, we show GraphKeeper can be seamlessly integrated with various representative GFMs, highlighting its broad applicative potential.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 30 Oct 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026RAG-GFM: Overcoming In-Memory Bottlenecks in Graph Foundation Models via Retrieval-Augmented Generationcited by 4
- 2026Are Common Substructures Transferable? Riemannian Graph Foundation Model with Neural Vector Bundlescited by 0
- 2026ReDIL-GNN: Resynthesis Domain Incremental Learning for Circuit Graph Neural Networkscited by 0
- 2026MAGIC: Topology-Aware Analytic Graph Few-Shot Class-Incremental Learningcited by 0
- 2026MAGIC: Topology-Aware Analytic Graph Few-Shot Class-Incremental Learning4 Oct 2026
- 2026ReDIL-GNN: Resynthesis Domain Incremental Learning for Circuit Graph Neural Networks16 Sep 2026
- 2026Are Common Substructures Transferable? Riemannian Graph Foundation Model with Neural Vector Bundles2 Jun 2026
- 2026RAG-GFM: Overcoming In-Memory Bottlenecks in Graph Foundation Models via Retrieval-Augmented Generation21 Jan 2026