paper-with-me

홈 › Papers

Mind the Gap: a Spectral Analysis of Rank Collapse and Signal Propagation in Attention Layers

2024-10-10 · Alireza Naderi, Thiziri Nait Saada, Jared Tanner

Attention layers are the core component of transformers, the current state-of-the-art neural network architecture. Alternatives to softmax-based attention are being explored due to its tendency to hinder effective information flow. Even at initialisation, it remains poorly understood why the propagation of signals and gradients through these random networks can be pathological, resulting in issues known as (i) vanishing/exploding gradients and (ii) rank collapse $\textit{in depth}$, i.e. when all tokens converge to a single representation along layers. While rank collapse in depth naturally arises from repeated matrix multiplications$\unicode{x2013}$a common pattern across various architectures$\unicode{x2013}$we identify an additional and previously unknown challenge unique to softmax attention layers: (iii) rank collapse $\textit{in width}$, which occurs as the context length increases. Using Random Matrix Theory, we conduct a rigorous analysis that uncovers a spectral gap between the two largest singular values of the attention matrix as the cause of (iii), which in turn exacerbates (i) and (ii). Building on this insight, we propose a novel yet simple practical solution to mitigate rank collapse in width by removing the outlier eigenvalue(s). Our theoretical framework offers a fresh perspective on recent practical studies, such as (Ye et al., 2024; Ali et al., 2023), whose ad hoc solutions can now be interpreted as implicit efforts to address the spectral gap issue. This work provides valuable theoretical support for ongoing large-scale empirical research, bringing theory and practice one step closer in the understanding of transformers.

📄 PDF Abstract BibTeX arXiv:2410.07799

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Attention 설명 없음
ALI 설명 없음
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
HOC 설명 없음

Similar Papers 제목 키워드 기반

From Dispersion to Attraction: Spectral Dynamics of Hallucination Across Whisper Model Scales

2026-03-31 · Ivan Viakhirev, Kirill Borodin, Grach Mkrtchian arxiv

Hallucinations in large ASR models present a critical safety risk. In this work, we propose the \textit{Spectral Sensitivity Theorem}, which predicts a phase transition in deep networks from a dispersive regime (signal d…

Collapsed Effective Operators for Higher-order Structures

2026-06-22 · Maximilian Krahn, Lennart Bastian, Vikas Garg, Björn Schuller 외 arxiv

Higher-order structures are powerful relational modeling tools, yet existing spectral operators decompose the topology into separate ranks, leaving practitioners to fuse the information back to vertices through ad hoc ch…

Posterior Collapse as Automatic Spectral Pruning

2026-05-21 · Johannes Hirn arxiv

We show that posterior collapse in $β$-VAEs implements automatic spectral pruning. A latent mode collapses if its contribution to reconstruction is below the cutoff set by $β$. Equilibrium solutions with different $β$ th…

Laplacian-LoRA: Delaying Oversmoothing in Deep GCNs via Spectral Low-Rank Adaptation

2026-02-07 · Sai Vamsi Alisetti arxiv

Oversmoothing is a fundamental limitation of deep graph convolutional networks (GCNs), causing node representations to collapse as depth increases. While many prior approaches mitigate this effect through architectural m…

Spectral Collapse Drives Loss of Plasticity in Deep Continual Learning

2025-09-26 · Arjun Prakash, Naicheng He, Kaicheng Guo, Saket Tiwari 외 arxiv

We investigate why deep neural networks suffer from loss of plasticity in continual learning, and thus fail to learn new tasks without reinitializing parameters. We show that this failure is preceded by Hessian spectral …

Reinforcement LearningContinual Learning