A New Perspective on the Effects of Spectrum in Graph Neural Networks
Many improvements on GNNs can be deemed as operations on the spectrum of the underlying graph matrix, which motivates us to directly study the characteristics of the spectrum and their effects on GNN performance. By generalizing most existing GNN architectures, we show that the correlation issue caused by the $unsmooth$ spectrum becomes the obstacle to leveraging more powerful graph filters as well as developing deep architectures, which therefore restricts GNNs' performance. Inspired by this, we propose the correlation-free architecture which naturally removes the correlation issue among different channels, making it possible to utilize more sophisticated filters within each channel. The final correlation-free architecture with more powerful filters consistently boosts the performance of learning graph representations. Code is available at https://github.com/qslim/gnn-spectrum.
Code (1)
Tasks
Graph ClassificationGraph Property PredictionGraph RegressionSimilar Papers 제목 키워드 기반
Neural network spectral robustness under perturbations of the underlying graph
Recent studies have been using graph theoretical approaches to model complex networks (such as social, infrastructural or biological networks), and how their hardwired circuitry relates to their dynamic evolution in time…
A Theory of Random Graph Shift in Truncated-Spectrum vRKHS
This paper develops a theory of graph classification under domain shift through a random-graph generative lens, where we consider intra-class graphs sharing the same random graph model (RGM) and the domain shift induced …
Graph ClassificationDomain AdaptationGraph LearningTowards Intelligent Spectrum Management: Spectrum Demand Estimation Using Graph Neural Networks
The growing demand for wireless connectivity, combined with limited spectrum resources, calls for more efficient spectrum management. Spectrum sharing is a promising approach; however, regulators need accurate methods to…
A Gromov--Wasserstein Geometric View of Spectrum-Preserving Graph Coarsening
Graph coarsening is a technique for solving large-scale graph problems by working on a smaller version of the original graph, and possibly interpolating the results back to the original graph. It has a long history in sc…
Graph ClassificationregressionSeeing Things from a Different Angle: Discovering Diverse Perspectives about Claims
One key consequence of the information revolution is a significant increase and a contamination of our information supply. The practice of fact checking won't suffice to eliminate the biases in text data we observe, as t…
8kFact CheckingNatural Language Understanding