Saved in:
Bibliographic Details
Main Authors: Cui, Zhipu, Lutzeyer, Johannes
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2509.22100
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915516332900352
author Cui, Zhipu
Lutzeyer, Johannes
author_facet Cui, Zhipu
Lutzeyer, Johannes
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2509_22100
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle SHAKE-GNN: Scalable Hierarchical Kirchhoff-Forest Graph Neural Network
Cui, Zhipu
Lutzeyer, Johannes
Machine Learning
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.
title SHAKE-GNN: Scalable Hierarchical Kirchhoff-Forest Graph Neural Network
topic Machine Learning
url https://arxiv.org/abs/2509.22100