Understanding the Failure Modes of Transformers through the Lens of Graph Neural Networks
Not on the map. Why?
Abstract (arXiv)
Transformers and more specifically decoder-only transformers dominate modern LLM architectures. While they have shown to work exceptionally well, they are not without issues, resulting in surprising failure modes and predictably asymmetric performance degradation. This article is a study of many of these observed failure modes of transformers through the lens of graph neural network (GNN) theory. We first make the case that much of deep learning, including transformers, is about learnable information mixing and propagation. This makes the study of model failure modes a study of bottlenecks in information propagation. This naturally leads to GNN theory, where there is already a rich literature on information propagation bottlenecks and theoretical failure modes of models. We then make the case that many issues faced by GNNs are also experienced by transformers. In addition, we analyze how the causal nature of decoder-only transformers create interesting geometric properties in information propagation, resulting in predictable and potentially devastating failure modes. Finally, we observe that existing solutions in transformer research tend to be ad-hoc and driven by intuition rather than grounded theoretical motivation. As such, we unify many such solutions under a more theoretical perspective, providing insight into why they work, what problem they are actually solving, and how they can be further improved to target specific failure modes of transformers. Overall, this article is an attempt to bridge the gap between observed failure modes in transformers and a general lack of theoretical understanding of them in this space.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 26 of its 29 references that are in the map. First posted on arXiv 9 Dec 2025.
Builds on
26 of 29 references.
References · 26
- 2017Attention Is All You Needcited by 59,932
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2017Neural Message Passing for Quantum Chemistrycited by 3,460
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
- 2017Deep Setscited by 1,394
- 2018Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learningcited by 1,099
- 2021How Attentive are Graph Attention Networks?cited by 818
- 2020On the Bottleneck of Graph Neural Networks and its Practical Implicationscited by 624
- 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 471
- 2023Think before you speak: Training Language Models With Pause Tokenscited by 254
14 more
- 2023A Survey on Oversmoothing in Graph Neural Networkscited by 246
- 2020A Note on Over-Smoothing for Graph Neural Networkscited by 245
- 2024When Attention Sink Emerges in Language Models: An Empirical Viewcited by 200
- 2023On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topologycited by 163
- 2025Why do LLMs attend to the first token?cited by 122
- 2022FoSR: First-order spectral rewiring for addressing oversquashing in GNNscited by 104
- 2023Understanding Oversquashing in GNNs through the Lens of Effective Resistancecited by 94
- 2024Transformers need glasses! Information over-squashing in language taskscited by 87
- 2022DiffWire: Inductive Graph Rewiring via the Lov'asz Boundcited by 79
- 2022Expander Graph Propagationcited by 75
- 2025On the Emergence of Position Bias in Transformerscited by 57
- 2024On the Role of Attention Masks and LayerNorm in Transformerscited by 45
- 2025Transformers are Graph Neural Networkscited by 29
- 2024Cayley Graph Propagationcited by 21
Built on by
Not cited yet.