Rethinking the Polynomial Filter of GNNs via Graph Information Activation Theory
Primary Area: representation learning for computer vision, audio, language, and other modalities
Code Of Ethics: I acknowledge that I and all co-authors of this work have read and commit to adhering to the ICLR Code of Ethics.
Keywords: Graph Neural Networks, Polynomial Filter, Polynomial Basis
Submission Guidelines: I certify that this submission complies with the submission instructions as described on https://iclr.cc/Conferences/2024/AuthorGuide.
TL;DR: This paper focuses on analyzing the polynomial filter in GNNs theoretically and then propose a new GNN with a simpler basis.
Abstract: Recently, it has been a hot research topic to design different polynomial filters in graph neural networks (GNNs). Most of the existing GNNs only pay attention to the properties of polynomials when designing the polynomial filter, thus not only bringing additional computational costs but also ignoring embedding the graph structure information into the construction process of the basis. To address these issues, we theoretically prove that any polynomial basis with the same degree has the same expressive ability and the finely designed polynomial basis that only considers the polynomial property can at most bring linear benefit for GNNs. Then, we propose a graph information activation (GIA) theory that provides a new perspective for interpreting polynomial filters and then analyse some popular bases using the GIA theory. Based on the GIA theory and analysis, we design a simple basis by utilizing the graph structure information and further build a simple GNN (i.e., SimpleNet), which can be applied to both homogeneous and non-homogenous graphs. Experiments on real datasets demonstrate that our SimpleNet can achieve better or comparable performance with relatively less running time compared to other state-of-the-art GNNs.
Anonymous Url: I certify that there is no URL (e.g., github page) that could be used to find authors' identity.
No Acknowledgement Section: I certify that there is no acknowledgement section in this submission for double blind review.
Submission Number: 3051
Loading