SHAKE-GNN: Scalable Hierarchical Kirchhoff-Forest Graph Neural Network

Zhipu Cui, J. Lutzeyer

Main figure for SHAKE-GNN: Scalable Hierarchical Kirchhoff-Forest Graph Neural Network

Abstract

Graph Neural Networks (GNNs) have achieved remarkable success across a range of learning tasks. However, scaling GNNs to large graphs remains a significant challenge, especially for graph-level tasks. In this work, we introduce SHAKE-GNN, a novel scalable graph-level GNN framework based on a hierarchy of Kirchhoff Forests, a class of random spanning forests used to construct stochastic multi-resolution decompositions of graphs. SHAKE-GNN produces multi-scale representations, enabling flexible trade-offs between efficiency and performance. We introduce an improved, data-driven strategy for selecting the trade-off parameter and analyse the time-complexity of SHAKE-GNN. Experimental results on multiple large-scale graph classification benchmarks demonstrate that SHAKE-GNN achieves competitive performance while offering improved scalability.

Benchmark Results

Tested on 2 datasets

Tables show presented results in global context (best 3 papers + GCN + MLP).

TU Dortmund

#ModelAccuracy ↑Paper
1
WL-MLP
0.9792
2
MSH-GNN
0.9640 ±0.0070
3
CoCN
0.8722 ±0.0013
23
GCN
0.8260 ±0.0220
151
MLP
0.7920 ±0.0240
250
Original
0.7520
This paper
#ModelAccuracy ↑Paper
1
SpeGCL
0.5944 ±0.0018
2
GIN
0.5760 ±0.0150
3
LAMP-Soft
0.5738 ±0.0041
21
Original
0.4920
This paper
22
Coarsened
0.4810
This paper
26
GraphSAGE
0.4380 ±0.0320
SOTA performance (not significantly different from the best) Baseline / comparison (this paper) Global context (other papers)