FTF-ER: Feature-Topology Fusion-Based Experience Replay Method for Continual Graph Learning
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 28 of its 50 references that are in the map. First posted on arXiv 28 Jul 2024.
Builds on
28 of 50 references.
References · 28
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2016Learning without Forgettingcited by 2,465
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2013Rich feature hierarchies for accurate object detection and semantic segmentationcited by 2,160
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2016Progressive Neural Networkscited by 1,332
- 2017Memory Aware Synapses: Learning what (not) to forgetcited by 1,094
- 2018Experience Replay for Continual Learningcited by 1,074
- 2015Image-based Recommendations on Styles and Substitutescited by 702
16 more
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 689
- 2018An Empirical Study of Example Forgetting during Deep Neural Network Learningcited by 669
- 2019Gradient based sample selection for online continual learningcited by 568
- 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 529
- 2019Orthogonal Gradient Descent for Continual Learningcited by 361
- 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 332
- 2020Scaling Graph Neural Networks with Approximate PageRankcited by 174
- 2019Scalable and Order-robust Continual Learning with Additive Parameter Decompositioncited by 125
- 2020Overcoming Catastrophic Forgetting in Graph Neural Networkscited by 93
- 2019Lifelong Machine Learning with Deep Streaming Linear Discriminant Analysiscited by 91
- 2018Random Walks on Simplicial Complexes and the normalized Hodge 1-Laplaciancited by 84
- 2020Streaming Graph Neural Networks via Continual Learningcited by 63
- 2022MixGen: A New Multi-Modal Data Augmentationcited by 61
- 2020Graph Neural Networks with Continual Learning for Fake News Detection from Social Mediacited by 43
- 2018Flow Smoothing and Denoising: Graph Signal Processing in the Edge-Spacecited by 37
- 2019Graduate Employment Prediction with Biascited by 7
Built on by
Citing papers per year: 2025: 3.
3 papers.
- 2025HERO: Preserving Structure and Semantics in Heterogeneous Continual Graph Learningcited by 1
- 2025MEGA: Second-Order Gradient Alignment for Catastrophic Forgetting Mitigation in GFSCILcited by 0
- 2025When LLMs meet open-world graph learning: a new perspective for unlabeled data uncertaintycited by 0
- 2025HERO: Preserving Structure and Semantics in Heterogeneous Continual Graph Learning23 May 2025
- 2025When LLMs meet open-world graph learning: a new perspective for unlabeled data uncertainty20 May 2025
- 2025MEGA: Second-Order Gradient Alignment for Catastrophic Forgetting Mitigation in GFSCIL18 Apr 2025