Unifying and Enhancing Graph Transformers via a Hierarchical Mask Framework
On the map: Mixture-of-experts → MoE for time series and graphs
Abstract (arXiv)
Graph Transformers (GTs) have emerged as a powerful paradigm for graph representation learning due to their ability to model diverse node interactions. However, existing GTs often rely on intricate architectural designs tailored to specific interactions, limiting their flexibility. To address this, we propose a unified hierarchical mask framework that reveals an underlying equivalence between model architecture and attention mask construction. This framework enables a consistent modeling paradigm by capturing diverse interactions through carefully designed attention masks. Theoretical analysis under this framework demonstrates that the probability of correct classification positively correlates with the receptive field size and label consistency, leading to a fundamental design principle: an effective attention mask should ensure both a sufficiently large receptive field and a high level of label consistency. While no single existing mask satisfies this principle across all scenarios, our analysis reveals that hierarchical masks offer complementary strengths, motivating their effective integration. Then, we introduce M3Dphormer, a Mixture-of-Experts-based Graph Transformer with Multi-Level Masking and Dual Attention Computation. M3Dphormer incorporates three theoretically grounded hierarchical masks and employs a bi-level expert routing mechanism to adaptively integrate multi-level interaction information. To ensure scalability, we further introduce a dual attention computation scheme that dynamically switches between dense and sparse modes based on local mask sparsity. Extensive experiments across multiple benchmarks demonstrate that M3Dphormer achieves state-of-the-art performance, validating the effectiveness of our unified framework and model design.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in MoE for time series and graphs, one of 12 directions in Mixture-of-experts. Builds on 40 of its 51 references that are in the map. First posted on arXiv 21 Oct 2025.
Builds on
40 of 51 references.
Closest ancestors · 1
Same direction, newest first
Other references · 39
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2016Layer Normalizationcited by 5,669
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,434
27 more
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
- 2020Rethinking Attention with Performerscited by 1,601
- 2019Root Mean Square Layer Normalizationcited by 1,480
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,102
- 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
- 2021How Attentive are Graph Attention Networks?cited by 835
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 595
- 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 478
- 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 362
- 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 343
- 2019Revisiting Graph Neural Networks: All We Have is Low-Pass Filterscited by 261
- 2023NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classificationcited by 210
- 2023Exphormer: Sparse Transformers for Graphscited by 170
- 2022NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphscited by 137
- 2023SGFormer: Simplifying and Empowering Transformers for Large-Graph Representationscited by 133
- 2022A Generalization of ViT/MLP-Mixer to Graphscited by 93
- 2024Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classificationcited by 85
- 2022Expander Graph Propagationcited by 75
- 2024Polynormer: Polynomial-Expressive Graph Transformer in Linear Timecited by 65
- 2024VCR-Graphormer: A Mini-batch Graph Transformer via Virtual Connectionscited by 34
- 2025Can Classic GNNs Be Strong Baselines for Graph-level Tasks? Simple Architectures Meet Excellencecited by 26
- 2024FlashMask: Efficient and Rich Mask Extension of FlashAttentioncited by 20
- 2023Hierarchical Transformer for Scalable Graph Learningcited by 17
- 2024Leveraging Contrastive Learning for Enhanced Node Representations in Tokenized Graph Transformerscited by 9
- 2024Cluster-wise Graph Transformer with Dual-granularity Kernelized Attentioncited by 8
Built on by
Citing papers per year: 2026: 2.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2024SGFormer: Single-Layer Graph Transformers with Approximation-Free Linear Complexity
- 2025Leveraging Manifold Embeddings for Enhanced Graph Transformer Representations and Learning
- 2025Towards Mechanistic Interpretability of Graph Transformers via Attention Graphs
- 2026DTA-GT: Direction- and Topology-Aware Graph Transformer for Neural Network Representation Learning
- 2026VecFormer: Towards Efficient and Generalizable Graph Transformer with Graph Token Attention
- 2026Teaching LLMs to See Graphs: Unifying Text and Structural Reasoning
- 2025One Router to Route Them All: Homogeneous Expert Routing for Heterogeneous Graph Transformers
- 2025NTSFormer: A Self-Teaching Graph Transformer for Multimodal Isolated Cold-Start Node Classification