Non-Local Graph Neural Networks
Abstract
Modern graph neural networks (GNNs) learn node embeddings through multilayer local aggregation and achieve great success in applications on assortative graphs. However, tasks on disassortative graphs usually require non-local aggregation. In addition, we find that local aggregation is even harmful for some disassortative graphs. In this work, we propose a simple yet effective non-local aggregation framework with an efficient attention-guided sorting for GNNs. Based on it, we develop various non-local GNNs. We perform thorough experiments to analyze disassortative graph datasets and evaluate our non-local GNNs. Experimental results demonstrate that our non-local GNNs significantly outperform previous state-of-the-art methods on my_colorseven benchmark datasets of disassortative graphs, in terms of both model performance and efficiency.
Benchmark Results
Tested on 8 datasets
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 | |
| 66 | NLGAT | 0.8850
±0.0180 | This paper |
| 89 | NLGCN | 0.8810
±0.0100 | This paper |
| 146 | Geom-GCN-g | 0.8700 | This paper |
| 207 | Geom-GCN | 0.8540
±0.0040 best reported | best today: The Expressive Power of Graph Neural Networks: A Survey (2023) Difference within reported uncertainty; not counted as underperformance. |
| 724 | MLP | 0.7768 | |
| 739 | NLMLP | 0.7690
±0.0180 | This paper |
| 794 | Geom-GCN-S | 0.7330 | 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 best reported | best today: Design your own universe: a physics-informed agnostic method for enhancing graph neural networks (2024) Difference within reported uncertainty; not counted as underperformance. |
| 53 | GraphSAGE | 0.9000
±0.0365 | |
| 136 | NLMLP | 0.8540
±0.0380 | This paper |
| 147 | H_2GCN | 0.8490
±0.0680 | This paper |
| 211 | GAT | 0.8162
±0.0645 best reported | best at pub: Heterophilic Graphs (ICLR 2020) best today: Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models (2025) |
| 213 | SimP-GCN | 0.8160 | This paper |
| 257 | GCN | 0.6110
±0.0700 | prev best: Heterophilic Graphs (ICLR 2020) best today: Graph Wave Networks (WWW 2025) Improvement within reported uncertainty; not highlighted. |
| 348 | Geom-GCN-S | 0.7350 | prev best: Heterophilic Graphs (ICLR 2020) |
| 350 | Geom-GCN-g | 0.7310 | This paper |
| 415 | Geom-GCN | 0.6760 | This paper |
| 438 | NLGCN | 0.6550
±0.0660 | This paper |
| 467 | NLGAT | 0.6260
±0.0710 | 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 best reported | best today: Node-oriented Spectral Filtering for Graph Neural Networks (2022) Difference within reported uncertainty; not counted as underperformance. |
| 92 | NLMLP | 0.8490
±0.0570 | This paper |
| 110 | SimP-GCN | 0.8410 | This paper |
| 138 | SAGE | 0.8269 | |
| 149 | H_2GCN | 0.8220
±0.0600 | This paper |
| 226 | Geom-GCN-S | 0.7540 | This paper |
| 311 | Geom-GCN-g | 0.6700 | This paper |
| 342 | Geom-GCN | 0.6412 best reported | best today: Steering Graph Neural Networks with Pinning Control (2023) |
| 407 | NLGCN | 0.5760
±0.0550 | This paper |
| 430 | NLGAT | 0.5470
±0.0760 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | DiGGR | 0.4535
±0.0353 | |
| 2 | TRIGON | 0.4402
±0.0028 | |
| 3 | DoG | 0.4320
±0.0120 | |
| 42 | MLP | 0.4026
±0.0108 best reported | best today: Heterophily-Aware Graph Attention Network (2023) |
| 68 | GraphSAGE | 0.3899
±0.0085 | |
| 87 | Geom-GCN | 0.3810 best reported | best today: Beyond Low-frequency Information in Graph Convolutional Networks (AAAI 2021) |
| 97 | NLMLP | 0.3790
±0.0130 | This paper |
| 135 | GCN | 0.3030
±0.0160 | prev best: Heterophilic Graphs (ICLR 2020) best today: Beyond Low-frequency Information in Graph Convolutional Networks (AAAI 2021) |
| 176 | H_2GCN | 0.3622
±0.0033 best reported | best today: Hierarchical Graph Transformer with Adaptive Node Sampling (NeurIPS 2022) Difference within reported uncertainty; not counted as underperformance. |
| 177 | SimP-GCN | 0.3620 | This paper |
| 182 | GAT | 0.2940
±0.0120 | prev best: Heterophilic Graphs (ICLR 2020) best today: Hierarchical Graph Transformer with Adaptive Node Sampling (NeurIPS 2022) Improvement within reported uncertainty; not highlighted. |
| 248 | Geom-GCN-S | 0.3460 | prev best: Heterophilic Graphs (ICLR 2020) |
| 301 | Geom-GCN-g | 0.3200 | This paper |
| 308 | NLGCN | 0.3160
±0.0100 | This paper |
| 362 | NLGAT | 0.2950
±0.0130 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | Hetero-S (GAT 8-layer) | 0.8693 | |
| 2 | Dir-GNN+CNA | 0.8586
±0.0180 | |
| 3 | GAT | 0.8560 best reported | best today: The Heterophilic Snowflake Hypothesis: Training and Empowering GNNs for Heterophilic Graphs (KDD 2024) |
| 52 | GCN | 0.7033 best reported | best today: Understanding Heterophily for Graph Neural Networks (ICML 2024) Difference within reported uncertainty; not counted as underperformance. |
| 55 | NLGCN | 0.7010
±0.0290 | This paper |
| 70 | Geom-GCN-g | 0.6800 | This paper |
| 82 | NLGAT | 0.6570
±0.0140 | This paper |
| 107 | FAGCN | 0.6344
±0.0205 best reported | best today: Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating (AAAI 2022) Difference within reported uncertainty; not counted as underperformance. |
| 108 | SAGE | 0.6340
±0.0300 | |
| 121 | H_2GCN | 0.6120
±0.0095 best reported | best today: Hierarchical Graph Transformer with Adaptive Node Sampling (NeurIPS 2022) Difference within reported uncertainty; not counted as underperformance. |
| 124 | Geom-GCN | 0.6090 | This paper |
| 169 | MLP | 0.5429 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | IBG-NN | 0.7763
±0.0179 | |
| 2 | Dir-GNN+CNA | 0.7747
±0.0128 | |
| 3 | DHGNN | 0.7684
±0.0161 | |
| 46 | GCN | 0.6067 best reported | best today: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 54 | NLGCN | 0.5900
±0.0120 | This paper |
| 62 | NLGAT | 0.5680
±0.0250 | This paper |
| 67 | GAT | 0.5630
±0.0220 best reported | best today: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 109 | Geom-GCN-g | 0.4600 | This paper |
| 120 | SAGE | 0.4460
±0.0130 | |
| 139 | FAGCN | 0.4259
±0.0069 best reported | |
| 172 | MLP | 0.3930
±0.0079 | |
| 179 | Geom-GCN | 0.3832
±0.0092 best reported | best today: Graph Neural Reaction Diffusion Models Submitted to the editors June 2023. Accepted in March 2024. (2024) Difference within reported uncertainty; not counted as underperformance. |
| 185 | H_2GCN | 0.3790
±0.0200 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | DMD++ | 0.9190
±0.0260 | |
| 2 | F-GREAD-BS | 0.9059
±0.0380 | |
| 3 | APPNP | 0.9010
±0.0350 | |
| 25 | NLMLP | 0.8730
±0.0430 | This paper |
| 34 | H_2GCN | 0.8670
±0.0470 | This paper |
| 37 | MLP | 0.8629
±0.0450 best reported | best today: Is Homophily a Necessity for Graph Neural Networks? (ICLR 2021) Difference within reported uncertainty; not counted as underperformance. |
| 41 | SimP-GCN | 0.8550 | This paper |
| 53 | GAT | 0.8430
±0.0370 best reported | best today: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 63 | GCN | 0.8310
±0.0320 best reported | best today: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 69 | GraphSAGE | 0.8118
±0.0556 | |
| 74 | Geom-GCN-S | 0.8040 | This paper |
| 132 | Geom-GCN-g | 0.6940 | This paper |
| 139 | Geom-GCN | 0.6757 best reported | best today: Global-Local Graph Neural Networks for Node-Classification (2024) |
| 170 | NLGCN | 0.6020
±0.0530 | This paper |
| 178 | NLGAT | 0.5690
±0.0730 | This paper |
LINKX Benchmarks
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | FaberNet | 0.7510
±0.0003 | |
| 2 | LargeScaleNet | 0.7505
±0.0005 | |
| 3 | DirGNN | 0.7395
±0.0005 | |
| 16 | GCN | 0.5102
±0.0006 best reported | best today: Scale-aware Message Passing For Graph Node Classification (2024) |
| 17 | NLGCN | 0.5080
±0.0040 | This paper |
| 20 | NLGAT | 0.4830
±0.0020 | This paper |
| 23 | GAT | 0.4540
±0.0040 | This paper |
| 32 | MLP | 0.3150 best reported | best today: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
