FTF-ER: Feature-Topology Fusion-Based Experience Replay Method for Continual Graph Learning
Jinhui Pang, Changqing Lin, Xiaoshuai Hao, Rong Yin, Zixuan Wang, Zhihui Zhang, Jinglin He, Huang Tai Sheng
摘要
Continual graph learning (CGL) is an important and challenging task that aims to extend static GNNs to dynamic task flow scenarios. As one of the mainstream CGL methods, the experience replay (ER) method receives widespread attention due to its superior performance. However, existing ER methods focus on identifying samples by feature significance or topological relevance, which limits their utilization of comprehensive graph data. In addition, the topology-based ER methods only consider local topological information and add neighboring nodes to the buffer, which ignores the global topological information and increases memory overhead. To bridge these gaps, we propose a novel method called Feature-Topology Fusion-based Experience Replay (FTF-ER) to effectively mitigate the catastrophic forgetting issue with enhanced efficiency. Specifically, from an overall perspective to maximize the utilization of the entire graph data, we propose a highly complementary approach including both feature and global topological information, which can significantly improve the effectiveness of the sampled nodes. Moreover, to further utilize global topological information, we propose Hodge Potential Score (HPS) as a novel module to calculate the topological importance of nodes. HPS derives a global node ranking via Hodge decomposition on graphs, providing more accurate global topological information compared to neighbor sampling. By excluding neighbor sampling, HPS significantly reduces buffer storage costs for acquiring topological information and simultaneously decreases training time. Compared with state-of-the-art methods, FTF-ER achieves a significant improvement of 3.6% in AA and 7.1% in AF on the OGB-Arxiv dataset, demonstrating its superior performance in the class-incremental learning setting.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- GIER: Addressing Class Imbalance in GNNs Through Experience ReplayLiu Yang, Chuyao Liu, Zidong Wang, Tingxuan Chen 等AAAI 2026
- Towards Effective Open-set Graph Class-incremental LearningJiazhen Chen, Zheng Ma, Sichao Fu, Mingbin Feng 等ACM MM 2025
它引用的顶会 Paper9
- Deep Learning on a Data Diet: Finding Important Examples Early in TrainingMansheej Paul, Surya Ganguli, Gintare Karolina DziugaiteNeurIPS 2021 · 被引用 806 次
- Supermasks in SuperpositionMitchell Wortsman, Vivek Ramanujan, Rosanne Liu, Aniruddha Kembhavi 等NeurIPS 2020 · 被引用 364 次
- Scalable and Order-robust Continual Learning with Additive Parameter DecompositionJaehong Yoon, Saehoon Kim, Eunho Yang, Sung Ju HwangICLR 2020 · 被引用 206 次
- Overcoming Catastrophic Forgetting in Graph Neural Networks with Experience ReplayFan Zhou, Chengtai CaoAAAI 2021 · 被引用 175 次
- Overcoming Catastrophic Forgetting in Graph Neural NetworksHuihui Liu, Yiding Yang, Xinchao WangAAAI 2021 · 被引用 166 次
相关 Paper
- DSLR: Diversity Enhancement and Structure Learning for Rehearsal-based Graph Continual LearningSeungyoon Choi, Wonjoong Kim, Sungwon Kim, Yeonjun In 等WWW 2024 · 被引用 16 次
- Topology-aware Embedding Memory for Continual Learning on Expanding NetworksXikun Zhang, Dongjin Song, Yixin Chen, Dacheng TaoKDD 2024 · 被引用 12 次
- A Topology-aware Graph Coarsening Framework for Continual Graph LearningXiaoxue Han, Zhuo Feng, Yue NingNeurIPS 2024 · 被引用 19 次
- FedFST: Mitigating Spectral Catastrophic Forgetting in Federated Graph Continual LearningHanyao Guo, Zihan Tan, Wenke Huang, Bin Yang 等KDD 2026
- STG-DGR: Fraud Detection on Streaming Transaction Graphs with Diffusion-based Generative ReplayRui Ou, Kun Zhu, Nana Zhang, Jiangtong Li 等WWW 2026
