Mitigating Oversmoothing Through Reverse Process of GNNs for Heterophilic Graphs
Moonjeong Park, Jaeseung Heo, Dongwoo Kim
Abstract
Graph Neural Network (GNN) resembles the diffusion process, leading to the over-smoothing of learned representations when stacking many layers. Hence, the reverse process of message passing can produce the distinguishable node representations by inverting the forward message propagation. The distinguishable representations can help us to better classify neighboring nodes with different labels, such as in heterophilic graphs. In this work, we apply the design principle of the reverse process to the three variants of the GNNs. Through the experiments on heterophilic graph data, where adjacent nodes need to have different representations for successful classification, we show that the reverse process significantly improves the prediction performance in many cases. Additional analysis reveals that the reverse mechanism can mitigate the over-smoothing over hundreds of layers. Our code is available at https://github.com/ ml-postech/reverse-gnn .
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 554ffa39-df72-4b40-8c2a-ce45d0e66932Cited by top-tier papers2
- Making Classic GNNs Strong Baselines Across Varying Homophily: A Smoothness-Generalization PerspectiveMing Gu, Zhuonan Zheng, Sheng Zhou, Meihan Liu et al.NeurIPS 2025 · 4 citations
- Learn When and Where to Connect: Adaptive Virtual Nodes for Dynamic Message Passing on GraphsJaejun Lee, Joyce Jiyoung WhangKDD 2026
Builds on16
- 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
- Measuring and Relieving the Over-Smoothing Problem for Graph Neural Networks from the Topological ViewDeli Chen, Yankai Lin, Wei Li, Peng Li et al.AAAI 2020 · 1,353 citations
- Beyond Low-frequency Information in Graph Convolutional NetworksDeyu Bo, Xiao Wang, Chuan Shi, Huawei ShenAAAI 2021 · 773 citations
- PairNorm: Tackling Oversmoothing in GNNsLingxiao Zhao, Leman AkogluICLR 2020 · 590 citations
- Graph Neural Networks with HeterophilyJiong Zhu, Ryan A. Rossi, Anup Rao, Tung Mai et al.AAAI 2021 · 393 citations
Related papers
- Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothingYunchong Song, Chenghu Zhou, Xinbing Wang, Zhouhan LinICLR 2023 · 18 citations
- Difference Residual Graph Neural NetworksLiang Yang, Weihang Peng, Wenmiao Zhou, Bingxin Niu et al.ACM MM 2022 · 6 citations
- p-Laplacian Based Graph Neural NetworksGuoji Fu, Peilin Zhao, Yatao BianICML 2022 · 53 citations
- On the Impact of Feature Heterophily on Link Prediction with Graph Neural NetworksJiong Zhu, Gaotang Li, Yao-An Yang, Jing Zhu et al.NeurIPS 2024 · 21 citations
- Boosting Graph Convolution with Disparity-induced Structural RefinementSujia Huang, Yueyang Pi, Tong Zhang, Wenzhe Liu et al.WWW 2025 · 1 citation
