REVIEW 2 cited by
Bridging the Gap Between Spectral and Spatial Domains in 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
This paper aims at revisiting Graph Convolutional Neural Networks by bridging the gap between spectral and spatial design of graph convolutions. We theoretically demonstrate some equivalence of the graph convolution process regardless it is designed in the spatial or the spectral domain. The obtained general framework allows to lead a spectral analysis of the most popular ConvGNNs, explaining their performance and showing their limits. Moreover, the proposed framework is used to design new convolutions in spectral domain with a custom frequency profile while applying them in the spatial domain. We also propose a generalization of the depthwise separable convolution framework for graph convolutional networks, what allows to decrease the total number of trainable parameters by keeping the capacity of the model. To the best of our knowledge, such a framework has never been used in the GNNs literature. Our proposals are evaluated on both transductive and inductive graph learning problems. Obtained results show the relevance of the proposed method and provide one of the first experimental evidence of transferability of spectral filter coefficients from one graph to another. Our source codes are publicly available at: https://github.com/balcilar/Spectral-Designed-Graph-Convolutions
Forward citations
Cited by 2 Pith papers
-
Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning
An edge-filtration persistence diagram built on line graphs (TED/LGVR) is proven to retain node coloring information and beat the Weisfeiler-Lehman test in expressive power, with GNN variants showing benchmark gains.
-
Introduction to Graph Neural Networks for Machine Learning Engineers
A tutorial survey of graph neural networks using an encoder-decoder framework, accompanied by an experimental study of hyperparameters and graph homophily on node classification.
Discussion (0). Continue with ORCID to comment.