TL;DR
This paper analyzes oversmoothing in graph neural networks using Gaussian process theory, revealing conditions under which GCNs avoid oversmoothing and remain deep and expressive.
Contribution
It introduces a new phase where GCNs do not oversmooth, based on initial weight variance, and extends the concept of propagation depth to GCNs.
Findings
Typical parameters lead to oversmoothing
Large initial weight variance prevents oversmoothing
Propagation depth diverges at the transition point
Abstract
Graph neural networks (GNNs) have emerged as powerful tools for processing relational data in applications. However, GNNs suffer from the problem of oversmoothing, the property that the features of all nodes exponentially converge to the same vector over layers, prohibiting the design of deep GNNs. In this work we study oversmoothing in graph convolutional networks (GCNs) by using their Gaussian process (GP) equivalence in the limit of infinitely many hidden features. By generalizing methods from conventional deep neural networks (DNNs), we can describe the distribution of features at the output layer of deep GCNs in terms of a GP: as expected, we find that typical parameter choices from the literature lead to oversmoothing. The theory, however, allows us to identify a new, non-oversmoothing phase: if the initial weights of the network have sufficiently large variance, GCNs do not…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
MethodsGraph Convolutional Network · Gaussian Process
