mlsanityData to 14 Oct 2026

Frac-Connections: Fractional Extension of Hyper-Connections

arXiv 2503.14125 ↗First posted 18 Mar 2025cs.LG cs.AI cs.CLcited by 8

Not on the map. Why?

Abstract (arXiv)

Residual connections are central to modern deep learning architectures, enabling the training of very deep networks by mitigating gradient vanishing. Hyper-Connections recently generalized residual connections by introducing multiple connection strengths at different depths, thereby addressing the seesaw effect between gradient vanishing and representation collapse. However, Hyper-Connections increase memory access costs by expanding the width of hidden states. In this paper, we propose Frac-Connections, a novel approach that divides hidden states into multiple parts rather than expanding their width. Frac-Connections retain partial benefits of Hyper-Connections while reducing memory consumption. To validate their effectiveness, we conduct large-scale experiments on language tasks, with the largest being a 7B MoE model trained on up to 3T tokens, demonstrating that Frac-Connections significantly outperform residual connections.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 22 of its 26 references that are in the map. First posted on arXiv 18 Mar 2025.

Builds on

22 of 26 references.

References · 22

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  3. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  4. 2020Language Models are Few-Shot Learnerscited by 32,419
  5. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  6. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  7. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  8. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  9. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
  10. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  11. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  12. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
10 more
  1. 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,822
  2. 2019Root Mean Square Layer Normalizationcited by 1,480
  3. 2017Crowdsourcing Multiple Choice Science Questionscited by 765
  4. 2016FractalNet: Ultra-Deep Neural Networks without Residualscited by 216
  5. 2020Understanding the Difficulty of Training Transformerscited by 210
  6. 2024Hyper-Connectionscited by 84
  7. 2025Over-Tokenized Transformer: Vocabulary is Generally Worth Scalingcited by 44
  8. 2023ResiDual: Transformer with Dual Residual Connectionscited by 31
  9. 2024Ultra-Sparse Memory Networkcited by 19
  10. 2025Scale-Distribution Decoupling: Enabling Stable and Effective Training of Large Language Modelscited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 6.

8 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026xHC: Expanded Hyper-Connections
  2. 2026ANCRe: Adaptive Neural Connection Reassignment for Efficient Depth Scaling
  3. 2026TEMPER: Tensorized Efficient Manifold-constrained Parameterization for Expressive Residual Routing
  4. 2024Lambda-Skip Connections: the architectural component that prevents Rank Collapse
  5. 2025Optimal Depth of Neural Networks
  6. 2024Residual Connections Harm Generative Representation Learning
  7. 2026Fractional State Space Transition for Long Sequence Modeling
  8. 2019Structural Pruning in Deep Neural Networks: A Small-World Approach