REVIEW 6 cited by
A Survey on Spectral Graph Neural Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Graph neural networks (GNNs) have attracted considerable attention from the research community. It is well established that GNNs are usually roughly divided into spatial and spectral methods. Despite that spectral GNNs play an important role in both graph signal processing and graph representation learning, existing studies are biased toward spatial approaches, and there is no comprehensive review on spectral GNNs so far. In this paper, we summarize the recent development of spectral GNNs, including model, theory, and application. Specifically, we first discuss the connection between spatial GNNs and spectral GNNs, which shows that spectral GNNs can capture global information and have better expressiveness and interpretability. Next, we categorize existing spectral GNNs according to the spectrum information they use, \ie, eigenvalues or eigenvectors. In addition, we review major theoretical results and applications of spectral GNNs, followed by a quantitative experiment to benchmark some popular spectral GNNs. Finally, we conclude the paper with some future directions.
Forward citations
Cited by 6 Pith papers
-
Frequency-Corrupt Based Graph Self-Supervised Learning
FC-GSSL is a graph self-supervised method that corrupts nodes/edges with high low-frequency contribution and reconstructs low-frequency/general targets, improving node and graph prediction on most tested benchmarks.
-
Graph Positional Autoencoders as Self-supervised Learners
A dual-path graph autoencoder that reconstructs node features and Laplacian-eigenvector distances reports strong self-supervised results on heterophilic and molecular benchmarks, with some overstatement in the margins...
-
Efficient Identity and Position Graph Embedding via Spectral-Based Random Feature Aggregation
Random feature aggregation (RFA) derives identity and position graph embeddings from random noise via one parameter-free spectral propagation, matching or beating trained baselines at much lower cost.
-
Rethinking Link Prediction for Directed Graphs
A new benchmark and a spectral bipartite-graph auto-encoder (SDGAE) improve and re-evaluate directed link prediction, while the paper's expressiveness proof for single-embedding methods is incomplete.
-
Learnable quantum spectral filters for hybrid graph neural networks
A parameterized quantum Fourier circuit with graph-derived gate connections acts as a convolution plus pooling layer in a hybrid quantum-classical graph neural network, achieving benchmark accuracies comparable to som...
-
Spectral Manifold Harmonization for Graph Imbalanced Regression
Spectral Manifold Harmonization generates synthetic molecular graphs by sampling graph spectra to target rare property values, but reported benefits are inconsistent and the reconstruction step is underspecified.
Discussion (0). Continue with ORCID to comment.