SAGE: Scale-Aware Gradual Evolution for Continual Knowledge Graph Embedding
Traditional knowledge graph (KG) embedding methods aim to represent entities and relations in a low-dimensional space, primarily focusing on static graphs. However, real-world KGs are dynamically evolving with the constant addition of entities, relations and facts. To address such dynamic nature of KGs, several continual knowledge graph embedding (CKGE) methods have been developed to efficiently update KG embeddings to accommodate new facts while maintaining learned knowledge. As KGs grow at different rates and scales in real-world scenarios, existing CKGE methods often fail to consider the varying scales of updates and lack systematic evaluation throughout the entire update process. In this paper, we propose SAGE, a scale-aware gradual evolution framework for CKGE. Specifically, SAGE firstly determine the embedding dimensions based on the update scales and expand the embedding space accordingly. The Dynamic Distillation mechanism is further employed to balance the preservation of learned knowledge and the incorporation of new facts. We conduct extensive experiments on seven benchmarks, and the results show that SAGE consistently outperforms existing baselines, with a notable improvement of 1.38% in MRR, 1.25% in H@1 and 1.6% in H@10. Furthermore, experiments comparing SAGE with methods using fixed embedding dimensions show that SAGE achieves optimal performance on every snapshot, demonstrating the importance of adaptive embedding dimensions in CKGE. The codes of SAGE are publicly available at: https://github.com/lyfxjtu/Dynamic-Embedding.
Code (0)
등록된 구현이 없습니다.
Tasks
Knowledge Graph EmbeddingSimilar Papers 제목 키워드 기반
A note on retrodiction and machine evolution
Biomolecular communication demands that interactions between parts of a molecular system act as scaffolds for message transmission. It also requires an evolving and organized system of signs - a communicative agency - fo…
Simplification, innateness, and the absorption of meaning from context: how novelty arises from gradual network evolution
The theory of interaction-based evolution argues that, at the most basic level of analysis, there is a third alternative for how adaptive evolution works besides a) accidental mutation and natural selection and b) Lamarc…
Balancing Plasticity and Stability with Fast and Slow Successor Features
A hallmark of intelligence is the ability to adapt in non-stationary environments, yet deep Reinforcement Learning (RL) agents often struggle in such settings. Prior studies introduce non-stationarity through abrupt shif…
Reinforcement LearningContinual LearningImproving Task-free Continual Learning by Distributionally Robust Memory Evolution
Task-free continual learning (CL) aims to learn a non-stationary data stream without explicit task definitions and not forget previous knowledge. The widely adopted memory replay approach could gradually become less effe…
Continual LearningS1-NexusAgent: a Self-Evolving Agent Framework for Multidisciplinary Scientific Research
Modern scientific research relies on large-scale data, complex workflows, and specialized tools, which existing LLMs and tool-based agents struggle to handle due to limitations in long-horizon planning, robust goal maint…
Continual Learning