Sign is Not a Remedy: Multiset-to-Multiset Message Passing for Learning on Heterophilic Graphs
Langzhang Liang, Sunwoo Kim, Kijung Shin, Zenglin Xu, Shirui Pan, Yuan Qi
Abstract
Graph Neural Networks (GNNs) have gained significant attention as a powerful modeling and inference method, especially for homophilic graph-structured data. To empower GNNs in heterophilic graphs, where adjacent nodes exhibit dissimilar labels or features, Signed Message Passing (SMP) has been widely adopted. However, there is a lack of theoretical and empirical analysis regarding the limitations of SMP. In this work, we unveil some potential pitfalls of SMP and their remedies. We first identify two limitations of SMP: undesirable representation update for multi-hop neighbors and vulnerability against oversmoothing issues. To overcome these challenges, we propose a novel message passing function called Multiset to Multiset GNN(M2M-GNN). Our theoretical analyses and extensive experiments demonstrate that M2M-GNN effectively alleviates the aforementioned limitations of SMP, yielding superior performance in comparison
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 77090901-883d-48c4-aad1-a20c2dbead9aCited by top-tier papers10
- Rethinking Reconstruction-based Graph-Level Anomaly Detection: Limitations and a Simple RemedySunwoo Kim, Soo Yong Lee, Fanchen Bu, Shinhwan Kang et al.NeurIPS 2024 · 27 citations
- A Signed Graph Approach to Understanding and Mitigating OversmoothingJiaqi Wang, Xinyi Wu, James Cheng, Yifei WangNeurIPS 2025 · 4 citations
- Understanding and Enhancing Message Passing on Heterophilic Graphs via Compatibility MatrixZhuonan Zheng, Yuanchen Bei, Zhiyao Zhou, Sheng Zhou et al.NeurIPS 2025 · 3 citations
- Preference-driven Knowledge Distillation for Few-shot Node ClassificationXing Wei, Chunchun Chen, Rui Fan, Xiaofeng Cao et al.NeurIPS 2025 · 2 citations
- Coloring Learning for Heterophilic Graph RepresentationMiaomiao Huang, Yuhai Zhao, Daniel Zhengkui Wang, Fenglong Ma et al.NeurIPS 2025
Builds on19
- How Attentive are Graph Attention Networks?Shaked Brody, Uri Alon, Eran YahavICLR 2022 · 1,717 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
- Graph Neural Networks Exponentially Lose Expressive Power for Node ClassificationKenta Oono, Taiji SuzukiICLR 2020 · 864 citations
- Beyond Low-frequency Information in Graph Convolutional NetworksDeyu Bo, Xiao Wang, Chuan Shi, Huawei ShenAAAI 2021 · 773 citations
Related papers
- Polarized Graph Neural NetworksZheng Fang, Lingjun Xu, Guojie Song, Qingqing Long et al.WWW 2022 · 31 citations
- Boosting Graph Convolution with Disparity-induced Structural RefinementSujia Huang, Yueyang Pi, Tong Zhang, Wenzhe Liu et al.WWW 2025 · 1 citation
- p-Laplacian Based Graph Neural NetworksGuoji Fu, Peilin Zhao, Yatao BianICML 2022 · 53 citations
- Mitigating Oversmoothing Through Reverse Process of GNNs for Heterophilic GraphsMoonjeong Park, Jaeseung Heo, Dongwoo KimICML 2024 · 7 citations
- 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
