Recurrent Event Network: Autoregressive Structure Inferenceover Temporal Knowledge Graphs (2020.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for reasoning over temporal knowledge graphs focus on past timestamps and are not able to predict future interactions. |
| Approach: | They propose a novel autoregressive architecture for predicting future interactions using a recurrent event encoder and a neighborhood aggregator. |
| Outcome: | The proposed method achieves state-of-the-art on five public datasets. |
Similar Papers
Temporal Knowledge Graph Reasoning Based on N-tuple Modeling (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing Temporal Knowledge Graphs (TKGs) only contain their core entities and form them as quadruples. |
| Approach: | They propose to describe a temporal fact more accurately as an n-tuple . they propose to use a neural network to learn evolutional representations of entities . |
| Outcome: | The proposed model oversimplifies and causes information loss on two datasets. |
Learning Neural Ordinary Equations for Forecasting Future Links on Temporal Knowledge Graphs (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing models for temporal knowledge graphs model the temporal KGs in discrete state spaces, whereas static models model the KG in discretized state spaces. |
| Approach: | They propose a continuum model that extends the idea of neural ordinary differential equations to multi-relational graph convolutional networks and encodes both temporal and structural information into continuous-time dynamic embeddings. |
| Outcome: | The proposed model outperforms existing models on five benchmark datasets showing it can predict future links on temporal knowledge graphs. |
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%. |
The Future is not One-dimensional: Complex Event Schema Induction by Graph Modeling for Event Prediction (2021.emnlp-main)
Copied to clipboard
| Challenge: | Event schemas encode knowledge of stereotypical structures of events and their connections . previous work on event schema induction focuses on atomic events or linear temporal sequences . |
| Approach: | They propose a Temporal Complex Event Schema: a graph-based schema representation that encompasses events, arguments, temporal connections and argument relations. |
| Outcome: | The proposed model outperforms existing models on HITS@1 by 17.8%. |
LGA: LLM-GNN Aggregation for Temporal Evolution Attribute Graph Prediction (2025.emnlp-main)
Copied to clipboard
| Challenge: | Current methods focus on 1-hop neighborhood aggregation, lacking capability to capture complex structural interactions. |
| Approach: | They propose a framework that integrates structural information into attribute embeddings through an attribute embedded loss. |
| Outcome: | The proposed framework shows significant improvements over existing methods on 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. |
Learning Sequence Encoders for Temporal Knowledge Graph Completion (D18-1)
Copied to clipboard
| Challenge: | Existing work on link prediction in knowledge graphs has focused on static multi-relational data. |
| Approach: | They propose to learn latent entity and relation type representations to incorporate temporal information into knowledge graphs. |
| Outcome: | The proposed approach is robust to common challenges in real-world KGs. |
AnRe: Analogical Replay for Temporal Knowledge Graph Forecasting (2025.acl-long)
Copied to clipboard
| Challenge: | Temporal Knowledge Graphs (TKGs) are vital for event prediction, yet current methods face limitations. |
| Approach: | They propose a training-free Analogical Replay reasoning framework that uses LLMs to extract historical contexts and generate analogical reasoning examples as contextual inputs. |
| Outcome: | The proposed model outperforms existing training-free methods on four benchmarks. |
TimeTraveler: Reinforcement Learning for Temporal Knowledge Graph Forecasting (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods focus on reasoning at past timestamps to complete the missing facts, and there are only a few works of reasoning on known TKGs to forecast future facts. |
| Approach: | They propose a time-shaped reward method that captures historical knowledge graph snapshots and a new representation method for unseen entities to improve the inductive inference ability of the model. |
| Outcome: | The proposed method improves on four benchmark datasets with higher explainability, less calculation, and fewer parameters when compared with existing state-of-the-art methods. |
AGRec: Adapting Autoregressive Decoders with Graph Reasoning for LLM-based Sequential Recommendation (2025.findings-acl)
Copied to clipboard
| Challenge: | Autoregressive decoders in large language models excel at capturing sequential behaviors for generative recommendations, but they lack graph-structured user-item interactions, which are widely recognized as beneficial. |
| Approach: | They propose a novel algorithm that adapts LLMs’ decoders with graph reasoning for recommendation by augmenting the decoding logits with an auxiliary GNN model to optimize token generation. |
| Outcome: | The proposed model outperforms state-of-the-art models in sequential recommendations. |