TGFormer: Towards Temporal Graph Transformer with Auto-Correlation Mechanism
Not on the map. Why?
Abstract (arXiv)
The growing interest in Temporal Graph Neural Networks (TGNNs) stems from their ability to model complex dynamics and deliver superior performance. However, TGNNs encounter fundamental challenges in capturing long-term dependencies and identifying periodic patterns. To address these limitations, we propose TGFormer, a novel Transformer architecture specifically designed for temporal graphs. Our model redefines temporal graph learning by establishing a trajectory framework that aligns with time series analysis principles. This approach allows TGFormer to derive node representations through systematic analysis of historical interactions, enabling granular examination of node relationships across sequential timestamps. Building upon stochastic process theory, we develop an auto-correlation mechanism that systematically uncovers periodic dependencies in node interactions. This innovation empowers TGFormer to perform dependency discovery and representation aggregation at sub-interaction levels, demonstrating superior efficiency and accuracy compared to conventional attention mechanisms. Experimental validation across six public benchmarks confirms the effectiveness of our approach, with TGFormer at most achieving 9.35% precision improvement compared to state-of-the-art approaches.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 27 of its 42 references that are in the map. First posted on arXiv 24 May 2026.
Builds on
27 of 42 references.
References · 27
- 2017Attention Is All You Needcited by 59,932
- 2021Autoformer: Decomposition Transformers with Auto-Correlation for Long-Term Series Forecastingcited by 1,654
- 2022FEDformer: Frequency Enhanced Decomposed Transformer for Long-term Series Forecastingcited by 1,200
- 2020On Layer Normalization in the Transformer Architecturecited by 906
- 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 521
- 2020Inductive Representation Learning on Temporal Graphscited by 454
- 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 443
- 2023NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classificationcited by 207
- 2021Inductive Representation Learning in Temporal Networks via Causal Anonymous Walkscited by 188
- 2023Exphormer: Sparse Transformers for Graphscited by 166
- 2023Towards Better Dynamic Graph Learning: New Architecture and Unified Librarycited by 154
- 2023Do We Really Need Complicated Model Architectures For Temporal Networks?cited by 141
15 more
- 2022NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphscited by 137
- 2023SGFormer: Simplifying and Empowering Transformers for Large-Graph Representationscited by 131
- 2022Towards Better Evaluation for Dynamic Link Predictioncited by 120
- 2021Do Transformer Modifications Transfer Across Implementations and Applications?cited by 87
- 2023DIFFormer: Scalable (Graph) Transformers Induced by Energy Constrained Diffusioncited by 85
- 2021TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learningcited by 65
- 2023Graph Neural Networks for temporal graphs: State of the art, open challenges, and opportunitiescited by 60
- 2022Provably expressive temporal graph networkscited by 56
- 2024On the Feasibility of Simple Transformer for Dynamic Graph Modelingcited by 22
- 2022Temporal Link Prediction: A Unified Framework, Taxonomy, and Reviewcited by 20
- 2022HAQJSK: Hierarchical-Aligned Quantum Jensen-Shannon Kernels for Graph Classificationcited by 18
- 2022Graph Sequential Neural ODE Process for Link Prediction on Dynamic and Sparse Graphscited by 13
- 2023Temporal Graph Representation Learning with Adaptive Augmentation Contrastivecited by 5
- 2021Social Link Inference via Multi-View Matching Network from Spatio-Temporal Trajectoriescited by 4
- 2025A Survey on Temporal Interaction Graph Representation Learning: Progress, Challenges, and Opportunitiescited by 4
Built on by
Not cited yet.