Graph-Coupled Oscillator Networks
Abstract
We propose Graph-Coupled Oscillator Networks (GraphCON), a novel framework for deep learning on graphs. It is based on discretizations of a second-order system of ordinary differential equations (ODEs), which model a network of nonlinear controlled and damped oscillators, coupled via the adjacency structure of the underlying graph. The flexibility of our framework permits any basic GNN layer (e.g. convolutional or attentional) as the coupling function, from which a multi-layer deep neural network is built up via the dynamics of the proposed ODEs. We relate the oversmoothing problem, commonly encountered in GNNs, to the stability of steady states of the underlying ODE and show that zero-Dirichlet energy steady states are not stable for our proposed ODEs. This demonstrates that the proposed framework mitigates the oversmoothing problem. Moreover, we prove that GraphCON mitigates the exploding and vanishing gradients problem to facilitate training of deep multi-layer GNNs. Finally, we show that our approach offers competitive performance with respect to the state-of-the-art on a variety of graph-based learning tasks.
Benchmark Results
Tested on 7 datasets 15 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 best reported | best at pub: SplineCNN: Fast Geometric Deep Learning with Continuous B-Spline Kernels (2017) best today: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 39 | SAGE | 0.8911
±0.0012 | |
| 44 | GAT | 0.8897
±0.0014 best reported | best at pub: Learned Low Precision Graph Neural Networks (2020) |
| 87 | GRAND | 0.8815 best reported | best today: Feature Transportation Improves Graph Neural Networks (AAAI 2023) |
| 224 | GraphSAGE-mean | 0.8504
±0.0012 best reported | best today: Node Representation Learning in Graph via Node-to-Neighbourhood Mutual Information Maximization (2022) Difference within reported uncertainty; not counted as underperformance. |
| 283 | CGNN | 0.8420
±0.0100 best reported | best at pub: Continuous Graph Neural Networks (ICML 2019) |
| 284 | GraphCON-Tran | 0.8420
±0.0130 | This paper |
| 317 | GDE | 0.8380
±0.0050 best reported | best at pub: GRAND: Graph Neural Diffusion (ICML 2021) best today: Framelet Message Passing (2023) |
| 402 | GraphCON-GAT | 0.8320
±0.0140 | This paper |
| 508 | MoNet | 0.8220
±0.0070 best reported | best at pub: GRAND: Graph Neural Diffusion (ICML 2021) Difference within reported uncertainty; not counted as underperformance. |
| 537 | GraphCON-GCN | 0.8190
±0.0170 | This paper |
| 571 | GAT-ppr | 0.8160
±0.0030 | This paper |
| 724 | MLP | 0.7768 | |
| 747 | GraphSAGE-maxpool | 0.7660
±0.0190 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | CNA | 0.9575
±0.0058 | |
| 2 | IS-GIB | 0.9390
±0.0187 | |
| 3 | EERM | 0.9112
±0.0145 | |
| 35 | GAT | 0.8080
±0.0026 best reported | best at pub: Gophormer: Ego-Graph Transformer for Node Classification (2021) best today: Feature Expansion for Graph Neural Networks (ICML 2023) |
| 44 | GCN | 0.8033
±0.0088 best reported | best at pub: Gophormer: Ego-Graph Transformer for Node Classification (2021) |
| 61 | GraphSAGE | 0.7923
±0.0053 | |
| 93 | GraphSAGE-mean | 0.7782
±0.0015 best reported | |
| 122 | GRAND | 0.7657 best reported | best today: Feature Transportation Improves Graph Neural Networks (AAAI 2023) |
| 219 | GraphCON-Tran | 0.7420
±0.0170 | This paper |
| 305 | GraphCON-GAT | 0.7320
±0.0180 | This paper |
| 345 | GraphCON-GCN | 0.7290
±0.0210 | This paper |
| 350 | MLP | 0.7289
±0.0010 | |
| 391 | GDE | 0.7250
±0.0050 best reported | best at pub: GRAND: Graph Neural Diffusion (ICML 2021) best today: Framelet Message Passing (2023) Difference within reported uncertainty; not counted as underperformance. |
| 540 | MoNet | 0.7120
±0.0200 | This paper |
| 590 | CGNN | 0.7050
±0.0123 best reported | best at pub: GRAND: Graph Neural Diffusion (ICML 2021) best today: Gauge-Equivariant Graph Networks via Self-Interference Cancellation (2025) |
| 671 | GAT-ppr | 0.6850
±0.0020 | This paper |
| 702 | GraphSAGE-maxpool | 0.6750
±0.0230 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | LGTL | 0.9518
±0.0011 | |
| 2 | MixHop (LO) | 0.9513
±0.0038 | |
| 3 | GraphSAGE (LO) | 0.9511
±0.0036 | |
| 18 | GCN | 0.9296
±0.0015 best reported | best at pub: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) |
| 20 | GAT | 0.9233
±0.0018 best reported | best at pub: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) |
| 109 | GRAND | 0.8902 best reported | best today: Feature Transportation Improves Graph Neural Networks (AAAI 2023) |
| 116 | SAGE | 0.8881
±0.0015 | |
| 200 | GraphSAGE-mean | 0.8715
±0.0014 best reported | |
| 210 | MLP | 0.8690
±0.0074 | |
| 430 | CGNN | 0.8020
±0.0030 best reported | best at pub: GRAND: Graph Neural Diffusion (ICML 2021) best today: Framelet Message Passing (2023) |
| 446 | MoNet | 0.8006
±0.0055 best reported | best at pub: Learning Conjoint Attentions for Graph Neural Nets (NeurIPS 2021) best today: Not All Neighbors Are Worth Attending to: Graph Selective Attention Networks for Semi-supervised Learning (2022) Difference within reported uncertainty; not counted as underperformance. |
| 459 | GDE | 0.7990
±0.0030 best reported | best at pub: GRAND: Graph Neural Diffusion (ICML 2021) best today: Beltrami Flow and Neural Diffusion on Graphs (NeurIPS 2021) |
| 511 | GraphCON-GAT | 0.7950
±0.0180 | This paper |
| 532 | GraphCON-Tran | 0.7940
±0.0130 | This paper |
| 620 | GraphCON-GCN | 0.7880
±0.0260 | This paper |
| 751 | GAT-ppr | 0.7670
±0.0030 | This paper |
| 766 | GraphSAGE-maxpool | 0.7610
±0.0230 | This paper |
| # | Model | F1 ↑ | Paper |
|---|---|---|---|
| 1 | GAMLP(JK) | 0.9982
±0.0001 | |
| 2 | GraphCON-GCN | 0.9960 | This paper |
| 3 | GCNII | 0.9950 | prev best: CogDL: A Comprehensive Library for Graph Deep Learning (WWW 2021) |
| 9 | Cluster-GCN | 0.9940 | prev best: A Comprehensive Survey on Graph Neural Networks (2019) |
| 10 | GraphCON-GAT | 0.9940 | This paper |
| 12 | PDE-GCN | 0.9920 | This paper |
| 22 | GeniePath | 0.9850 | This paper |
| 21 | GCN | 0.9850 | prev best: Graph Neural Networks With Convolutional ARMA Filters (2019) |
| 42 | VR-GCN | 0.9780 | This paper |
| 53 | JKNet | 0.9760 | This paper |
| 57 | GAT | 0.9732
±0.0032 best reported | best at pub: GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphs (2018) 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. |
| 92 | GIN | 0.8724
±0.0002 | |
| 101 | GraphSAGE | 0.7860 best reported | best at pub: Graph Neural Networks With Convolutional ARMA Filters (2019) best today: Optimization-Induced Graph Implicit Nonlinear Diffusion (ICML 2022) |
| 173 | MLP | 0.4620 |
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.7840
±0.0440 | prev best: Label-Wise Graph Convolutional Network for Heterophilic Graphs (2021) best today: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) Improvement within reported uncertainty; not highlighted. |
| 34 | MLP | 0.9230
±0.0070 best reported | best at pub: Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited (NeurIPS 2022) |
| 40 | H2GCN | 0.8490
±0.0720 | prev best: Graph Neural Networks Inspired by Classical Iterative Algorithms (ICML 2021) Improvement within reported uncertainty; not highlighted. |
| 53 | GraphSAGE | 0.9000
±0.0365 best reported | best at pub: Graph Neural Networks Inspired by Classical Iterative Algorithms (ICML 2021) best today: Graph Neural Networks Need Cluster-Normalize-Activate Modules (NeurIPS 2024) Difference within reported uncertainty; not counted as underperformance. |
| 70 | GCNII | 0.8918
±0.0443 best reported | best at pub: Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited (NeurIPS 2022) best today: Piecewise Constant Spectral Graph Neural Network (TMLR 2025) |
| 138 | GraphCON-GCN | 0.8540
±0.0420 | This paper |
| 189 | SAGE | 0.8269 | |
| 202 | GraphCON-GAT | 0.8220
±0.0470 | This paper |
| 211 | GAT | 0.8162
±0.0645 best reported | best at pub: Graph Pointer Neural Networks (AAAI 2021) 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: Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited (NeurIPS 2022) best today: Graph Wave Networks (WWW 2025) |
| 415 | Geom-GCN | 0.6760 best reported | best at pub: Non-Local Graph Neural Networks (2020) Difference within reported uncertainty; not counted as underperformance. |
| 499 | PairNorm | 0.6030
±0.0430 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9541
±0.0272 | |
| 2 | ACM-GCN | 0.9480
±0.0380 | |
| 3 | RF-GCN | 0.9429 | |
| 22 | GPRGNN | 0.9157
±0.0196 best reported | best at pub: Simplifying approach to Node Classification in Graph Neural Networks (2021) best today: Simplified PCNet with Robustness (2024) Difference within reported uncertainty; not counted as underperformance. |
| 24 | MLP | 0.9136
±0.0070 best reported | best at pub: Is Homophily a Necessity for Graph Neural Networks? (ICLR 2021) best today: Node-oriented Spectral Filtering for Graph Neural Networks (2022) Difference within reported uncertainty; not counted as underperformance. |
| 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) |
| 68 | H2GCN | 0.8270
±0.0530 | prev best: Graph Neural Networks Inspired by Classical Iterative Algorithms (ICML 2021) Improvement within reported uncertainty; not highlighted. |
| 108 | GraphCON-GCN | 0.8430
±0.0480 | This paper |
| 130 | GraphCON-GAT | 0.8320
±0.0700 | This paper |
| 138 | SAGE | 0.8269 | |
| 157 | GraphSAGE | 0.7600
±0.0500 | prev best: Graph Neural Networks Inspired by Classical Iterative Algorithms (ICML 2021) Improvement within reported uncertainty; not highlighted. |
| 158 | GAT | 0.6190
±0.0510 | best today: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) Improvement within reported uncertainty; not highlighted. |
| 170 | GCN | 0.8082
±0.0360 best reported | best at pub: Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited (NeurIPS 2022) best today: Bayesian Neighborhood Adaptation for Graph Neural Networks (TMLR 2025) |
| 342 | Geom-GCN | 0.6412 best reported | best at pub: Graph Neural Networks Inspired by Classical Iterative Algorithms (ICML 2021) best today: Steering Graph Neural Networks with Pinning Control (2023) Difference within reported uncertainty; not counted as underperformance. |
| 389 | PairNorm | 0.5892
±0.0315 best reported | best today: Graph Navier–Stokes Networks (2026) Difference within reported uncertainty; not counted as underperformance. |
GNNBenchmark
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | Schrödinger | 0.9913
±0.0004 | |
| 2 | CNN | 0.9907
±0.0007 | |
| 3 | MPNN | 0.9895
±0.0006 | |
| 4 | GraphCON-GAT | 0.9891 | This paper |
| 6 | PNCNN | 0.9876 | This paper |
| 8 | GraphCON-GCN | 0.9868 | This paper |
| 11 | GatedGCN | 0.9855
±0.0002 best reported | best at pub: Formatting Instructions for ICLR 2021 Conference Submissions (2020) |
| 14 | GraphCON-GIN | 0.9853 | This paper |
| 32 | GIN | 0.9723 | prev best: SoGCN: Second-Order Graph Convolutional Networks (2021) |
| 34 | GraphCON-GatedGCN | 0.9827 | This paper |
| 86 | GAT | 0.9755
±0.0003 best reported | best at pub: Formatting Instructions for ICLR 2021 Conference Submissions (2020) |
| 95 | GraphSAGE | 0.9731
±0.0010 | |
| 126 | MLP | 0.9534
±0.0014 | |
| 127 | SplineCNN | 0.9522 | This paper |
| 135 | GCN | 0.9405
±0.0005 best reported | best at pub: Formatting Instructions for ICLR 2021 Conference Submissions (2020) |
| 137 | MoNet | 0.9111 | prev best: SoGCN: Second-Order Graph Convolutional Networks (2021) |
| 151 | ChebNet | 0.7562 | This paper |
