Revisiting the Message Passing in Heterophilous Graph Neural Networks
Zhuonan Zheng, Yuanchen Bei, Sheng Zhou, Yao Ma, Ming Gu, HongJia XU,, Chengyu Lai, Jiawei Chen, Jiajun Bu

TL;DR
This paper revisits message passing in heterophilous GNNs, revealing its effectiveness is due to implicit class compatibility enhancement, and proposes CMGNN to explicitly leverage this for improved performance.
Contribution
It reformulates message passing into a unified heterophilious mechanism and introduces CMGNN to explicitly optimize class compatibility in heterophilous graphs.
Findings
Message passing implicitly enhances class compatibility matrices.
CMGNN explicitly improves compatibility matrices leading to better results.
CMGNN outperforms 13 baselines on 10 benchmark datasets.
Abstract
Graph Neural Networks (GNNs) have demonstrated strong performance in graph mining tasks due to their message-passing mechanism, which is aligned with the homophily assumption that adjacent nodes exhibit similar behaviors. However, in many real-world graphs, connected nodes may display contrasting behaviors, termed as heterophilous patterns, which has attracted increased interest in heterophilous GNNs (HTGNNs). Although the message-passing mechanism seems unsuitable for heterophilous graphs due to the propagation of class-irrelevant information, it is still widely used in many existing HTGNNs and consistently achieves notable success. This raises the question: why does message passing remain effective on heterophilous graphs? To answer this question, in this paper, we revisit the message-passing mechanisms in heterophilous graph neural networks and reformulate them into a unified…
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
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Advanced Graph Neural Networks · Advanced Memory and Neural Computing
