SAGE: Scale-Aware Gradual Evolution for Continual Knowledge Graph Embedding
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 27 of its 40 references that are in the map. First posted on arXiv 15 Aug 2025.
Builds on
27 of 40 references.
References · 27
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2017Gradient Episodic Memory for Continual Learningcited by 1,898
- 2016Progressive Neural Networkscited by 1,361
- 2014Embedding Entities and Relations for Learning and Inference in Knowledge Basescited by 932
- 2016Complex Embeddings for Simple Link Predictioncited by 902
- 2023LLaMA-Adapter: Efficient Fine-tuning of Language Models with Zero-init Attentioncited by 781
- 2020Scaling Laws for Autoregressive Generative Modelingcited by 522
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
- 2019EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphscited by 447
- 2019KGAT: Knowledge Graph Attention Network for Recommendationcited by 343
- 2017CORe50: a New Dataset and Benchmark for Continuous Object Recognitioncited by 289
15 more
- 2019Representation Learning for Dynamic Graphs: A Surveycited by 265
- 2018SimplE Embedding for Link Prediction in Knowledge Graphscited by 195
- 2017Knowledge Transfer for Out-of-Knowledge-Base Entities: A Graph Neural Network Approachcited by 102
- 2020Knowledge Graph Embedding for Link Prediction: A Comparative Analysiscited by 85
- 2019Sentence Embedding Alignment for Lifelong Relation Extractioncited by 70
- 2023LoRA ensembles for large language model fine-tuningcited by 67
- 2021Continual Learning of Knowledge Graph Embeddingscited by 35
- 2024EvoChart: A Benchmark and a Self-Training Approach Towards Real-World Chart Understandingcited by 34
- 2022Lifelong Embedding Learning and Transfer for Growing Knowledge Graphscited by 28
- 2020Disentangle-based Continual Graph Representation Learningcited by 25
- 2023Scaling Law of Large Sequential Recommendation Modelscited by 23
- 2024Sparsing Law: Towards Large Language Models with Greater Activation Sparsitycited by 22
- 2021Scaling Laws for Acoustic Modelscited by 21
- 2024Towards Continual Knowledge Graph Embedding via Incremental Distillationcited by 17
- 2024Fast and Continual Knowledge Graph Embedding via Incremental LoRAcited by 14
Built on by
Not cited yet.