Subspace-Aware Feature Reshaping for Open-Set Graph Class-Incremental Learning
Weichao Zhang, Shuai Zheng, Yeyu Yan, Zhizhe Liu, Zhenfeng Zhu, Yao Zhao
Abstract
Graph class-incremental learning (GCIL) has emerged to address the challenge of learning from dynamically evolving graphs, which continuously learns new classes over a sequence of tasks while retaining performance on previously seen classes. However, existing GCIL methods assume a closed-set test distribution drawn only from seen tasks. This fundamentally contradicts real-world open-ended scenarios where future unknown classes inevitably emerge. Empirically, we observe that existing GCIL methods falter in such open-set settings due to severe representation drift and generalized overconfidence. To bridge this gap, we investigate the Open-Set GCIL problem and propose SAFER (Subspace-Aware FEature Reshaping), a novel framework that endows GCIL with intrinsic open-set capabilities under a replay-free constraint. Specifically, SAFER performs subspace-aware feature reshaping with drift-resilient fingerprints, unifying task routing and open-set rejection into a single energy-based metric. Furthermore, we introduce a geometric space-consistency regularization that explicitly improves intra-class compactness and suppresses cross-task representation drift. Extensive experiments on four benchmarks demonstrate that SAFER outperforms state-ofthe-art baselines by margins of up to 5.2% in accuracy and 31.3% in open-set AUROC, all while maintaining near-zero forgetting under strict noreplay constraints. The code has been released in https://github.com/ZhangWeichao0824/SAFER
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 4aaeca6b-d892-475f-a347-916710a6d542Builds on14
- Supervised Contrastive LearningPrannay Khosla, Piotr Teterwak, Chen Wang, Aaron Sarna et al.NeurIPS 2020 · 7,049 citations
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong et al.NeurIPS 2020 · 3,935 citations
- Overcoming Catastrophic Forgetting in Graph Neural Networks with Experience ReplayFan Zhou, Chengtai CaoAAAI 2021 · 175 citations
- Overcoming Catastrophic Forgetting in Graph Neural NetworksHuihui Liu, Yiding Yang, Xinchao WangAAAI 2021 · 166 citations
- Dynamically Expandable Graph Convolution for Streaming RecommendationBowei He, Xu He, Yingxue Zhang, Ruiming Tang et al.WWW 2023 · 60 citations
Related papers
- Towards Effective Open-set Graph Class-incremental LearningJiazhen Chen, Zheng Ma, Sichao Fu, Mingbin Feng et al.ACM MM 2025
- Replay-and-Forget-Free Graph Class-Incremental Learning: A Task Profiling and Prompting ApproachChaoxi Niu, Guansong Pang, Ling Chen, Bing LiuNeurIPS 2024 · 32 citations
- What Matters in Graph Class Incremental Learning? An Information Preservation PerspectiveJialu Li, Yu Wang, Pengfei Zhu, Wanyu Lin et al.NeurIPS 2024 · 14 citations
- Few-Shot Incremental Learning With Continually Evolved ClassifiersChi Zhang, Nan Song, Guosheng Lin, Yun Zheng et al.CVPR 2021
- Class-Domain Incremental Learning on Graphs via Disentangled Knowledge DistillationQin Tian, Chen Zhao, Xintao Wu, Dong Li et al.WWW 2026
