When Do Graph Neural Networks Help with Node Classification? Investigating the Homophily Principle on Node Distinguishability
Sitao Luan, Chenqing Hua, Minkai Xu, Qincheng Lu, Jiaqi Zhu, Xiao-Wen Chang, Jie Fu, Jure Leskovec, Doina Precup
Abstract
Homophily principle, i.e., nodes with the same labels are more likely to be connected, has been believed to be the main reason for the performance superiority of Graph Neural Networks (GNNs) over Neural Networks on node classification tasks. Recent research suggests that, even in the absence of homophily, the advantage of GNNs still exists as long as nodes from the same class share similar neighborhood patterns [38] . However, this argument only considers intra-class Node Distinguishability (ND) but neglects inter-class ND, which provides incomplete understanding of homophily on GNNs. In this paper, we first demonstrate such deficiency with examples and argue that an ideal situation for ND is to have smaller intra-class ND than inter-class ND. To formulate this idea and study ND deeply, we propose Contextual Stochastic Block Model for Homophily (CSBM-H) and define two metrics, Probabilistic Bayes Error (PBE) and negative generalized Jeffreys divergence, to quantify ND. With the metrics, we visualize and analyze how graph filters, node degree distributions and class variances influence ND, and investigate the combined effect of intra-and inter-class ND. Besides, we discovered the mid-homophily pitfall, which occurs widely in graph datasets. Furthermore, we verified that, in real-work tasks, the superiority of GNNs is indeed closely related to both intraand inter-class ND regardless of homophily levels. Grounded in this observation, we propose a new hypothesis-testing based performance metric beyond homophily, which is non-linear, feature-based and can provide statistical threshold value for GNNs' the superiority. Experiments indicate that it is significantly more effective than the existing homophily metrics on revealing the advantage and disadvantage of graph-aware modes on both synthetic and benchmark real-world datasets. 37th Conference on Neural Information Processing Systems (NeurIPS 2023).
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 9d18e196-4302-4ff2-829c-15d0bab947d0Cited by top-tier papers34
- Characterizing Graph Datasets for Node Classification: Homophily-Heterophily Dichotomy and BeyondOleg Platonov, Denis Kuznedelev, Artem Babenko, Liudmila ProkhorenkovaNeurIPS 2023 · 95 citations
- How Universal Polynomial Bases Enhance Spectral Graph Neural Networks: Heterophily, Over-smoothing, and Over-squashingKeke Huang, Yu Guang Wang, Ming Li, Pietro LioICML 2024 · 62 citations
- Demystifying Structural Disparity in Graph Neural Networks: Can One Size Fit All?Haitao Mao, Zhikai Chen, Wei Jin, Haoyu Han et al.NeurIPS 2023 · 58 citations
- PolyGCL: GRAPH CONTRASTIVE LEARNING via Learnable Spectral Polynomial FiltersJingyu Chen, Runlin Lei, Zhewei WeiICLR 2024 · 49 citations
- DGA-GNN: Dynamic Grouping Aggregation GNN for Fraud DetectionMingjiang Duan, Tongya Zheng, Yang Gao, Gang Wang et al.AAAI 2024 · 42 citations
Builds on11
- Beyond Homophily in Graph Neural Networks: Current Limitations and Effective DesignsJiong Zhu, Yujun Yan, Lingxiao Zhao, Mark Heimann et al.NeurIPS 2020 · 1,490 citations
- Geom-GCN: Geometric Graph Convolutional NetworksHongbin Pei, Bingzhe Wei, Kevin Chen-Chuan Chang, Yu Lei et al.ICLR 2020 · 1,445 citations
- Beyond Low-frequency Information in Graph Convolutional NetworksDeyu Bo, Xiao Wang, Chuan Shi, Huawei ShenAAAI 2021 · 773 citations
- Graph Neural Networks with HeterophilyJiong Zhu, Ryan A. Rossi, Anup Rao, Tung Mai et al.AAAI 2021 · 393 citations
- BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein ApproximationMingguo He, Zhewei Wei, Zengfeng Huang, Hongteng XuNeurIPS 2021 · 378 citations
Related papers
- What Is Missing For Graph Homophily? Disentangling Graph Homophily For Graph Neural NetworksYilun Zheng, Sitao Luan, Lihui ChenNeurIPS 2024 · 24 citations
- Conflicting Node Discrimination Graph Neural Network for Semi-supervised Node ClassificationWenjun Wang, Xin Cao, Yawen Li, XiaoLong Deng et al.KDD 2026
- Revisiting Heterophily For Graph Neural NetworksSitao Luan, Chenqing Hua, Qincheng Lu, Jiaqi Zhu et al.NeurIPS 2022 · 351 citations
- Is Homophily a Necessity for Graph Neural Networks?Yao Ma, Xiaorui Liu, Neil Shah, Jiliang TangICLR 2022 · 295 citations
- A critical look at the evaluation of GNNs under heterophily: Are we really making progress?Oleg Platonov, Denis Kuznedelev, Michael Diskin, Artem Babenko et al.ICLR 2023 · 22 citations
