mlsanityData to 7 Oct 2026

SeDyT: A General Framework for Multi-Step Event Forecasting via Sequence Modeling on Dynamic Entity Embeddings

arXiv 2109.04550 ↗First posted 9 Sep 2021cs.LG cs.CLcited by 3

Not on the map. Why?

Abstract (arXiv)

Temporal Knowledge Graphs store events in the form of subjects, relations, objects, and timestamps which are often represented by dynamic heterogeneous graphs. Event forecasting is a critical and challenging task in Temporal Knowledge Graph reasoning that predicts the subject or object of an event in the future. To obtain temporal embeddings multi-step away in the future, existing methods learn generative models that capture the joint distribution of the observed events. To reduce the high computation costs, these methods rely on unrealistic assumptions of independence and approximations in training and inference. In this work, we propose SeDyT, a discriminative framework that performs sequence modeling on the dynamic entity embeddings to solve the multi-step event forecasting problem. SeDyT consists of two components: a Temporal Graph Neural Network that generates dynamic entity embeddings in the past and a sequence model that predicts the entity embeddings in the future. Compared with the generative models, SeDyT does not rely on any heuristic-based probability model and has low computation complexity in both training and inference. SeDyT is compatible with most Temporal Graph Neural Networks and sequence models. We also design an efficient training method that trains the two components in one gradient descent propagation. We evaluate the performance of SeDyT on five popular datasets. By combining temporal Graph Neural Network models and sequence models, SeDyT achieves an average of 2.4% MRR improvement when not using the validation set and more than 10% MRR improvement when using the validation set.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 17 of its 32 references that are in the map. First posted on arXiv 9 Sep 2021.

Builds on

17 of 32 references.

References · 17

  1. 2017Attention Is All You Needcited by 59,932
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  4. 2017Graph Attention Networkscited by 8,854
  5. 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,016
  6. 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,684
  7. 2019RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Spacecited by 893
  8. 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 875
  9. 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 521
  10. 2020Inductive Representation Learning on Temporal Graphscited by 454
  11. 2019EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphscited by 443
  12. 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 442
5 more
  1. 2016Structured Sequence Modeling with Graph Convolutional Recurrent Networkscited by 273
  2. 2021Inductive Representation Learning in Temporal Networks via Causal Anonymous Walkscited by 188
  3. 2017Know-Evolve: Deep Temporal Reasoning for Dynamic Knowledge Graphscited by 149
  4. 2020Learning from History: Modeling Temporal Knowledge Graphs with Sequential Copy-Generation Networkscited by 84
  5. 2020TeRo: A Time-aware Knowledge Graph Embedding via Temporal Rotationcited by 48

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 0; 2024: 1.

3 papers.