Learning Temporal Attention in Dynamic Graphs with Bilinear Interactions
Not on the map. Why?
Abstract (arXiv)
Reasoning about graphs evolving over time is a challenging concept in many domains, such as bioinformatics, physics, and social networks. We consider a common case in which edges can be short term interactions (e.g., messaging) or long term structural connections (e.g., friendship). In practice, long term edges are often specified by humans. Human-specified edges can be both expensive to produce and suboptimal for the downstream task. To alleviate these issues, we propose a model based on temporal point processes and variational autoencoders that learns to infer temporal attention between nodes by observing node communication. As temporal attention drives between-node feature propagation, using the dynamics of node interactions to learn this key component provides more flexibility while simultaneously avoiding issues associated with human-specified edges. We also propose a bilinear transformation layer for pairs of node features instead of concatenation, typically used in prior work, and demonstrate its superior performance in all cases. In experiments on two datasets in the dynamic link prediction task, our model often outperforms the baseline model that requires a human-specified graph. Moreover, our learned attention is semantically interpretable and infers connections similar to actual graphs.
Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). First posted on arXiv 23 Sep 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 3; 2024: 2; 2025: 2.
11 papers.
- 2021A Survey on Embedding Dynamic Graphscited by 60
- 2024A Comprehensive Survey of Dynamic Graph Neural Networks: Models, Frameworks, Benchmarks, Experiments and Challengescited by 30
- 2024A survey of dynamic graph neural networkscited by 24
- 2025TGB-Seq Benchmark: Challenging Temporal GNNs with Complex Sequential Dynamicscited by 15
- 2023NeutronStream: A Dynamic GNN Training Framework with Sliding Window for Graph Streamscited by 6
- 2025Future Link Prediction Without Memory or Aggregationcited by 5
- 2021Temporal Graph Network Embedding with Causal Anonymous Walks Representationscited by 2
- 2022Bottleneck Analysis of Dynamic Graph Neural Network Inference on CPU and GPUcited by 2
- 2021Learning Representation over Dynamic Graph using Aggregation-Diffusion Mechanismcited by 1
- 2023Who Should I Engage with At What Time? A Missing Event Aware Temporal Graph Neural Networkcited by 1
- 2023Enhancing Asynchronous Time Series Forecasting with Contrastive Relational Inferencecited by 0
- 2025Future Link Prediction Without Memory or Aggregation26 May 2025
- 2025TGB-Seq Benchmark: Challenging Temporal GNNs with Complex Sequential Dynamics5 Feb 2025
- 2024A Comprehensive Survey of Dynamic Graph Neural Networks: Models, Frameworks, Benchmarks, Experiments and Challenges1 May 2024
- 2024A survey of dynamic graph neural networks28 Apr 2024
- 2023NeutronStream: A Dynamic GNN Training Framework with Sliding Window for Graph Streams5 Dec 2023
- 2023Enhancing Asynchronous Time Series Forecasting with Contrastive Relational Inference6 Sep 2023
- 2023Who Should I Engage with At What Time? A Missing Event Aware Temporal Graph Neural Network20 Jan 2023
- 2022Bottleneck Analysis of Dynamic Graph Neural Network Inference on CPU and GPU8 Oct 2022
- 2021Temporal Graph Network Embedding with Causal Anonymous Walks Representations19 Aug 2021
- 2021Learning Representation over Dynamic Graph using Aggregation-Diffusion Mechanism3 Jun 2021
- 2021A Survey on Embedding Dynamic Graphs4 Jan 2021