OpenGT: A Comprehensive Benchmark For Graph Transformers
Abstract
Graph Transformers (GTs) have recently demonstrated remarkable performance across diverse domains. By leveraging attention mechanisms, GTs are capable of modeling long-range dependencies and complex structural relationships beyond local neighborhoods. However, their applicable scenarios are still underexplored, this highlights the need to identify when and why they excel. Furthermore, unlike GNNs, which predominantly rely on message-passing mechanisms, GTs exhibit a diverse design space in areas such as positional encoding, attention mechanisms, and graph-specific adaptations. Yet, it remains unclear which of these design choices are truly effective and under what conditions. As a result, the community currently lacks a comprehensive benchmark and library to promote a deeper understanding and further development of GTs. To address this gap, this paper introduces OpenGT, a comprehensive benchmark for Graph Transformers. OpenGT enables fair comparisons and multidimensional analysis by establishing standardized experimental settings and incorporating a broad selection of state-of-the-art GNNs and GTs. Our benchmark evaluates GTs from multiple perspectives, encompassing diverse tasks and datasets with varying properties. Through extensive experiments, our benchmark has uncovered several critical insights, including the difficulty of transferring models across task levels, the limitations of local attention, the efficiency trade-offs in several models, the application scenarios of specific positional encodings, and the preprocessing overhead of some positional encodings. We aspire for this work to establish a foundation for future graph transformer research emphasizing fairness, reproducibility, and generalizability. We have developed an easy-to-use library OpenGT for training and evaluating existing GTs. The benchmark code is available at https://github.com/eaglelab-zju/OpenGT.
Benchmark Results
Tested on 3 datasets 17 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Heterophilic Graphs
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9672
±0.0147 | |
| 2 | DoG | 0.9660
±0.0210 | |
| 3 | GPF-plus | 0.9583
±0.0419 | |
| 32 | SGFormer | 0.9246
±0.0148 best reported | best at pub: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 34 | MLP | 0.9230
±0.0070 | |
| 46 | APPNP | 0.9131
±0.0197 best reported | best at pub: A Quasi-Wasserstein Loss for Learning Graph Neural Networks (WWW 2023) |
| 53 | GraphSAGE | 0.9000
±0.0365 | |
| 87 | Specformer | 0.8823
±0.0038 best reported | best at pub: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 155 | NodeFormer | 0.8463
±0.0347 best reported | best at pub: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 211 | GAT | 0.8162
±0.0645 best reported | best at pub: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) best today: Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models (2025) |
| 257 | GCN | 0.7933
±0.0447 best reported | best at pub: Graph Wave Networks (WWW 2025) |
| 281 | Graphormer | 0.7748
±0.0127 | This paper |
| 296 | CoBFormer | 0.7652
±0.0238 best reported | best today: Deeper with Riemannian Geometry: Overcoming Oversmoothing and Oversquashing for Graph Foundation Models (NeurIPS 2025) Difference within reported uncertainty; not counted as underperformance. |
| 323 | GPS | 0.7478
±0.0127 | This paper |
| 371 | DIFFormer | 0.7207
±0.0337 | This paper |
| 388 | GRIT | 0.7027
±0.0382 | This paper |
| 426 | SAN | 0.6667
±0.0337 | This paper |
| 487 | DeGTA | 0.6126
±0.0127 | This paper |
| 498 | Graphtransformer | 0.6036
±0.0255 | This paper |
| 611 | Exphormer | 0.3784
±0.0221 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9541
±0.0272 | |
| 2 | ACM-GCN | 0.9480
±0.0380 | |
| 3 | RF-GCN | 0.9429 | |
| 21 | APPNP | 0.9181
±0.0196 best reported | best at pub: LON-GNN: Spectral GNNs with Learnable Orthonormal Basis (2023) |
| 24 | MLP | 0.9136
±0.0070 | |
| 138 | SAGE | 0.8269 | |
| 158 | GAT | 0.8190
±0.0540 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 170 | GCN | 0.8082
±0.0360 best reported | best at pub: Differentiable Cluster Graph Neural Network (2024) best today: Bayesian Neighborhood Adaptation for Graph Neural Networks (TMLR 2025) |
| 235 | Specformer | 0.7478
±0.0255 | This paper |
| 256 | GPS | 0.7297
±0.0221 | This paper |
| 267 | SGFormer | 0.7207
±0.0127 | This paper |
| 276 | Graphormer | 0.7117
±0.0127 | This paper |
| 277 | CoBFormer | 0.7117
±0.0337 | This paper |
| 315 | SAN | 0.6667
±0.0337 | This paper |
| 323 | NodeFormer | 0.6577
±0.0459 | prev best: Graph Structure Refinement with Energy-based Contrastive Learning (AAAI 2024) |
| 331 | DIFFormer | 0.6486
±0.0441 | This paper |
| 332 | GRIT | 0.6486
±0.0584 | This paper |
| 440 | Exphormer | 0.5405
±0.0441 | This paper |
| 453 | DeGTA | 0.5315
±0.0459 | This paper |
| 556 | Graphtransformer | 0.3874
±0.0127 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | DiGGR | 0.4535
±0.0353 | |
| 2 | TRIGON | 0.4402
±0.0028 | |
| 3 | DoG | 0.4320
±0.0120 | |
| 19 | Specformer | 0.4193
±0.0104 best reported | best at pub: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 23 | SGFormer | 0.4169
±0.0063 best reported | best at pub: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 41 | APPNP | 0.4046
±0.0064 best reported | best at pub: A Quasi-Wasserstein Loss for Learning Graph Neural Networks (WWW 2023) |
| 42 | MLP | 0.4026
±0.0108 | |
| 67 | Exphormer | 0.3901
±0.0069 best reported | best at pub: Even Sparser Graph Transformers (NeurIPS 2024) |
| 68 | GraphSAGE | 0.3899
±0.0085 | |
| 98 | DeGTA | 0.3787
±0.0100 best reported | best at pub: Graph Triple Attention Network: A Decoupled Perspective (2024) |
| 99 | Graphormer | 0.3785
±0.0029 best reported | best at pub: Hierarchical Graph Transformer with Adaptive Node Sampling (NeurIPS 2022) Difference within reported uncertainty; not counted as underperformance. |
| 124 | GPS | 0.3721
±0.0117 | This paper |
| 125 | CoBFormer | 0.3719
±0.0088 | This paper |
| 135 | GCN | 0.3690 best reported | best at pub: Beyond Low-frequency Information in Graph Convolutional Networks (AAAI 2021) |
| 136 | NodeFormer | 0.3690
±0.0100 best reported | best at pub: Even Sparser Graph Transformers (NeurIPS 2024) |
| 141 | DIFFormer | 0.3682
±0.0110 | This paper |
| 182 | GAT | 0.3605
±0.0035 best reported | best at pub: Hierarchical Graph Transformer with Adaptive Node Sampling (NeurIPS 2022) |
| 381 | Graphtransformer | 0.2873
±0.0006 | This paper |
