GNNs Getting ComFy: Community and Feature Similarity Guided Rewiring
Celia Rubio-Madrigal, Adarsh Jamadandi, Rebekka Burkholz
Abstract
Maximizing the spectral gap through graph rewiring has been proposed to enhance the performance of message-passing graph neural networks (GNNs) by addressing over-squashing. However, as we show, minimizing the spectral gap can also improve generalization. To explain this, we analyze how rewiring can benefit GNNs within the context of stochastic block models. Since spectral gap optimization primarily influences community strength, it improves performance when the community structure aligns with node labels. Building on this insight, we propose three distinct rewiring strategies that explicitly target community structure, node labels, and their alignment: (a) community structure-based rewiring (ComMa), a more computationally efficient alternative to spectral gap optimization that achieves similar goals; (b) feature similarity-based rewiring (FeaSt), which focuses on maximizing global homophily; and (c) a hybrid approach (ComFy), which enhances local feature similarity while preserving community structure to optimize label-community alignment. Extensive experiments confirm the effectiveness of these strategies and support our theoretical insights.
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 3ec37e86-dc79-404f-9cfa-6847c8c7ba83Cited by top-tier papers5
- Memorization in Graph Neural NetworksAdarsh Jamadandi, Jing Xu, Adam Dziedzic, Franziska BoenischNeurIPS 2025 · 3 citations
- Hyperbolic Aware Minimization: Implicit Bias for SparsityTom Jacobs, Advait Gadhikar, Celia Rubio-Madrigal, Rebekka BurkholzICLR 2026 · 3 citations
- Fixed Aggregation Features Can Rival GNNsCelia Rubio-Madrigal, Rebekka BurkholzICML 2026 · 2 citations
- Commute Graph Neural NetworksWei Zhuo, Han Yu, Guang Tan, Xiaoxiao LiICML 2025
- Learn When and Where to Connect: Adaptive Virtual Nodes for Dynamic Message Passing on GraphsJaejun Lee, Joyce Jiyoung WhangKDD 2026
Builds on20
- DeepGCNs: Can GCNs Go As Deep As CNNs?Guohao Li, Matthias Müller, Ali K. Thabet, Bernard GhanemICCV 2019 · 1,586 citations
- Learning to Simulate Complex Physics with Graph NetworksAlvaro Sanchez-Gonzalez, Jonathan Godwin, Tobias Pfaff, Rex Ying et al.ICML 2020 · 1,439 citations
- Graph Neural Networks Exponentially Lose Expressive Power for Node ClassificationKenta Oono, Taiji SuzukiICLR 2020 · 864 citations
- Understanding over-squashing and bottlenecks on graphs via curvatureJake Topping, Francesco Di Giovanni, Benjamin Paul Chamberlain, Xiaowen Dong et al.ICLR 2022 · 628 citations
- A Fair Comparison of Graph Neural Networks for Graph ClassificationFederico Errica, Marco Podda, Davide Bacciu, Alessio MicheliICLR 2020 · 508 citations
Related papers
- Locality-Aware Graph Rewiring in GNNsFederico Barbero, Ameya Velingker, Amin Saberi, Michael M. Bronstein et al.ICLR 2024 · 64 citations
- Mitigating Over-Squashing in Graph Neural Networks by Spectrum-Preserving SparsificationLangzhang Liang, Fanchen Bu, Zixing Song, Zenglin Xu et al.ICML 2025
- Spectral Graph Pruning Against Over-Squashing and Over-SmoothingAdarsh Jamadandi, Celia Rubio-Madrigal, Rebekka BurkholzNeurIPS 2024 · 33 citations
- FoSR: First-order spectral rewiring for addressing oversquashing in GNNsKedar Karhadkar, Pradeep Kr. Banerjee, Guido MontúfarICLR 2023 · 7 citations
- Joint Graph Rewiring and Feature Denoising via Spectral ResonanceJonas Linkerhägner, Cheng Shi, Ivan DokmanicICLR 2025
