On the Expressive Power of Spectral Invariant Graph Neural Networks
Bohang Zhang, Lingxiao Zhao, Haggai Maron

TL;DR
This paper provides a theoretical analysis of spectral invariant Graph Neural Networks (GNNs), introducing a unified framework that clarifies their expressive power and limitations compared to other GNN classes.
Contribution
It introduces Eigenspace Projection GNN (EPNN), unifies existing spectral invariant architectures, and establishes their expressiveness hierarchy and limitations relative to the 3-WL test.
Findings
EPNN unifies all spectral invariant architectures.
Spectral invariant GNNs are less expressive than 3-WL.
A hierarchy of expressiveness among spectral architectures is established.
Abstract
Incorporating spectral information to enhance Graph Neural Networks (GNNs) has shown promising results but raises a fundamental challenge due to the inherent ambiguity of eigenvectors. Various architectures have been proposed to address this ambiguity, referred to as spectral invariant architectures. Notable examples include GNNs and Graph Transformers that use spectral distances, spectral projection matrices, or other invariant spectral features. However, the potential expressive power of these spectral invariant architectures remains largely unclear. The goal of this work is to gain a deep theoretical understanding of the expressive power obtainable when using spectral features. We first introduce a unified message-passing framework for designing spectral invariant GNNs, called Eigenspace Projection GNN (EPNN). A comprehensive analysis shows that EPNN essentially unifies all prior…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Advanced Graph Neural Networks
