Graph Triple Attention Network: A Decoupled Perspective
Abstract
Graph Transformers (GTs) have recently achieved significant success in the graph domain by effectively capturing both long-range dependencies and graph inductive biases. However, these methods face two primary challenges: (1) multi-view chaos, which results from coupling multi-view information (positional, structural, attribute), thereby impeding flexible usage and the interpretability of the propagation process. (2) local-global chaos, which arises from coupling local message passing with global attention, leading to issues of overfitting and over-globalizing. To address these challenges, we propose a high-level decoupled perspective of GTs, breaking them down into three components and two interaction levels: positional attention, structural attention, and attribute attention, alongside local and global interaction. Based on this decoupled perspective, we design a decoupled graph triple attention network named DeGTA, which separately computes multi-view attentions and adaptively integrates multi-view local and global information. This approach offers three key advantages: enhanced interpretability, flexible design, and adaptive integration of local and global information. Through extensive experiments, DeGTA achieves state-of-the-art performance across various datasets and tasks, including node classification and graph classification. Comprehensive ablation studies demonstrate that decoupling is essential for improving performance and enhancing interpretability.
Benchmark Results
Tested on 11 datasets 17 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphSAGE+CNA | 0.9418
±0.0033 | |
| 2 | GCN+CNA | 0.9366
±0.0048 | |
| 3 | TransformerConv | 0.9350
±0.0058 | |
| 21 | GCN | 0.9004 | |
| 236 | de_attn + ada_inte | 0.8479 | This paper |
| 455 | de_attn + c_inte | 0.8264 | This paper |
| 472 | c_attn | 0.8244 | This paper |
| 724 | MLP | 0.7768 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | CNA | 0.9575
±0.0058 | |
| 2 | IS-GIB | 0.9390
±0.0187 | |
| 3 | EERM | 0.9112
±0.0145 | |
| 44 | GCN | 0.8033
±0.0088 | |
| 256 | de_attn + ada_inte | 0.7370 | This paper |
| 350 | MLP | 0.7289
±0.0010 | |
| 353 | de_attn + c_inte | 0.7285 | This paper |
| 420 | c_attn | 0.7240 | This paper |
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 | |
| 34 | MLP | 0.9230
±0.0070 | |
| 53 | GraphSAGE | 0.9000
±0.0365 | |
| 134 | de_attn + ada_inte | 0.8544 | This paper |
| 177 | c_attn | 0.8359 | This paper |
| 200 | de_attn + c_inte | 0.8226 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9541
±0.0272 | |
| 2 | ACM-GCN | 0.9480
±0.0380 | |
| 3 | RF-GCN | 0.9429 | |
| 24 | MLP | 0.9136
±0.0070 | |
| 132 | de_attn + ada_inte | 0.8319 | This paper |
| 138 | SAGE | 0.8269 | |
| 151 | de_attn + c_inte | 0.8217 | This paper |
| 175 | c_attn | 0.8046 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | DiGGR | 0.4535
±0.0353 | |
| 2 | TRIGON | 0.4402
±0.0028 | |
| 3 | DoG | 0.4320
±0.0120 | |
| 23 | SGFormer | 0.4169
±0.0063 best reported | best today: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 38 | GCNII | 0.4082
±0.0179 best reported | best at pub: Feature Expansion for Graph Neural Networks (ICML 2023) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) |
| 42 | MLP | 0.4026
±0.0108 | |
| 45 | GT | 0.4010 best reported | |
| 49 | NAGphormer | 0.4008
±0.0150 best reported | best today: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 52 | GPRGNN | 0.3992
±0.0067 best reported | best at pub: LON-GNN: Spectral GNNs with Learnable Orthonormal Basis (2023) best today: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 68 | GraphSAGE | 0.3899
±0.0085 best reported | best at pub: A Quasi-Wasserstein Loss for Learning Graph Neural Networks (WWW 2023) |
| 98 | DeGTA | 0.3787
±0.0100 | This paper |
| 110 | GraphGPS | 0.3768
±0.0094 best reported | best today: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 135 | GCN | 0.3690 best reported | best at pub: Beyond Low-frequency Information in Graph Convolutional Networks (AAAI 2021) |
| 136 | NodeFormer | 0.3628
±0.0120 | prev best: SignGT: Signed Attention-based Graph Transformer for Graph Representation Learning (2023) Improvement within reported uncertainty; not highlighted. |
| 157 | AERO-GNN | 0.3657
±0.0110 | This paper |
| 182 | GAT | 0.3605
±0.0035 best reported | best at pub: Hierarchical Graph Transformer with Adaptive Node Sampling (NeurIPS 2022) |
| 230 | GATv2 | 0.3510
±0.0020 best reported | best at pub: Heterophily-Aware Graph Attention Network (2023) best today: What Can We Learn From MIMO Graph Convolutions? (IJCAI 2025) |
| 245 | ADSF | 0.3468
±0.0090 | This paper |
| 266 | GIN | 0.3410
±0.0030 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | DMD++ | 0.9190
±0.0260 | |
| 2 | F-GREAD-BS | 0.9059
±0.0380 | |
| 3 | APPNP | 0.9010
±0.0350 | |
| 31 | de_attn + ada_inte | 0.8695 | This paper |
| 37 | MLP | 0.8629
±0.0450 | |
| 50 | de_attn + c_inte | 0.8449 | This paper |
| 61 | c_attn | 0.8327 | This paper |
| 63 | GCN | 0.8310
±0.0320 |
LRGB
| # | Model | MAE ↓ | Paper |
|---|---|---|---|
| 1 | GCN | 0.2421
±0.0016 best reported | best at pub: Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark (TMLR 2023) best today: From Message-Passing to Linearized Graph Sequence Models (2026) |
| 2 | IPR-MPNN | 0.2422
±0.0007 | |
| 3 | TANGO-GPS | 0.2422
±0.0014 | |
| 5 | GIN | 0.2429
±0.0019 best reported | best at pub: Transformers are efficient hierarchical chemical graph learners (2023) best today: From Message-Passing to Linearized Graph Sequence Models (2026) |
| 12 | DeGTA | 0.2437
±0.0014 | This paper |
| 32 | GRIT | 0.2460
±0.0012 | This paper |
| 87 | GraphGPS | 0.2500
±0.0012 | This paper |
| 112 | GT | 0.2529
±0.0016 | This paper |
| 124 | SAN | 0.2545
±0.0012 | This paper |
| 159 | GAT | 0.2700
±0.0100 best reported | best at pub: Graph Neural Networks Gone Hogwild (ICLR 2024) best today: Sequential Signal Mixing Aggregation for Message Passing Graph Neural Networks (NeurIPS 2024) |
| 201 | MLP | 0.4351
±0.0008 |
| # | Model | AP ↑ | Paper |
|---|---|---|---|
| 1 | S^2GCN | 0.7311
±0.0066 | |
| 2 | S4G | 0.7293
±0.0004 | |
| 3 | BuNN | 0.7276
±0.0065 | |
| 4 | GCN | 0.7261
±0.0011 best reported | best at pub: Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark (TMLR 2023) best today: From Message-Passing to Linearized Graph Sequence Models (2026) |
| 26 | GIN | 0.7059
±0.0089 best reported | best today: From Message-Passing to Linearized Graph Sequence Models (2026) |
| 30 | DeGTA | 0.7023
±0.0101 | This paper |
| 36 | GRIT | 0.6988
±0.0082 | This paper |
| 79 | GraphGPS | 0.6620
±0.0073 best reported | best today: Benchmarking Positional Encodings for GNNs and Graph Transformers (KDD 2024) Difference within reported uncertainty; not counted as underperformance. |
| 112 | SAN | 0.6439
±0.0075 | This paper |
| 120 | GT | 0.6326
±0.0126 | This paper |
| 152 | GAT | 0.5842
±0.0046 | This paper |
| 181 | MLP | 0.4060
±0.0021 |
GNNBenchmark
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | Schrödinger | 0.9913
±0.0004 | |
| 2 | CNN | 0.9907
±0.0007 | |
| 3 | MPNN | 0.9895
±0.0006 | |
| 11 | GatedGCN | 0.9855
±0.0002 | |
| 32 | GIN | 0.9833
±0.0011 best reported | best at pub: Graph-Coupled Oscillator Networks (ICML 2022) |
| 38 | DeGTA | 0.9823
±0.0011 | This paper |
| 47 | EGT | 0.9817
±0.0009 | This paper |
| 62 | GraphGPS | 0.9805
±0.0013 | This paper |
| 86 | GAT | 0.9755
±0.0003 best reported | best at pub: RandAlign: A Parameter-Free Method for Regularizing Graph Convolutional Networks (2024) |
| 95 | GraphSAGE | 0.9731
±0.0010 | |
| 126 | MLP | 0.9534
±0.0014 | |
| 135 | GCN | 0.9405
±0.0005 best reported | best at pub: RandAlign: A Parameter-Free Method for Regularizing Graph Convolutional Networks (2024) |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | RandAlign | 0.7942
±0.0007 | |
| 2 | differential encoding | 0.7907
±0.0027 | |
| 3 | PPGT | 0.7856
±0.0070 | |
| 6 | DeGTA | 0.7676
±0.0093 | This paper |
| 50 | GraphGPS | 0.7230
±0.0036 | This paper |
| 62 | GatedGCN | 0.7133
±0.0039 | |
| 82 | EGT | 0.6870
±0.0041 | This paper |
| 92 | GraphSAGE | 0.6690
±0.0020 | |
| 101 | GAT | 0.6611
±0.0098 best reported | best at pub: Formatting Instructions for ICLR 2021 Conference Submissions (2020) |
| 109 | GIN | 0.6510
±0.0050 best reported | best at pub: Beyond Low-pass Filtering: Graph Convolutional Networks with Automatic Filtering (2021) |
| 124 | GCN | 0.5839
±0.0073 best reported | best at pub: From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awareness (ICLR 2021) |
| 126 | MLP | 0.5634
±0.0018 |
Other Graph Benchmarks
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | MA-GCL | 0.8883
±0.0030 | |
| 2 | CCA-SSG | 0.8842
±0.0030 | |
| 3 | ARIEL | 0.8827
±0.0020 | |
| 10 | GCN | 0.8651
±0.0050 | |
| 15 | DeGTA | 0.7849
±0.0029 | This paper |
| 17 | NAGphormer | 0.7798
±0.0016 best reported | |
| 20 | GRAND | 0.7583
±0.0021 | |
| 21 | GraphSAINT | 0.7521
±0.0015 best reported | best at pub: Tokenized Graph Transformer with Neighborhood Augmentation for Node Classification in Large Graphs (2023) Difference within reported uncertainty; not counted as underperformance. |
