ETT-CKGE: Efficient Task-driven Tokens for Continual Knowledge Graph Embedding
Not on the map. Why?
Abstract (arXiv)
Continual Knowledge Graph Embedding (CKGE) seeks to integrate new knowledge while preserving past information. However, existing methods struggle with efficiency and scalability due to two key limitations: (1) suboptimal knowledge preservation between snapshots caused by manually designed node/relation importance scores that ignore graph dependencies relevant to the downstream task, and (2) computationally expensive graph traversal for node/relation importance calculation, leading to slow training and high memory overhead. To address these limitations, we introduce ETT-CKGE (Efficient, Task-driven, Tokens for Continual Knowledge Graph Embedding), a novel task-guided CKGE method that leverages efficient task-driven tokens for efficient and effective knowledge transfer between snapshots. Our method introduces a set of learnable tokens that directly capture task-relevant signals, eliminating the need for explicit node scoring or traversal. These tokens serve as consistent and reusable guidance across snapshots, enabling efficient token-masked embedding alignment between snapshots. Importantly, knowledge transfer is achieved through simple matrix operations, significantly reducing training time and memory usage. Extensive experiments across six benchmark datasets demonstrate that ETT-CKGE consistently achieves superior or competitive predictive performance, while substantially improving training efficiency and scalability compared to state-of-the-art CKGE methods. The code is available at: https://github.com/lijingzhu1/ETT-CKGE/tree/main
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 24 of its 29 references that are in the map. First posted on arXiv 9 Jun 2025.
Builds on
24 of 29 references.
References · 24
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2021Scaling Up Visual and Vision-Language Representation Learning With Noisy Text Supervisioncited by 3,864
- 2017Gradient Episodic Memory for Continual Learningcited by 1,898
- 2016Progressive Neural Networkscited by 1,361
- 2016Complex Embeddings for Simple Link Predictioncited by 902
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 694
- 2017CORe50: a New Dataset and Benchmark for Continuous Object Recognitioncited by 289
- 2022LinkBERT: Pretraining Language Models with Document Linkscited by 211
12 more
- 2018SimplE Embedding for Link Prediction in Knowledge Graphscited by 195
- 2023GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural Networkscited by 167
- 2018Rotate your Networks: Better Weight Consolidation and Less Catastrophic Forgettingcited by 127
- 2023A Comprehensive Survey on Deep Graph Representation Learningcited by 72
- 2019Sentence Embedding Alignment for Lifelong Relation Extractioncited by 70
- 2018Logic Attention Based Neighborhood Aggregation for Inductive Knowledge Graph Embeddingcited by 53
- 2022Lifelong Embedding Learning and Transfer for Growing Knowledge Graphscited by 28
- 2024Continual Learning on Graphs: Challenges, Solutions, and Opportunitiescited by 21
- 2024Towards Continual Knowledge Graph Embedding via Incremental Distillationcited by 17
- 2024Fast and Continual Knowledge Graph Embedding via Incremental LoRAcited by 14
- 2024HGTDP-DTA: Hybrid Graph-Transformer with Dynamic Prompt for Drug-Target Binding Affinity Predictioncited by 7
- 2025KGIF: Optimizing Relation-Aware Recommendations with Knowledge Graph Information Fusioncited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.