Position: Spectral GNNs Are Neither Spectral Nor Superior for Node Classification

2026-03-19

AI Summary

This study critically examines whether spectral graph neural networks (spectral GNNs) genuinely leverage spectral properties of graphs to achieve performance gains in node classification tasks. Through theoretical analysis grounded in graph signal processing, examination of Vandermonde systems, and demonstration of equivalence with message-passing neural networks (MPNNs), the work reveals that existing spectral GNNs—such as MagNet and HoloNet—fail to correctly implement the graph Fourier transform. Their reported performance advantages are instead attributable to implicit MPNN-like architectures or implementation artifacts. Rigorous reimplementation and ablation studies confirm that when spectral GNNs strictly adhere to spectral theory, their performance deteriorates significantly, thereby challenging the theoretical foundation underpinning their use in node classification.

Technology Category

• Machine Learning: Graph-based Machine Learning
• Data Mining & Knowledge Management: Graph Mining, Social Network Analysis & Community
• Cognitive Modeling & Cognitive Systems: Neural Spike Coding

Application Category

• Graph Algorithms and Modeling for the Web: Graph neural networks and deep learning approaches for Web-related graphs
• Social Networks and Social Media: Influence propagation, information diffusion, and the prediction on networks
• Web Mining and Content Analysis: Robustness and generalizability of Web mining methods

Abstract

Spectral Graph Neural Networks (Spectral GNNs) for node classification promise frequency-domain filtering on graphs, yet rest on flawed foundations. Recent work shows that graph Laplacian eigenvectors do not in general have the key properties of a true Fourier basis, but leaves the empirical success of Spectral GNNs unexplained. We identify two theoretical glitches: (1) commonly used "graph Fourier bases" are not classical Fourier bases for graph signals; (2) (n-1)-degree polynomials (n = number of nodes) can exactly interpolate any spectral response via a Vandermonde system, so the usual "polynomial approximation" narrative is not theoretically justified. The effectiveness of GCN is commonly attributed to spectral low-pass filtering, yet we prove that low- and high-pass behaviors arise solely from message-passing dynamics rather than Graph Fourier Transform-based spectral formulations. We then analyze two representative directed spectral models, MagNet and HoloNet. Their reported effectiveness is not spectral: it arises from implementation issues that reduce them to powerful MPNNs. When implemented consistently with the claimed spectral algorithms, performance becomes weak. This position paper argues that: for node classification, Spectral GNNs neither meaningfully capture the graph spectrum nor reliably improve performance; competitive results are better explained by their equivalence to MPNNs, sometimes aided by implementations inconsistent with their intended design.

Problem

• Spectral GNNs
• node classification
• graph Fourier basis
• spectral filtering
• MPNNs

Innovation

• Spectral GNNs
• Graph Fourier Transform
• Message Passing Neural Networks
• Polynomial Approximation
• Node Classification