mlsanityData to 14 Oct 2026

How Wide and How Deep? Mitigating Over-Squashing of GNNs via Channel Capacity Constrained Estimation

arXiv 2511.06443 ↗First posted 9 Nov 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Existing graph neural networks typically rely on heuristic choices for hidden dimensions and propagation depths, which often lead to severe information loss during propagation, known as over-squashing. To address this issue, we propose Channel Capacity Constrained Estimation (C3E), a novel framework that formulates the selection of hidden dimensions and depth as a nonlinear programming problem grounded in information theory. Through modeling spectral graph neural networks as communication channels, our approach directly connects channel capacity to hidden dimensions, propagation depth, propagation mechanism, and graph structure. Extensive experiments on nine public datasets demonstrate that hidden dimensions and depths estimated by C3E can mitigate over-squashing and consistently improve representation learning. Experimental results show that over-squashing occurs due to the cumulative compression of information in representation matrices. Furthermore, our findings show that increasing hidden dimensions indeed mitigate information compression, while the role of propagation depth is more nuanced, uncovering a fundamental balance between information compression and representation complexity.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 34 of its 50 references that are in the map. First posted on arXiv 9 Nov 2025.

Builds on

34 of 50 references.

References · 34

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Graph Attention Networkscited by 8,923
  3. 2017Inductive Representation Learning on Large Graphscited by 6,320
  4. 2018How Powerful are Graph Neural Networks?cited by 4,393
  5. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
  6. 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,163
  7. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,089
  8. 2019Simplifying Graph Convolutional Networkscited by 1,477
  9. 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,102
  10. 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
  11. 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 877
  12. 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 713
22 more
  1. 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 595
  2. 2019Multi-scale Attributed Node Embeddingcited by 548
  3. 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 545
  4. 2019Revisiting Graph Neural Networks: All We Have is Low-Pass Filterscited by 261
  5. 2020A Note on Over-Smoothing for Graph Neural Networkscited by 249
  6. 2015Deep Convolutional Networks on Graph-Structured Datacited by 246
  7. 2022Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNscited by 214
  8. 2019What graph neural networks cannot learn: depth vs widthcited by 201
  9. 2016Deep Information Propagationcited by 195
  10. 2021BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximationcited by 195
  11. 2020Design Space for Graph Neural Networkscited by 182
  12. 2020Graph Information Bottleneckcited by 168
  13. 2023On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topologycited by 166
  14. 2021ReduNet: A White-box Deep Network from the Principle of Maximizing Rate Reductioncited by 84
  15. 2021On Provable Benefits of Depth in Training Graph Convolutional Networkscited by 58
  16. 2020Revisiting Over-smoothing in Deep GCNscited by 55
  17. 2020Understanding and Resolving Performance Degradation in Graph Convolutional Networkscited by 53
  18. 2023A Fractional Graph Laplacian Approach to Oversmoothingcited by 45
  19. 2024On Oversquashing in Graph Neural Networks Through the Lens of Dynamical Systemscited by 28
  20. 2021Rethinking Graph Neural Architecture Search from Message-passingcited by 26
  21. 2024How Universal Polynomial Bases Enhance Spectral Graph Neural Networks: Heterophily, Over-smoothing, and Over-squashingcited by 24
  22. 2021MAE-DET: Revisiting Maximum Entropy Principle in Zero-Shot NAS for Efficient Object Detectioncited by 16

Built on by

Not cited yet.