425

Benchmarking Spectral Graph Neural Networks: A Comprehensive Study on Effectiveness and Efficiency

Main:17 Pages
28 Figures
Bibliography:5 Pages
12 Tables
Appendix:6 Pages
Abstract

With recent advancements in graph neural networks (GNNs), spectral GNNs have received increasing popularity by virtue of their ability to retrieve graph signals in the spectral domain. These models feature uniqueness in efficient computation as well as rich expressiveness, which stems from advanced management and profound understanding of graph data. However, few systematic studies have been conducted to assess spectral GNNs, particularly in benchmarking their efficiency, memory consumption, and effectiveness in a unified and fair manner. There is also a pressing need to select spectral models suitable for learning specific graph data and deploying them to massive web-scale graphs, which is currently constrained by the varied model designs and training settings.

View on arXiv
Comments on this paper