Towards Effective Open-set Graph Class-incremental Learning
Jiazhen Chen, Zheng Ma, Sichao Fu, Mingbin Feng, Tony S. Wirjanto, Weihua Ou
Abstract
Graphs play a pivotal role in multimedia applications by integrating information to model complex relationships. Recently, graph class-incremental learning (GCIL) has garnered attention, allowing graph neural networks (GNNs) to adapt to evolving graph analytical tasks by incrementally learning new class knowledge while retaining knowledge of old classes. Existing GCIL methods primarily focus on a closed-set assumption, where all test samples are presumed to belong to previously known classes. Such assumption restricts their applicability in real-world scenarios, where unknown classes naturally emerge during inference, and are absent during training. In this paper, we explore a more challenging open-set graph class-incremental learning scenario with two intertwined challenges: catastrophic forgetting of old classes, which impairs the detection of unknown classes, and inadequate open-set recognition, which destabilizes the retention of learned knowledge. To address the above problems, a novel OGCIL framework is proposed, which utilizes pseudo-sample embedding generation to effectively mitigate catastrophic forgetting and enable robust detection of unknown classes. To be specific, a prototypical conditional variational autoencoder is designed to synthesize node embeddings for old classes, enabling knowledge replay without storing raw graph data. To handle unknown classes, we employ a mixing-based strategy to generate out-of-distribution (OOD) samples from pseudo in-distribution and current node embeddings. A novel prototypical hypersphere classification loss is further proposed, which anchors in-distribution embeddings to their respective class prototypes, while repelling OOD embeddings away. Instead of assigning all unknown samples into one cluster, our proposed objective function explicitly models them as outliers through prototype-aware rejection regions, ensuring a robust open-set recognition. Extensive experiments on five benchmarks demonstrate the effectiveness of OGCIL over existing GCIL and open-set GNN methods.
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 6ef75c58-3aa3-45ff-91f1-42813d0c4df9Builds on15
- GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural NetworksZemin Liu, Xingtong Yu, Yuan Fang, Xinming ZhangWWW 2023 · 263 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
- Universal Prompt Tuning for Graph Neural NetworksTaoran Fang, Yunchao Zhang, Yang Yang, Chunping Wang et al.NeurIPS 2023 · 166 citations
- All in One: Multi-Task Prompting for Graph Neural NetworksXiangguo Sun, Hong Cheng, Jia Li, Bo Liu et al.KDD 2023 · 149 citations
Related papers
- Subspace-Aware Feature Reshaping for Open-Set Graph Class-Incremental LearningWeichao Zhang, Shuai Zheng, Yeyu Yan, Zhizhe Liu et al.ICML 2026
- Replay-and-Forget-Free Graph Class-Incremental Learning: A Task Profiling and Prompting ApproachChaoxi Niu, Guansong Pang, Ling Chen, Bing LiuNeurIPS 2024 · 32 citations
- Streaming Graph Neural Networks with Generative ReplayJunshan Wang, Wenhao Zhu, Guojie Song, Liang WangKDD 2022 · 33 citations
- Towards Open Temporal Graph Neural NetworksKaituo Feng, Changsheng Li, Xiaolu Zhang, Jun ZhouICLR 2023 · 4 citations
- Semantics-Driven Generative Replay for Few-Shot Class Incremental LearningAishwarya Agarwal, Biplab Banerjee, Fabio Cuzzolin, Subhasis ChaudhuriACM MM 2022 · 26 citations
