Daily Arxiv

This is a page that curates AI-related papers published worldwide.
All content here is summarized using Google Gemini and operated on a non-profit basis.
Copyright for each paper belongs to the authors and their institutions; please make sure to credit the source when sharing.

A Comprehensive Benchmark on Spectral GNNs: The Impact on Efficiency, Memory, and Effectiveness

Created by
  • Haebom

Author

Ningyi Liao, Haoyu Liu, Zulun Zhu, Siqiang Luo, Laks VS Lakshmanan

Outline

This paper presents a comprehensive and unbiased benchmarking of the efficiency, memory consumption, and effectiveness of spectral-based graph neural networks (spectral GNNs). This approach addresses the challenges of selecting appropriate spectral models for specific graph data and deploying them on large-scale web-scale graphs, which have arisen due to the diverse model designs and learning settings of previous studies. In this paper, we analyze and categorize 35 GNNs and 27 filters as spectral graph filters and implement them within a unified, spectral-centric framework, enabling deployment of spectral GNNs on million-scale graphs and diverse tasks. Through evaluations across various graph scales, we provide new observations and practical guidance on their effectiveness and efficiency. We also illuminate the complexities of spectral graph filter effectiveness and efficiency, and suggest potential performance enhancements through tailored spectral manipulation.

Takeaways, Limitations

Takeaways:
Provides comprehensive and fair benchmarking results on the efficiency, memory consumption, and effectiveness of Spectral GNN.
Demonstrating the Deployability of Spectral GNNs on Million-Scale Graphs and Various Tasks
Suggesting the possibility of performance improvement through customized manipulation of spectral graph data.
Provides new observations and practical guidance on the effectiveness and efficiency of spectral GNNs.
Limitations:
Restrictions on the types and scope of GNNs included in the benchmark (35 GNNs, 27 filters)
Further research is needed on generalizability to specific graph data types and tasks.
Further verification of the scalability and applicability of the proposed framework is needed.
👍