Papers › Spatio-Spectral Graph Neural Networks

Spatio-Spectral Graph Neural Networks

29 May 2024arXiv:2405.19121archive 2025-07-28

Simon Geisler, Arthur Kosmala, Daniel Herbst, Stephan Günnemann

Spatial Message Passing Graph Neural Networks (MPGNNs) are widely used for learning on graph-structured data. However, key limitations of l-step MPGNNs are that their "receptive field" is typically limited to the l-hop neighborhood of a node and that information exchange between distant nodes is limited by over-squashing. Motivated by these limitations, we propose Spatio-Spectral Graph Neural Networks (S²GNNs) -- a new modeling paradigm for Graph Neural Networks (GNNs) that synergistically combines spatially and spectrally parametrized graph filters. Parameterizing filters partially in the frequency domain enables global yet efficient information propagation. We show that S²GNNs vanquish over-squashing and yield strictly tighter approximation-theoretic error bounds than MPGNNs. Further, rethinking graph convolutions at a fundamental level unlocks new design spaces. For example, S²GNNs allow for free positional encodings that make them strictly more expressive than the 1-Weisfeiler-Lehman (WL) test. Moreover, to obtain general-purpose S²GNNs, we propose spectrally parametrized filters for directed graphs. S²GNNs outperform spatial MPGNNs, graph transformers, and graph rewirings, e.g., on the peptide long-range benchmark tasks, and are competitive with state-of-the-art sequence modeling. On a 40 GB GPU, S²GNNs scale to millions of nodes.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2405.19121")

Code

Syntology Ran 7 of 9 code samples harvested from 1 repository linked to this paper; 2 have no recorded run. Of those that ran: 1 ran · honoured contract; 6 ran with no contract checked.

By repository: official repository: 9 samples from 1 repository, 7 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

sigeisler/s2gnn officialpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

9 samples harvested; 7 ran; 1 honoured the contract we drafted; 2 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
6ran
2unverified

Licence: 0 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from sigeisler/s2gnn. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

cheby sigeisler/s2gnn/graphgps/layer/chebnet_conv_layer.py official repository ran · honoured contract MIT (permissive) · d7653b0093307e2d · report
get_ckpt_epoch sigeisler/s2gnn/graphgps/checkpoint.py official repository ran fingerprinted MIT (permissive) · 9bc9644080fc8b8c · report
get_ckpt_path sigeisler/s2gnn/graphgps/checkpoint.py official repository ran MIT (permissive) · 795006cd02f46c57 · report
get_final_pretrained_ckpt sigeisler/s2gnn/graphgps/finetuning.py official repository ran MIT (permissive) · 1bb331bf70a78136 · report
load_ckpt sigeisler/s2gnn/graphgps/checkpoint.py official repository ran MIT (permissive) · 85a688d6f0fbec00 · report
load_pretrained_model_cfg sigeisler/s2gnn/graphgps/finetuning.py official repository ran MIT (permissive) · 883f697aaaa033b8 · report
new_optimizer_config sigeisler/s2gnn/main_tpugraphs.py official repository ran MIT (permissive) · 398db63189d345b3 · report
apply_chunking_to_forward sigeisler/s2gnn/graphgps/layer/bigbird_layer.py official repository unverified MIT (permissive) · ae56bcfaae96da3c · report
init_model_from_pretrained sigeisler/s2gnn/graphgps/finetuning.py official repository unverified MIT (permissive) · 897f9d9194e1b336 · report

Tasks

Graph ClassificationGraph Neural NetworkGraph RegressionLong-range modelingNode Classification

1 archive task tag without a task page not shown.

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Graph Classification Peptides-func S²GCN AP 0.7311±0.0066 #5 of 44 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections