The Devil is in the Spectrum: Mitigating Representation Collapse in LLMs via Topologically Regularized Side-Path
Not on the map. Why?
Abstract (arXiv)
Large Language Models (LLMs) are fundamentally limited by representation collapse, a bottleneck that severely degrades long-context performance. We identify that existing approaches risk drifting into one of two pathological extremes: homogenization collapse (e.g., attention sinks causing rank deficiency) and isolation collapse (e.g., local attention causing context disconnection). Through spectral analysis of attention dynamics, we derive an intrinsic trade-off between mixing efficiency (spectral gap) and information capacity (effective rank) that standard mechanisms struggle to balance. To resolve this dilemma, we propose the Topologically Regularized Side-Path (TRSP), a non-invasive architectural intervention that achieves spectral balance. TRSP employs a parameter-free Triangular Box mechanism, scaled by a lightweight, length-aware gate, to regularize the token interaction topology. By integrating proximal coupling to preserve effective rank and distal propagation to support non-degenerate mixing, TRSP promotes a geometrically healthier transition operator without altering core attention. Experiments show significant improvements across general capabilities and long-context benchmarks. Notably, on NoLiMa at 8× the training length, TRSP retains 83% accuracy and surpasses the Differential Transformer and Gated Attention by approximately 30 and 50 percentage points, respectively. Code available at: https://github.com/Eziotao-tyd/TRSP.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 46 of its 61 references that are in the map. First posted on arXiv 2 Jun 2026.
Builds on
46 of 61 references.
References · 46
- 2024The Llama 3 Herd of Modelscited by 14,192
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
- 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,383
- 2020Longformer: The Long-Document Transformercited by 3,362
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
- 2019Transformer-XL: Attentive Language Models Beyond a Fixed-Length Contextcited by 1,830
- 2020Big Bird: Transformers for Longer Sequencescited by 1,673
- 2019Generating Long Sequences with Sparse Transformerscited by 1,523
34 more
- 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,270
- 2021Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolationcited by 1,085
- 2023RWKV: Reinventing RNNs for the Transformer Eracited by 814
- 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Modelscited by 805
- 2019How Contextual are Contextualized Word Representations? Comparing the Geometry of BERT, ELMo, and GPT-2 Embeddingscited by 770
- 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
- 2023YaRN: Efficient Context Window Extension of Large Language Modelscited by 584
- 2024FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precisioncited by 507
- 2023Model Tells You What to Discard: Adaptive KV Cache Compression for LLMscited by 466
- 2023Ring Attention with Blockwise Transformers for Near-Infinite Contextcited by 448
- 2021Attention is Not All You Need: Pure Attention Loses Rank Doubly Exponentially with Depthcited by 411
- 2018Regularisation of Neural Networks by Enforcing Lipschitz Continuitycited by 311
- 2024Massive Activations in Large Language Modelscited by 277
- 2025Gated Attention for Large Language Models: Non-linearity, Sparsity, and Attention-Sink-Freecited by 266
- 2019Representation Degeneration Problem in Training Natural Language Generation Modelscited by 250
- 2024When Attention Sink Emerges in Language Models: An Empirical Viewcited by 200
- 2023A mathematical perspective on Transformerscited by 160
- 2023Quantizable Transformers: Removing Outliers by Helping Attention Heads Do Nothingcited by 147
- 2022Anti-Oversmoothing in Deep Vision Transformers via the Fourier Domain Analysis: From Theory to Practicecited by 136
- 2022Signal Propagation in Transformers: Theoretical Perspectives and the Role of Rank Collapsecited by 136
- 2025Why do LLMs attend to the first token?cited by 122
- 2023LM-Infinite: Zero-Shot Extreme Length Generalization for Large Language Modelscited by 120
- 2025NoLiMa: Long-Context Evaluation Beyond Literal Matchingcited by 120
- 2018How to Start Training: The Effect of Initialization and Architecturecited by 109
- 2022Not too little, not too much: a theoretical analysis of graph (over)smoothingcited by 106
- 2024Transformers need glasses! Information over-squashing in language taskscited by 87
- 2022Revisiting Over-smoothing in BERT from the Perspective of Graphcited by 71
- 2024Theory, Analysis, and Best Practices for Sigmoid Self-Attentioncited by 62
- 2024Layer-Condensed KV Cache for Efficient Inference of Large Language Modelscited by 58
- 2024On the Role of Attention Masks and LayerNorm in Transformerscited by 45
- 2024Softmax is not Enough (for Sharp Size Generalisation)cited by 42
- 2015Optimal approximate matrix product in terms of stable rankcited by 37
- 2023Mitigating Over-smoothing in Transformers via Regularized Nonlocal Functionalscited by 31
- 2024Setting the Record Straight on Transformer Oversmoothingcited by 19
Built on by
Not cited yet.