HERO is a heterogeneous continual graph learning framework that preserves historical knowledge at both structural and semantic levels while adapting to new tasks. It uses DiSCo to select representative target nodes and reconstruct compact heterogeneous contexts, and applies multi-level knowledge distillation to align task-conditioned predictions with semantic responses. Experiments on four datasets with three HGNN backbones show HERO achieves best or tied-best average performance while maintaining competitive forgetting.
arXiv:2607. 10159v1 Announce Type: new Abstract: In real-world multimodal web scenarios, graph-structured data often arrives in a streaming manner, making graph continual learning a crucial paradigm for continuously modeling such evolving structures.
arXiv:2606. 01873v1 Announce Type: new Abstract: LLM-as-Aligner has emerged as a prevalent pre-training paradigm for Text-Attributed Graphs(TAGS), aligning graph and text modalities into a shared embedding space via CLIP-style contrastive learning.
arXiv:2609.36559v1 Announce Type: cross Abstract: Extrapolative temporal knowledge graph reasoning (TKGR) predicts future facts from historical snapshots. Most existing methods train once on an early...
arXiv:2605. 20247v2 Announce Type: replace-cross Abstract: Catastrophic forgetting remains a major obstacle to continual learning in large language models (LLMs) and vision--language models (VLMs).
MePo++ is a post‑training framework designed for general continual learning (GCL) that unifies representation refinement and reconciliation. It introduces MetaPrep, which enhances representation plasticity via unsupervised meta‑refinement on pseudo continual sequences, and StreamAlign, which maintains stability by reconciling online features with a stable pretrained geometry. Experiments across various pretrained models, datasets, and continual learning baselines show that MePo++ consistently improves performance in PTM‑based GCL.
arXiv:2610.20238v1 Announce Type: new Abstract: Graph Neural Networks (GNNs) excel on graph-structured data but suffer catastrophic forgetting when classes arrive sequentially. In class-incremental g...
arXiv:2607. 11112v1 Announce Type: new Abstract: Dynamic graph continual learning (DGCL) is an effective manner for handling catastrophic forgetting in dynamic graphs.
The paper introduces CGM-Rec, a continual graph memory framework designed for adaptive recommendation in the presence of intent drift. CGM-Rec treats the knowledge graph as writable memory, comprising a conservative Semantic Graph Memory for stable relational knowledge and a fast-reactive Episodic Lesson Memory for recent outcomes and corrective hints. Experiments show that, with frozen model parameters and one-pass reranking, CGM-Rec outperforms neural and LLM-based baselines across multiple recommendation settings, achieving significant gains such as a 29.58% improvement in HR@1 over the strongest LLM baseline on Bundle.
arXiv:2603. 12055v3 Announce Type: replace-cross Abstract: Continual learning of pretrained vision-language models (VLMs) is prone to catastrophic forgetting, yet current approaches adapt to new tasks without explicitly preserving the cross-modal semantic geometry inherited from pretraining and previous stages, allowing new-task supervision to induce geometric distortion.
arXiv:2607. 07847v1 Announce Type: new Abstract: As large language models (LLMs) become increasingly capable, the next question is how can we enable models to continually learn?
arXiv:2606. 15734v1 Announce Type: cross Abstract: Continual post-training enables models to absorb emerging knowledge after deployment, but repeatedly updating shared parameters can accumulate weight drift, potentially causing catastrophic forgetting and degrading general capabilities.
arXiv:2607. 27665v1 Announce Type: new Abstract: Federated graph learning enables collaborative training over decentralized graph data without sharing raw graph information.