Understanding Heterophily for Graph Neural Networks
Junfu Wang, Yuanfang Guo, Liang Yang, Yunhong Wang

TL;DR
This paper provides a theoretical analysis of how heterophily patterns affect Graph Neural Networks, revealing key factors like neighborhood distribution distance and node degree that influence GNN performance.
Contribution
It introduces Heterophilous Stochastic Block Models to analyze heterophily effects and offers new insights into the impact of topology and multiple convolution operations on GNN separability.
Findings
Separable gains depend on neighborhood distribution distance and node degree.
Topological noise degrades separability by reducing node degree.
Multiple GC operations can maintain separability as neighborhood distance is normalized.
Abstract
Graphs with heterophily have been regarded as challenging scenarios for Graph Neural Networks (GNNs), where nodes are connected with dissimilar neighbors through various patterns. In this paper, we present theoretical understandings of the impacts of different heterophily patterns for GNNs by incorporating the graph convolution (GC) operations into fully connected networks via the proposed Heterophilous Stochastic Block Models (HSBM), a general random graph model that can accommodate diverse heterophily patterns. Firstly, we show that by applying a GC operation, the separability gains are determined by two factors, i.e., the Euclidean distance of the neighborhood distributions and , where is the averaged node degree. It reveals that the impact of heterophily on classification needs to be…
Peer Reviews
Decision·ICML 2024 Poster
Good paper with high originality and high quality. The paper is well-written and makes some new contributions to the relevant field.
More large-scale datasets are suggested to be added.
The paper provides a detailed analysis of GNNs using the HSBM graph generation model. The theoretical analysis and empirical evaluations demonstrate the effectiveness of the analysis.
1. The paper lacks comparisons with existing methods. Previous methods [1,2] have provided analysis on heterophily from the perspective of node degree and neighborhood distribution. It would be beneficial to include discussions and comparisons from the standpoint of assumptions, graph generation, and results. 2. The paper does not provide suggestions for learning on heterophilous graphs. The analysis of heterophilous patterns in relation to model performance is provided, but it would be helpful
Theoretical Insight into Heterophily Patterns: A significant strength of this work lies in its analytical treatment of the heterophily pattern. By dissecting and delving into the theoretical facets of heterophily, the paper offers an elevated understanding of datasets characterized by this pattern. This examination provides a foundational framework for future investigations into heterophily-rich datasets.
Limited Novelty: While the paper takes steps toward analyzing the heterophily problem, the extent of innovation remains somewhat constrained. I found that the conclusions and the main method they use are very similar to this ICML 21 paper: Graph Convolution for Semi-Supervised Classification: Improved Linear Separability and Out-of-Distribution Generalization. In that paper, they also analyze the SBM model and show that graph convolution extends the regime in which the data is linearly separable
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Neural Networks and Applications · Machine Learning and ELM
MethodsConvolution
