Spectral-Sphere-Constrained Hyper-Connections
Not on the map. Why?
Abstract (arXiv)
Hyper-Connections (HC) extend residual connections into multiple streams, employing residual matrices for cross-stream mixing to enrich model expressivity. However, unconstrained mixing disrupts the identity mapping property intrinsic to the residual connection, causing unstable training. To address this, Manifold-Constrained Hyper-Connections (mHC) and its variants restrict these matrices to be doubly stochastic via Sinkhorn-Knopp (SK) algorithm or permutation-based parameterizations. We reveal three limitations of this doubly stochastic constraint: (1) identity degeneration, where learned matrices collapse around the identity initialization and diminish cross-stream interactions, (2) a expressivity bottleneck, where the doubly stochastic constraint restricts the freedom of the subdominant spectrum of the residual matrices, preventing the model from selectively preserving or attenuating cross-stream variations, and (3) parameterization inefficiencies, manifesting as unstable SK iterations or the factorial-scaling overhead of permutation-based parameterizations. To overcome these flaws, we propose Spectral-Sphere-Constrained Hyper-Connections (s2HC). By confining residual matrices to a spectral norm sphere, s2HC restores free control over the subdominant spectrum, enabling the model to selectively preserve or attenuate cross-stream variations. This shift eliminates unstable SK iterations and factorial parameterization, enabling expressive, non-degenerate residual matrices while preserving training stability.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 21 of its 25 references that are in the map. First posted on arXiv 21 Mar 2026.
Builds on
21 of 25 references.
References · 21
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2025Qwen3 Technical Reportcited by 8,195
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2024Qwen2.5 Technical Reportcited by 4,713
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2021TruthfulQA: Measuring How Models Mimic Human Falsehoodscited by 2,919
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
9 more
- 2025Gemma 3 Technical Reportcited by 1,686
- 2019Root Mean Square Layer Normalizationcited by 1,425
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,104
- 2024Hyper-Connectionscited by 81
- 2025mHC: Manifold-Constrained Hyper-Connectionscited by 76
- 2026mHC-lite: You Don't Need 20 Sinkhorn-Knopp Iterationscited by 13
- 2026KromHC: Manifold-Constrained Hyper-Connections with Kronecker-Product Residual Matricescited by 10
- 2025Frac-Connections: Fractional Extension of Hyper-Connectionscited by 8
- 2026The Homogeneity Trap: Spectral Collapse in Doubly-Stochastic Deep Networkscited by 1
Built on by
Citing papers per year: 2026: 3.
3 papers.