LGAIApr 15, 2025

Trajectory Encoding Temporal Graph Networks

arXiv:2504.11386v1h-index: 49Has Code
Originality Incremental advance
AI Analysis

This work addresses a key challenge in dynamic graph learning for tasks like link prediction and node classification, offering a unified solution that is incremental but impactful for the field.

The paper tackled the dilemma in Temporal Graph Networks (TGNs) between transductive accuracy and inductive generalization by proposing Trajectory Encoding TGN (TETGN), which integrates learnable temporal positional features and message passing to balance these aspects, achieving significant performance improvements on link prediction and node classification across three real-world datasets.

Temporal Graph Networks (TGNs) have demonstrated significant success in dynamic graph tasks such as link prediction and node classification. Both tasks comprise transductive settings, where the model predicts links among known nodes, and in inductive settings, where it generalises learned patterns to previously unseen nodes. Existing TGN designs face a dilemma under these dual scenarios. Anonymous TGNs, which rely solely on temporal and structural information, offer strong inductive generalisation but struggle to distinguish known nodes. In contrast, non-anonymous TGNs leverage node features to excel in transductive tasks yet fail to adapt to new nodes. To address this challenge, we propose Trajectory Encoding TGN (TETGN). Our approach introduces automatically expandable node identifiers (IDs) as learnable temporal positional features and performs message passing over these IDs to capture each node's historical context. By integrating this trajectory-aware module with a standard TGN using multi-head attention, TETGN effectively balances transductive accuracy with inductive generalisation. Experimental results on three real-world datasets show that TETGN significantly outperforms strong baselines on both link prediction and node classification tasks, demonstrating its ability to unify the advantages of anonymous and non-anonymous models for dynamic graph learning.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes