Adaptive Universal Generalized PageRank Graph Neural NetworkDownload PDF

Published: 12 Jan 2021, Last Modified: 05 May 2023ICLR 2021 PosterReaders: Everyone
Keywords: Graph Neural Networks, Generalized PageRank, Heterophily, Homophily, Over-smoothing
Abstract: In many important graph data processing applications the acquired information includes both node features and observations of the graph topology. Graph neural networks (GNNs) are designed to exploit both sources of evidence but they do not optimally trade-off their utility and integrate them in a manner that is also universal. Here, universality refers to independence on homophily or heterophily graph assumptions. We address these issues by introducing a new Generalized PageRank (GPR) GNN architecture that adaptively learns the GPR weights so as to jointly optimize node feature and topological information extraction, regardless of the extent to which the node labels are homophilic or heterophilic. Learned GPR weights automatically adjust to the node label pattern, irrelevant on the type of initialization, and thereby guarantee excellent learning performance for label patterns that are usually hard to handle. Furthermore, they allow one to avoid feature over-smoothing, a process which renders feature information nondiscriminative, without requiring the network to be shallow. Our accompanying theoretical analysis of the GPR-GNN method is facilitated by novel synthetic benchmark datasets generated by the so-called contextual stochastic block model. We also compare the performance of our GNN architecture with that of several state-of-the-art GNNs on the problem of node-classification, using well-known benchmark homophilic and heterophilic datasets. The results demonstrate that GPR-GNN offers significant performance improvement compared to existing techniques on both synthetic and benchmark data.
One-sentence Summary: We combine generalized PageRank with GNNs to adapt universal node label patterns and the over-smoothing problem.
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
Supplementary Material: zip
Code: [![github](/images/github_icon.svg) jianhao2016/GPRGNN](
Data: [Chameleon (48%/32%/20% fixed splits)](, [Chameleon(60%/20%/20% random splits)](, [Citeseer (48%/32%/20% fixed splits)](, [Cora (48%/32%/20% fixed splits)](, [Cornell](, [Cornell (48%/32%/20% fixed splits)](, [Cornell (60%/20%/20% random splits)](, [Deezer-Europe](, [Film (60%/20%/20% random splits)](, [Penn94](, [PubMed (48%/32%/20% fixed splits)](, [PubMed (60%/20%/20% random splits)](, [Pubmed](, [Squirrel (48%/32%/20% fixed splits)](, [Squirrel (60%/20%/20% random splits)](, [Texas (48%/32%/20% fixed splits)](, [Texas(60%/20%/20% random splits)](, [WebKB](, [Wiki Squirrel](, [Wisconsin (48%/32%/20% fixed splits)](, [Wisconsin(60%/20%/20% random splits)](, [genius](, [twitch-gamers](
12 Replies