A Generative Adaptive Replay Continual Learning Model for Temporal Knowledge Graph Reasoning (2025.acl-long)
Copied to clipboard
| Challenge: | Existing Continual Learning (CL)-based Temporal Knowledge Graph Reasoning methods are incomplete and reorganize historical facts without preserving historical knowledge. |
| Approach: | They propose a method which generates and adaptively replays historical entity distributions from the whole historical context. |
| Outcome: | The proposed method outperforms baselines in reasoning and mitigating forgetting. |
Similar Papers
History repeats: Overcoming catastrophic forgetting for event-centric temporal knowledge graph completion (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for knowledge graph completion are incomplete and can lead to errors . retraining the model with the entire updated TKG can mitigate forgetting but is computationally burdensome. |
| Approach: | They propose a temporal regularization framework that allows repurposing of parameters . they propose 'clustering-based experience replay' that reinforces the past knowledge . |
| Outcome: | The proposed framework adapts to new events while reducing catastrophic forgetting. |
Sequential and Repetitive Pattern Learning for Temporal Knowledge Graph Reasoning (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods to learn temporal evolutional representations of entities are hard to capture the complex temporal patterns such as sequential and repetitive. |
| Approach: | They propose a Sequential and Repetitive Pattern Learning method that captures both sequential and repetitive patterns. |
| Outcome: | The proposed method outperforms state-of-the-art methods on four representative benchmarks on GDELT dataset, where performance improvement of MRR reaches up to 18.84%. |
Deja vu: Contrastive Historical Modeling with Prefix-tuning for Temporal Knowledge Graph Reasoning (2024.findings-naacl)
Copied to clipboard
| Challenge: | Existing text-based methods for Temporal Knowledge Graph Reasoning struggle to balance textual knowledge and temporal information with expensive purpose-built training strategies. |
| Approach: | They propose a Contrastive historical modeling framework with prefix-tuning for TEmporal Reasoning that feeds history-contextualized text into the pseudo-Siamese encoders to strike a textual-temporal balance. |
| Outcome: | The proposed framework achieves superior performance on four transductive and three few-shot inductive TKGR benchmarks. |
Temporal Extrapolation and Knowledge Transfer for Lifelong Temporal Knowledge Graph Reasoning (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods for lifelong TKG reasoning only address part of the challenges. |
| Approach: | They propose a temporal-path-based reinforcement learning framework for lifelong TKG reasoning . they add temporal displacement into the action space of RL to extrapolate for the future . |
| Outcome: | The proposed model outperforms existing models against well-adapted baselines on three lifelong TKG reasoning benchmarks. |
GenTKG: Generative Forecasting on Temporal Knowledge Graph with Large Language Models (2024.findings-naacl)
Copied to clipboard
| Challenge: | Existing methods for temporal relational forecasting are limited and require limited training data. |
| Approach: | They propose a retrieval-augmented generation framework that uses temporal logical rule-based retrieval and parameter-efficient instruction tuning to solve temporal knowledge forecasting challenges. |
| Outcome: | The proposed framework outperforms conventional methods in the temporal knowledge graph domain with low computation resources. |
MetaTKG: Learning Evolutionary Meta-Knowledge for Temporal Knowledge Graph Reasoning (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing models rely on historical information to learn embeddings for entities, but ignore the evolution of facts. |
| Approach: | They propose a Temporal Meta-learning framework to learn evolutionary meta-knowledge from TKGs. |
| Outcome: | The proposed method improves on four widely-used datasets and three backbones on a wide range of scenarios on tKGs. |
DLTKG: Denoising Logic-based Temporal Knowledge Graph Reasoning (2025.findings-emnlp)
Copied to clipboard
| Challenge: | Current approaches to temporal knowledge representation face limited generalization to unseen facts and insufficient interpretability of reasoning processes. |
| Approach: | They propose a framework that uses a denoising diffusion process to complete reasoning tasks . they propose introducing a noise source and historical conditionguiding mechanism to improve interpretability . |
| Outcome: | The proposed framework outperforms state-of-the-art methods on three benchmark datasets. |
Predicting the Unpredictable: Uncertainty-Aware Reasoning over Temporal Knowledge Graphs via Diffusion Process (2024.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for Temporal Knowledge Graph reasoning capture indeterminacy in future events, but they are limited in capturing it. |
| Approach: | They propose a Temporal Knowledge Graph reasoning process that denoises historical events and introduces Gaussian noise to corrupt target facts. |
| Outcome: | Empirical results show that DiffuTKG outperforms state-of-the-art methods on four real-world datasets. |
SiMFy: A Simple Yet Effective Approach for Temporal Knowledge Graph Reasoning (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models for temporal knowledge graph reasoning suffer from low training efficiency and insufficient generalization ability. |
| Approach: | They propose a temporal knowledge graph reasoning approach that uses multilayer perceptron to model the structural dependencies of events and adopts a fixed-frequency strategy to incorporate historical frequency during inference. |
| Outcome: | The proposed model achieves state-of-the-art performance with faster convergence speed and better generalization ability. |
RECIPE-TKG: From Sparse History to Structured Reasoning for LLM-based Temporal Knowledge Graph Completion (2026.eacl-long)
Copied to clipboard
| Challenge: | Temporal Knowledge Graphs (TKGs) represent dynamic facts as timestamped relations between entities. Large Language Models (LLMs) have sparked interest in using pretrained generative models for TKG completion. |
| Approach: | They propose a framework that allows for rule-based multi-hop sampling and contrastive fine-tuning to shape relational compatibility. |
| Outcome: | Experiments show that RECIPE-TKG outperforms prior LLM-based methods across input regimes. |