oHC: Orthogonal Hyper-Connections on SO(4) via Quaternions
Not on the map. Why?
Abstract (arXiv)
Hyper-Connections (HC) replace the single residual stream of a Transformer with n parallel ones, mixing them at every layer with a learned n × n residual matrix. Leaving that matrix unconstrained places no limit on the factor by which the mixing step rescales the residual streams, and that factor compounds across layers, which destabilizes training. Manifold-constrained Hyper-Connections (mHC) address this by restricting the matrix to the doubly stochastic matrices. That caps the factor at one, so the mixing can no longer amplify any direction, but nothing bounds it from below. We prove that inside this set the mixing step can reduce the norm of the residual streams only by shrinking the differences between the streams, while their mean is left unchanged; and since the reduction accumulates over layers, the streams grow more alike and their diversity is spent with depth. We therefore propose Orthogonal Hyper-Connections (oHC), restricting the residual matrix to the rotation group SO(n), so that the mixing step can neither amplify nor attenuate the residual streams in any direction, which keeps training stable and no longer forces the differences between the streams to contract. Specifically, at the four streams used by recent HC models we parameterize the group in closed form by a pair of unit quaternions, which adds no parameters, replaces the iterative projection with a fixed pattern of signed additions, and can be constructed faster than mHC. We evaluate oHC across a comprehensive set of downstream tasks, where it outperforms the single-stream residual baseline, mHC and iHC, which fixes the residual matrix to the identity.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 40 of its 43 references that are in the map. First posted on arXiv 2 Sep 2026.
Builds on
40 of 43 references.
References · 40
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2021Program Synthesis with Large Language Modelscited by 3,509
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2019Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelismcited by 1,829
- 2024MMLU-Pro: A More Robust and Challenging Multi-Task Language Understanding Benchmarkcited by 1,758
28 more
- 2023Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generationcited by 1,332
- 2018On the Continuity of Rotation Representations in Neural Networkscited by 1,186
- 2023C-Eval: A Multi-Level Multi-Discipline Chinese Evaluation Suite for Foundation Modelscited by 694
- 2023CMMLU: Measuring massive multitask language understanding in Chinesecited by 436
- 2024Measuring short-form factuality in large language modelscited by 345
- 2024CRUXEval: A Benchmark for Code Reasoning, Understanding and Executioncited by 294
- 2015Unitary Evolution Recurrent Neural Networkscited by 291
- 2017Parseval Networks: Improving Robustness to Adversarial Examplescited by 288
- 2024Are We Done with MMLU?cited by 178
- 2024Scaling Laws for Fine-Grained Mixture of Expertscited by 166
- 2021Sinkformers: Transformers with Doubly Stochastic Attentioncited by 136
- 2016Full-Capacity Unitary Recurrent Neural Networkscited by 90
- 2017On orthogonality and learning recurrent networks with long term dependenciescited by 82
- 2024Hyper-Connectionscited by 81
- 2025mHC: Manifold-Constrained Hyper-Connectionscited by 76
- 2018Quaternion Recurrent Neural Networkscited by 41
- 2024Chinese SimpleQA: A Chinese Factuality Evaluation for Large Language Modelscited by 39
- 2025Signal and Noise: A Framework for Reducing Uncertainty in Language Model Evaluationcited by 22
- 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
- 2026JPmHC Dynamical Isometry via Orthogonal Hyper-Connectionscited by 4
- 2026Spectral-Sphere-Constrained Hyper-Connectionscited by 3
- 2026go-mHC: Direct Parameterization of Manifold-Constrained Hyper-Connections via Generalized Orthostochastic Matricescited by 3
- 2026xHC: Expanded Hyper-Connectionscited by 3
- 2026Sinkhorn doubly stochastic attention rank decay analysiscited by 2
- 2026TBP-mHC: full expressivity for manifold-constrained hyper connections through transportation polytopescited by 2
- 2026Accelerating Birkhoff Projection for Manifold-Constrained Hyper-Connectionscited by 2
Built on by
Not cited yet.