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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Unlocking the Potential of Classic GNNs for Graph-level Tasks: Simple Architectures Meet Excellence
Next Level Message-Passing with Hierarchical Support Graphs
Learning Long Range Dependencies on Graphs via Random Walks
Weisfeiler and Lehman Go Paths: Learning Topological Features via Path Complexes
Improving the Effective Receptive Field of Message-Passing Neural Networks
Pre-training Graph Neural Networks on Molecules by Using Subgraph-Conditioned Graph Information Bottleneck
토론
이 논문과 연결된 포럼 글이 아직 없습니다.