Multi-Track Message Passing: Tackling Oversmoothing and Oversquashing in Graph Learning via Preventing Heterophily Mixing
Hongbin Pei, Yu Li, Huiqi Deng, Jingxin Hai, Pinghui Wang, Jie Ma, Jing Tao, Yuheng Xiong, Xiaohong Guan
Abstract
The advancement toward deeper graph neural networks is currently obscured by two inherent issues in message passing, oversmoothing and oversquashing. We identify the root cause of these issues as information loss due to heterophily mixing in aggregation, where messages of diverse category semantics are mixed. We propose a novel multi-track graph convolutional network to address oversmoothing and oversquashing effectively. Our basic idea is intuitive: if messages are separated and independently propagated according to their category semantics, heterophilic mixing can be prevented. Consequently, we present a novel multi-track message passing scheme capable of preventing heterophilic mixing, enhancing long-distance information flow, and improving separation condition. Empirical validations show that our model achieved state-of-the-art performance on several graph datasets and effectively tackled oversmoothing and oversquashing, setting a new benchmark of 86.4% accuracy on Cora. 1
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 0bfaef62-bdce-4cba-ae01-5636297eef87Cited by top-tier papers8
- Deeper with Riemannian Geometry: Overcoming Oversmoothing and Oversquashing for Graph Foundation ModelsLi Sun, Zhenhao Huang, Ming Zhang, Philip S. YuNeurIPS 2025 · 10 citations
- Backward Oversmoothing: why is it hard to train deep Graph Neural Networks?Nicolas KerivenICML 2026 · 4 citations
- Si-GT: Fast Interconnect Signal Integrity Analysis for Integrated Circuit Design via Graph TransformersYuting Hu, Tarek Mohamed, Chenhui Xu, Hua Xiang et al.ICLR 2026
- Non-Stationary Predictions May Be More Informative: Exploring Pseudo-Labels with a Two-Phase Pattern of Training DynamicsHongbin Pei, Jingxin Hai, Yu Li, Huiqi Deng et al.ICML 2025
- Hierarchical Multi Scale Graph Neural Networks: Scalable Heterophilous Learning with Oversmoothing and Oversquashing MitigationMD SAZZAD Hossen, Avimanyu SahooICML 2026
Builds on33
- Simple and Deep Graph Convolutional NetworksMing Chen, Zhewei Wei, Zengfeng Huang, Bolin Ding et al.ICML 2020 · 1,910 citations
- 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
- 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
- Recipe for a General, Powerful, Scalable Graph TransformerLadislav Rampásek, Michael Galkin, Vijay Prakash Dwivedi, Anh Tuan Luu et al.NeurIPS 2022 · 1,216 citations
Related papers
- Gradient Gating for Deep Multi-Rate Learning on GraphsT. Konstantin Rusch, Benjamin Paul Chamberlain, Michael W. Mahoney, Michael M. Bronstein et al.ICLR 2023 · 6 citations
- Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothingYunchong Song, Chenghu Zhou, Xinbing Wang, Zhouhan LinICLR 2023 · 18 citations
- Sign is Not a Remedy: Multiset-to-Multiset Message Passing for Learning on Heterophilic GraphsLangzhang Liang, Sunwoo Kim, Kijung Shin, Zenglin Xu et al.ICML 2024 · 13 citations
- Oversmoothing, "Oversquashing", Heterophily, Long-Range, and more: Demystifying Common Beliefs in Graph Machine LearningAdrián Arnaiz-Rodríguez, Federico ErricaICLR 2026 · 26 citations
- MultiNet: Adaptive Multi-Viewed Subgraph Convolutional Networks for Graph ClassificationXinya Qin, Lu Bai, Lixin Cui, Ming Li et al.NeurIPS 2025 · 2 citations
