Global-Local Graph Neural Networks for Node-Classification
Abstract
The task of graph node classification is often approached blackby utilizing a local Graph Neural Network (GNN), that learns only local information from the node input features and their adjacency. In this paper, we propose to black improve the performance of node classification GNNs by utilizing both global and local information, specifically by learning label- and node- features. We therefore call our method Global-Local-GNN (GLGNN). To learn proper label features, for each label, we maximize the similarity between its features and nodes features that belong to the label, while maximizing the distance between nodes that do not belong to the considered label. We then use the learnt label features to predict the node classification map. We demonstrate our GLGNN using three different GNN backbones, and show that our approach improves baseline performance, revealing the importance of global information utilization blackfor node classification.
Benchmark Results
Tested on 5 datasets 28 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
TU Dortmund
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | MSH-GNN | 0.9910
±0.0030 | |
| 2 | ID-GNN+BEC | 0.9830
±0.0360 | |
| 3 | SupCosine | 0.9830
±0.0250 | |
| 39 | GIN | 0.9330
±0.0290 best reported | best at pub: ProtGNN: Towards Self-Explaining Graph Neural Networks (AAAI 2021) Difference within reported uncertainty; not counted as underperformance. |
| 63 | GCN | 0.9220
±0.0440 best reported | best at pub: Breaking the Limits of Message Passing Graph Neural Networks (ICML 2021) best today: Depth-Adaptive Graph Neural Networks via Learnable Bakry-Émery Curvature (KDD 2025) Difference within reported uncertainty; not counted as underperformance. |
| 131 | GLGIN | 0.9080
±0.0610 | This paper |
| 158 | GraphSAGE | 0.9040
±0.0780 | |
| 319 | GLGCN | 0.8830
±0.0510 | This paper |
| 403 | MLP | 0.8660
±0.0495 |
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 | |
| 28 | GPRGNN | 0.9295
±0.0131 best reported | best at pub: Node-oriented Spectral Filtering for Graph Neural Networks (2022) best today: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 34 | MLP | 0.9230
±0.0070 | |
| 39 | GGCN | 0.8686 | prev best: Understanding convolution on graphs via energies (TMLR 2022) best today: Graph Wave Networks (WWW 2025) Improvement within reported uncertainty; not highlighted. |
| 40 | H2GCN | 0.8765 | |
| 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 | |
| 61 | FAGCN | 0.8961
±0.0152 best reported | best at pub: Node-oriented Spectral Filtering for Graph Neural Networks (2022) |
| 70 | GCNII* | 0.8157 | prev best: Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited (NeurIPS 2022) best today: Piecewise Constant Spectral Graph Neural Network (TMLR 2025) Improvement within reported uncertainty; not highlighted. |
| 81 | GLGCNII | 0.8862 | This paper |
| 104 | WRGAT | 0.8698 | prev best: From Node Interaction to Hop Interaction: New Effective and Scalable Graph Learning Paradigm (2022) Improvement within reported uncertainty; not highlighted. |
| 211 | GAT | 0.8162
±0.0645 best reported | best at pub: A Quasi-Wasserstein Loss for Learning Graph Neural Networks (WWW 2023) best today: Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models (2025) |
| 217 | GRAND | 0.8140
±0.0350 best reported | best at pub: Unifying over-smoothing and over-squashing in graph neural networks: A physics informed approach and beyond (2023) best today: When Graph Neural Networks Meet Dynamic Mode Decomposition (ICLR 2024) Difference within reported uncertainty; not counted as underperformance. |
| 257 | GCN | 0.7933
±0.0447 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) best today: Graph Wave Networks (WWW 2025) |
| 259 | PowerEmbed | 0.7919 | This paper |
| 415 | Geom-GCN | 0.6760 best reported | best at pub: Non-Local Graph Neural Networks (2020) |
| 433 | GLGAT | 0.6588 | This paper |
| 440 | GLGCN | 0.6529 | This paper |
| 499 | PairNorm | 0.6030
±0.0430 best reported | best at pub: Graph-Coupled Oscillator Networks (ICML 2022) |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9541
±0.0272 | |
| 2 | ACM-GCN | 0.9480
±0.0380 | |
| 3 | RF-GCN | 0.9429 | |
| 15 | GGCN | 0.9230
±0.0367 best reported | best at pub: Understanding convolution on graphs via energies (TMLR 2022) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) |
| 21 | APPNP | 0.9181
±0.0196 best reported | best at pub: LON-GNN: Spectral GNNs with Learnable Orthonormal Basis (2023) |
| 22 | GPRGNN | 0.9157
±0.0196 best reported | best at pub: Simplified PCNet with Robustness (2024) |
| 24 | MLP | 0.9136
±0.0070 | |
| 32 | GLGCNII | 0.8919 | This paper |
| 35 | GCNII* | 0.8918
±0.0396 best reported | best at pub: Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited (NeurIPS 2022) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) |
| 38 | FAGCN | 0.8852
±0.0133 best reported | best at pub: Node-oriented Spectral Filtering for Graph Neural Networks (2022) |
| 68 | H2GCN | 0.8623
±0.0471 best reported | best at pub: Design your own universe: a physics-informed agnostic method for enhancing graph neural networks (2024) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) Difference within reported uncertainty; not counted as underperformance. |
| 138 | SAGE | 0.8269 | |
| 142 | GRAND | 0.8246
±0.0709 best reported | best at pub: Dirichlet Energy Enhancement of Graph Neural Networks by Framelet Augmentation (2023) best today: Graph Navier–Stokes Networks (2026) Difference within reported uncertainty; not counted as underperformance. |
| 158 | GAT | 0.8190
±0.0540 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 160 | WRGAT | 0.8162 | This paper |
| 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) |
| 195 | PowerEmbed | 0.7830 | This paper |
| 224 | GLGAT | 0.7567 | This paper |
| 234 | GLGCN | 0.7486 | This paper |
| 342 | Geom-GCN | 0.6412 best reported | best at pub: Steering Graph Neural Networks with Pinning Control (2023) |
| 389 | PairNorm | 0.5892 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | DiGGR | 0.4535
±0.0353 | |
| 2 | TRIGON | 0.4402
±0.0028 | |
| 3 | DoG | 0.4320
±0.0120 | |
| 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) |
| 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 | |
| 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) |
| 56 | FAGCN | 0.3970 best reported | best at pub: Beyond Low-frequency Information in Graph Convolutional Networks (AAAI 2021) |
| 62 | GGCN | 0.3929
±0.0048 best reported | best at pub: Feature Transportation Improves Graph Neural Networks (AAAI 2023) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) |
| 68 | GraphSAGE | 0.3899
±0.0085 | |
| 71 | H2GCN | 0.3885
±0.0117 best reported | best at pub: ES-GNN: Generalizing Graph Neural Networks Beyond Homophily with Edge Splitting (2022) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) |
| 75 | WRGAT | 0.3860
±0.0110 best reported | best at pub: ES-GNN: Generalizing Graph Neural Networks Beyond Homophily with Edge Splitting (2022) |
| 87 | Geom-GCN | 0.3810 best reported | best at pub: Beyond Low-frequency Information in Graph Convolutional Networks (AAAI 2021) |
| 135 | GCN | 0.3690 best reported | best at pub: Beyond Low-frequency Information in Graph Convolutional Networks (AAAI 2021) |
| 182 | GAT | 0.3605
±0.0035 best reported | best at pub: Hierarchical Graph Transformer with Adaptive Node Sampling (NeurIPS 2022) |
| 203 | GRAND | 0.3562 | This paper |
| 263 | GLGCNII | 0.3413 | This paper |
| 296 | GLGCN | 0.3245 | This paper |
| 305 | GLGAT | 0.3184 | This paper |
| 408 | PairNorm | 0.2740 | 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 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) best today: When Graph Neural Networks Meet Dynamic Mode Decomposition (ICLR 2024) |
| 5 | GPRGNN | 0.8990
±0.0300 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) best today: When Graph Neural Networks Meet Dynamic Mode Decomposition (ICLR 2024) |
| 6 | GLGCNII | 0.8972 | This paper |
| 13 | GRAND | 0.8860
±0.0210 best reported | best at pub: Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND (ICLR 2024) best today: When Graph Neural Networks Meet Dynamic Mode Decomposition (ICLR 2024) |
| 22 | H2GCN | 0.8790
±0.0420 best reported | best at pub: Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND (ICLR 2024) best today: When Graph Neural Networks Meet Dynamic Mode Decomposition (ICLR 2024) Difference within reported uncertainty; not counted as underperformance. |
| 29 | WRGAT | 0.8698
±0.0378 best reported | best at pub: From Node Interaction to Hop Interaction: New Effective and Scalable Graph Learning Paradigm (2022) best today: Graph Navier–Stokes Networks (2026) Difference within reported uncertainty; not counted as underperformance. |
| 32 | GGCN | 0.8686
±0.0320 best reported | best at pub: From Node Interaction to Hop Interaction: New Effective and Scalable Graph Learning Paradigm (2022) best today: Sign is Not a Remedy: Multiset-to-Multiset Message Passing for Learning on Heterophilic Graphs (ICML 2024) Difference within reported uncertainty; not counted as underperformance. |
| 37 | MLP | 0.8629
±0.0450 | |
| 53 | GAT | 0.8430
±0.0370 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 60 | FAGCN | 0.8333 best reported | best at pub: Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating (AAAI 2022) |
| 63 | GCN | 0.8310
±0.0320 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 69 | GraphSAGE | 0.8118
±0.0556 | |
| 75 | GCNII* | 0.8039
±0.0340 best reported | best at pub: From Node Interaction to Hop Interaction: New Effective and Scalable Graph Learning Paradigm (2022) best today: Graph Navier–Stokes Networks (2026) Difference within reported uncertainty; not counted as underperformance. |
| 89 | PowerEmbed | 0.7843 | This paper |
| 127 | GLGCN | 0.7027 | This paper |
| 128 | GLGAT | 0.7001 | This paper |
| 139 | Geom-GCN | 0.6757 | prev best: Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND (ICLR 2024) Improvement within reported uncertainty; not highlighted. |
| 169 | PairNorm | 0.6027 |
