GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphs
Abstract
We propose a new network architecture, ted ttention etworks (GaAN), for learning on graphs. Unlike the traditional multi-head attention mechanism, which equally consumes all attention heads, GaAN uses a convolutional sub-network to control each attention head's importance. We demonstrate the effectiveness of GaAN on the inductive node classification problem. Moreover, with GaAN as a building block, we construct the Graph Gated Recurrent Unit (GGRU) to address the traffic speed forecasting problem. Extensive experiments on three real-world datasets show that our GaAN framework achieves state-of-the-art results on both tasks.
Benchmark Results
Tested on 2 datasets
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | F1 ↑ | Paper |
|---|---|---|---|
| 1 | EnGCN | 0.9714
±0.0003 | |
| 2 | SAGN+SLE | 0.9710 | |
| 3 | GAMLP(JK) | 0.9704
±0.0001 | |
| 14 | GraphSAGE | 0.9660 best reported | best today: Accelerating Large Scale Real-Time GNN Inference using Channel Pruning (2021) |
| 26 | GaAN | 0.9640 best reported | Difference within reported uncertainty; not counted as underperformance. |
| 35 | Attention-only | 0.9619
±0.0007 | This paper |
| 43 | Pairwise+sigmoid | 0.9586
±0.0008 | This paper |
| 45 | Pairwise+tanh | 0.9580
±0.0003 | This paper |
| 47 | Avg. pooling | 0.9578
±0.0007 | This paper |
| 52 | Max pooling | 0.9562
±0.0003 | This paper |
| 58 | GCN | 0.9530
±0.0010 | |
| 91 | FastGCN | 0.9370 | This paper |
| 123 | 2-Layer FNN | 0.7358
±0.0009 | This paper |
| # | Model | F1 ↑ | Paper |
|---|---|---|---|
| 1 | GAMLP(JK) | 0.9982
±0.0001 | |
| 2 | GraphCON-GCN | 0.9960 | |
| 3 | GCNII | 0.9953
±0.0001 | |
| 17 | GaAN | 0.9871
±0.0002 | This paper |
| 21 | GCN | 0.9850 | |
| 23 | Attention-only | 0.9846
±0.0009 | This paper |
| 26 | Max pooling | 0.9839
±0.0005 | This paper |
| 27 | Pairwise+sigmoid | 0.9839
±0.0005 | This paper |
| 28 | Pairwise+tanh | 0.9832
±0.0018 | This paper |
| 57 | GAT | 0.9732
±0.0032 best reported | best today: HAT-GAE: Self-Supervised Graph Auto-encoders with Hierarchical Adaptive Masking and Trainable Corruption (2023) Difference within reported uncertainty; not counted as underperformance. |
| 69 | Avg. pooling | 0.9685
±0.0019 | This paper |
| 101 | GraphSAGE | 0.7860 best reported | best today: Optimization-Induced Graph Implicit Nonlinear Diffusion (ICML 2022) |
| 163 | 2-Layer FNN | 0.5407
±0.0006 | This paper |
| 173 | MLP | 0.4620 |
