gLSTM: Mitigating Over-Squashing by Increasing Storage Capacity
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 43 of its 53 references that are in the map. First posted on arXiv 9 Oct 2025.
Builds on
43 of 53 references.
References · 43
- 2017Attention Is All You Needcited by 60,361
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,089
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 2,022
- 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,102
- 2020On the Bottleneck of Graph Neural Networks and its Practical Implicationscited by 631
- 2021Linear Transformers Are Secretly Fast Weight Programmerscited by 502
- 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 478
31 more
- 2020Hopfield Networks is All You Needcited by 475
- 2019Diffusion Improves Graph Learningcited by 414
- 2023Resurrecting Recurrent Neural Networks for Long Sequencescited by 408
- 2017Residual Gated Graph ConvNetscited by 346
- 2024xLSTM: Extended Long Short-Term Memorycited by 327
- 2022Long Range Graph Benchmarkcited by 263
- 2016Dense Associative Memory for Pattern Recognitioncited by 236
- 2024Repeat After Me: Transformers are Better than State Space Models at Copyingcited by 216
- 2023Zoology: Measuring and Improving Recall in Efficient Language Modelscited by 204
- 2020Design Space for Graph Neural Networkscited by 182
- 2016Using Fast Weights to Attend to the Recent Pastcited by 170
- 2023On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topologycited by 166
- 2025Why do LLMs attend to the first token?cited by 127
- 2022Revisiting Over-smoothing and Over-squashing Using Ollivier-Ricci Curvaturecited by 98
- 2023Understanding Oversquashing in GNNs through the Lens of Effective Resistancecited by 97
- 2024Transformers need glasses! Information over-squashing in language taskscited by 91
- 2023Where Did the Gap Go? Reassessing the Long-Range Graph Benchmarkcited by 85
- 2023DRew: Dynamically Rewired Message Passing with Delaycited by 82
- 2022Anti-Symmetric DGN: a stable architecture for Deep Graph Networkscited by 60
- 2023How does over-squashing affect the power of GNNs?cited by 53
- 2017Dense Associative Memory is Robust to Adversarial Inputscited by 45
- 2025On Vanishing Gradients, Over-Smoothing, and Over-Squashing in GNNs: Bridging Recurrent and Graph Learningcited by 43
- 2023Cooperative Graph Neural Networkscited by 36
- 2024On Oversquashing in Graph Neural Networks Through the Lens of Dynamical Systemscited by 28
- 2023Adaptive Message Passing: A General Framework to Mitigate Oversmoothing, Oversquashing, and Underreachingcited by 24
- 2025Oversmoothing, Oversquashing, Heterophily, Long-Range, and more: Demystifying Common Beliefs in Graph Machine Learningcited by 19
- 2025xLSTM 7B: A Recurrent LLM for Fast and Efficient Inferencecited by 18
- 2024Port-Hamiltonian Architectural Bias for Long-Range Propagation in Deep Graph Networkscited by 16
- 2025Return of ChebNet: Understanding and Improving an Overlooked GNN on Long Range Taskscited by 12
- 2023Recurrent Distance Filtering for Graph Representation Learningcited by 11
- 2025pLSTM: parallelizable Linear Source Transition Mark networkscited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026A Mechanistic Analysis of Looped Reasoning Language Modelscited by 33
- 2026A Mechanistic Analysis of Looped Reasoning Language Models13 Apr 2026