gLSTM: Mitigating Over-Squashing by Increasing Storage Capacity
Hugh Blayney, Alvaro Arroyo, Xiaowen Dong, Michael M. Bronstein
Abstract
Graph Neural Networks (GNNs) leverage the graph structure to transmit information between nodes, typically through the message-passing mechanism. While these models have found a wide variety of applications, they are known to suffer from over-squashing, where information from a large receptive field of node representations is collapsed into a single fixed sized vector, resulting in an information bottleneck. In this paper, we re-examine the over-squashing phenomenon through the lens of model storage and retrieval capacity, which we define as the amount of information that can be stored in a node’s representation for later use. We study some of the limitations of existing tasks used to measure over-squashing and introduce a new synthetic task to demonstrate that an information bottleneck can saturate this capacity. Furthermore, we adapt ideas from the sequence modeling literature on associative memories, fast weight programmers, and the xLSTM model to develop a novel GNN architecture with improved capacity. We demonstrate strong performance of this architecture both on our capacity synthetic task, as well as a range of real-world graph benchmarks.
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 2cb96590-a053-4745-b290-84412ab3e5a3Cited by top-tier papers1
Ask how each one uses itBuilds on22
- Understanding over-squashing and bottlenecks on graphs via curvatureJake Topping, Francesco Di Giovanni, Benjamin Paul Chamberlain, Xiaowen Dong et al.ICLR 2022 · 628 citations
- Hopfield Networks is All You NeedHubert Ramsauer, Bernhard Schäfl, Johannes Lehner, Philipp Seidl et al.ICLR 2021 · 620 citations
- Resurrecting Recurrent Neural Networks for Long SequencesAntonio Orvieto, Samuel L. Smith, Albert Gu, Anushan Fernando et al.ICML 2023 · 474 citations
- Design Space for Graph Neural NetworksJiaxuan You, Zhitao Ying, Jure LeskovecNeurIPS 2020 · 409 citations
- Linear Transformers Are Secretly Fast Weight ProgrammersImanol Schlag, Kazuki Irie, Jürgen SchmidhuberICML 2021 · 394 citations
Related papers
- On the Bottleneck of Graph Neural Networks and its Practical ImplicationsUri Alon, Eran YahavICLR 2021 · 90 citations
- On Vanishing Gradients, Over-Smoothing, and Over-Squashing in GNNs: Bridging Recurrent and Graph LearningAlvaro Arroyo, Alessio Gravina, Benjamin Gutteridge, Federico Barbero et al.NeurIPS 2025 · 58 citations
- Locality-Aware Graph Rewiring in GNNsFederico Barbero, Ameya Velingker, Amin Saberi, Michael M. Bronstein et al.ICLR 2024 · 64 citations
- Understanding Oversquashing in GNNs through the Lens of Effective ResistanceMitchell Black, Zhengchao Wan, Amir Nayyeri, Yusu WangICML 2023 · 116 citations
- PANDA: Expanded Width-Aware Message Passing Beyond RewiringJeongwhan Choi, Sumin Park, Hyowon Wi, Sung-Bae Cho et al.ICML 2024 · 12 citations
