UFO: A Unified Flow-Oriented Framework for Robust Continual Graph Learning
Not on the map. Why?
Abstract (arXiv)
Graph learning research has increasingly shifted toward continual graph learning (CGL), which better reflects real-world scenarios where graphs evolve over time. However, existing CGL methods largely assume clean supervision and overlook a critical challenge: the newly arriving portions of the graph are often noisy, due to annotation errors or adversarial corruption. This mismatch limits their applicability in practice. In this work, we study robust continual graph learning, where models must simultaneously handle catastrophic forgetting and noisy supervision in evolving graph data. We show that label noise introduces a new failure mode, catastrophic remembering, where models persistently reinforce corrupted knowledge across tasks. To address these challenges, we propose a Unified Flow-Oriented framework (UFO). First, UFO models conditional feature distributions via flow-based generative modeling and produces replay representations, mitigating forgetting without storing historical data. Second, UFO estimates instance-level reliability scores to distinguish clean from noisy nodes, reducing the impact of corrupted supervision and alleviating catastrophic remembering. Extensive experiments on four benchmark graph datasets under varying noise ratios demonstrate that UFO consistently outperforms existing methods in both accuracy and forgetting metrics. Code is available at: https://anonymous.4open.science/r/UFO.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 34 of its 44 references that are in the map. First posted on arXiv 11 May 2026.
Builds on
34 of 44 references.
References · 34
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2016Learning without Forgettingcited by 2,465
- 2015Variational Inference with Normalizing Flowscited by 2,161
- 2016Density estimation using Real NVPcited by 2,029
- 2019Normalizing Flows for Probabilistic Modeling and Inferencecited by 1,315
- 2018Co-teaching: Robust Training of Deep Neural Networks with Extremely Noisy Labelscited by 1,053
- 2018Generalized Cross Entropy Loss for Training Deep Neural Networks with Noisy Labelscited by 994
- 2018Pitfalls of Graph Neural Network Evaluationcited by 994
- 2020Learning from Noisy Labels with Deep Neural Networks: A Surveycited by 580
- 2019Symmetric Cross Entropy for Robust Learning with Noisy Labelscited by 499
- 2019How does Disagreement Help Generalization against Label Corruption?cited by 390
22 more
- 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 332
- 2014Training Deep Neural Networks on Noisy Labels with Bootstrappingcited by 322
- 2020Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networkscited by 253
- 2019Probabilistic End-to-end Noise Correction for Learning with Noisy Labelscited by 210
- 2020Learning with Instance-Dependent Label Noise: A Sample Sieve Approachcited by 158
- 2020Distilling Knowledge from Graph Convolutional Networkscited by 128
- 2020Overcoming Catastrophic Forgetting in Graph Neural Networkscited by 93
- 2021NRGNN: Learning a Label Noise-Resistant Graph Neural Network on Sparsely and Noisily Labeled Graphscited by 73
- 2021Hierarchical Prototype Networks for Continual Graph Representation Learningcited by 28
- 2021Continual Learning on Noisy Data Streams via Self-Purified Replaycited by 27
- 2022CLNode: Curriculum Learning for Node Classificationcited by 24
- 2024Continual Learning on Graphs: Challenges, Solutions, and Opportunitiescited by 20
- 2024NoisyGL: A Comprehensive Benchmark for Graph Neural Networks under Label Noisecited by 16
- 2024DSLR: Diversity Enhancement and Structure Learning for Rehearsal-based Graph Continual Learningcited by 14
- 2025Accurate Forgetting for Heterogeneous Federated Continual Learningcited by 11
- 2024Towards Continuous Reuse of Graph Models via Holistic Memory Diversificationcited by 7
- 2024Mitigating Label Noise on Graph via Topological Sample Selectioncited by 6
- 2024Federated Continual Graph Learningcited by 5
- 2025Handling Label Noise via Instance-Level Difficulty Modeling and Dynamic Optimizationcited by 5
- 2023Enhancing Contrastive Learning with Noise-Guided Attack: Towards Continual Relation Extraction in the Wildcited by 3
- 2025ErrorEraser: Unlearning Data Bias for Improved Continual Learningcited by 3
- 2025NeuBM: Mitigating Model Bias in Graph Neural Networks through Neutral Input Calibrationcited by 1
Built on by
Not cited yet.