Todyformer: Towards Holistic Dynamic Graph Transformers with Structure-Aware Tokenization
Not on the map. Why?
Abstract (arXiv)
Temporal Graph Neural Networks have garnered substantial attention for their capacity to model evolving structural and temporal patterns while exhibiting impressive performance. However, it is known that these architectures are encumbered by issues that constrain their performance, such as over-squashing and over-smoothing. Meanwhile, Transformers have demonstrated exceptional computational capacity to effectively address challenges related to long-range dependencies. Consequently, we introduce Todyformer-a novel Transformer-based neural network tailored for dynamic graphs. It unifies the local encoding capacity of Message-Passing Neural Networks (MPNNs) with the global encoding of Transformers through i) a novel patchifying paradigm for dynamic graphs to improve over-squashing, ii) a structure-aware parametric tokenization strategy leveraging MPNNs, iii) a Transformer with temporal positional-encoding to capture long-range dependencies, and iv) an encoding architecture that alternates between local and global contextualization, mitigating over-smoothing in MPNNs. Experimental evaluations on public benchmark datasets demonstrate that Todyformer consistently outperforms the state-of-the-art methods for downstream tasks. Furthermore, we illustrate the underlying aspects of the proposed model in effectively capturing extensive temporal dependencies in dynamic graphs.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 30 of its 42 references that are in the map. First posted on arXiv 2 Feb 2024.
Builds on
30 of 42 references.
References · 30
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,082
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2021MLP-Mixer: An all-MLP Architecture for Visioncited by 1,441
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 702
- 2020A Generalization of Transformer Networks to Graphscited by 653
- 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 521
- 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 471
18 more
- 2021Rethinking Graph Transformers with Spectral Attentioncited by 468
- 2020Inductive Representation Learning on Temporal Graphscited by 454
- 2019Predicting Dynamic Embedding Trajectory in Temporal Interaction Networkscited by 443
- 2019Representation Learning for Dynamic Graphs: A Surveycited by 260
- 2019Time2Vec: Learning a Vector Representation of Timecited by 208
- 2022Structure-Aware Transformer for Graph Representation Learningcited by 191
- 2021Inductive Representation Learning in Temporal Networks via Causal Anonymous Walkscited by 188
- 2022Pure Transformers are Powerful Graph Learnerscited by 188
- 2020Graph-Bert: Only Attention is Needed for Learning Graph Representationscited by 176
- 2023Towards Better Dynamic Graph Learning: New Architecture and Unified Librarycited by 154
- 2017Know-Evolve: Deep Temporal Reasoning for Dynamic Knowledge Graphscited by 149
- 2023Do We Really Need Complicated Model Architectures For Temporal Networks?cited by 141
- 2023Temporal Graph Benchmark for Machine Learning on Temporal Graphscited by 137
- 2020Learning to Drop: Robust Graph Neural Network via Topological Denoisingcited by 127
- 2022Towards Better Evaluation for Dynamic Link Predictioncited by 120
- 2022A Generalization of ViT/MLP-Mixer to Graphscited by 93
- 2022Provably expressive temporal graph networkscited by 56
- 2022Neighborhood-aware Scalable Temporal Network Representation Learningcited by 54
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.