Aug 2026· Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2· pp. 4754-4765· 0 citations· 69 references
TL;DR
A novel Continual Learning Dynamic Graph LLM framework (Continual-GraphLLM) is proposed to continually adapt to incoming patterns by routing them to experts specialized in similar past patterns, while mitigating the overwriting of previously learned patterns by assigning new experts to unseen patterns.
Abstract
Dynamic text-attributed graphs (DyTAGs) exhibit coupled textual and structural dynamics, and existing mainstream approaches for DyTAGs extend conventional large language models (LLMs) to capture both dynamics, thereby giving rise to dynamic graph LLMs. However, in DyTAGs, the continuous emergence of new nodes and edges with incoming textual content and interactions drives the joint evolution of graph structural-textual patterns, causing existing methods to struggle with evolving patterns. This motivates a largely unexplored problem of continual learning on DyTAGs, which aims to adapt to constantly evolving graph structural-textual patterns while retaining past knowledge, which imposes two challenges: 1) unlike common graphs, graph structure and textual semantics in emerging DyTAG patterns jointly evolve, requiring dynamic graph LLMs to adapt structure, text, and graph-text fusion simultaneously; and 2) updating dynamic graph LLMs to fit a new pattern may destroy the global graph-text fusion capabilities and bias the model towards recent local dynamics. To address these challenges, we propose a novel Continual Learning Dynamic Graph LLM framework (Continual-GraphLLM) to continually adapt to incoming patterns by routing them to experts specialized in similar past patterns, while mitigating the overwriting of previously learned patterns by assigning new experts to unseen patterns. Specifically, we propose a graph-text factor-based router to adapt to incoming structural-textual joint patterns by utilizing latent factors to adaptively activate suitable experts. Furthermore, we design invariance regularized multi-scale experts that mitigate forgetting by capturing the invariances among learned patterns assigned to the same expert, where each expert progressively integrates structural and textual information from local scale to global scale. Extensive experiments on real-world DyTAGs demonstrate the superiority of our method over competitive baselines, highlighting its effectiveness in adapting to emerging DyTAG patterns.
Dynamic text-attributed graphs (DTAGs), where nodes, edges, and textual attributes evolve over time, are crucial in applications such as social networks, citation graphs, and knowledge graphs. However, existing approaches struggle to jointly model the temporal evolution of graph structures and the semantic richness of...
Moran Beladev, Orly Eitan, Gilad Katz et al.· 0 citations
A leave-one-domain-out (LODO) transfer learning protocol for edge classification on DyTAGs is formally established, and it is demonstrated that state-of-the-art self-supervised methods for dynamic graph learning perform poorly when transferred to unseen domains.
Continual knowledge graph embedding (CKGE) has gained popularity for managing dynamic knowledge graphs. Unlike general graph continual-learning approaches, CKGE focuses on retaining triple-level knowledge, thereby overcoming the inability of static models to accommodate continuously arriving facts. However, as new fact...
Yue Jian, Lin Li, Kai-Ze Shi et al.· Proceedings of the Thirty-Fi...· 0 citations
A comprehensive evaluation of 17 state-of-the-art methods across Temporal Graph Neural Networks (TGNNs) and Large Language Model (LLM)-based paradigms reveals a clear capability divide between the two paradigms: TGNN-based methods excel at structural prediction but fail at semantic tracking, whereas LLM-based predictor...
LADDER is a novel framework that bridges diffusion language modeling with GraphRAG through graph-guided parallel decoding through graph-guided parallel decoding, and proposes an event-driven self-clocking retrieval, inspired by the key insight that 88% of target entities emerge early in the partially denoised state.
Sen-Lei Zhang, Lin-Hao Luo, Qian-Wen Zhang et al.· 0 citations
Graph representation learning has emerged as a foundational discipline within modern data science, essential for modeling the complex relational systems ubiquitous in domains from social networks to bioinformatics. However, conventional approaches, particularly Graph Neural Networks (GNN), exhibit significant limitatio...
Justin Carpenter· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.