mlsanityData to 7 Oct 2026

JPmHC Dynamical Isometry via Orthogonal Hyper-Connections

arXiv 2602.18308 ↗First posted 20 Feb 2026cs.LG cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

Recent advances in deep learning, exemplified by Hyper-Connections (HC), have expanded the residual connection paradigm by introducing wider residual streams and diverse connectivity patterns. While these innovations yield significant performance gains, they compromise the identity mapping property of residual connections, leading to training instability, limited scalability, and increased memory overhead. To address these challenges, we propose JPmHC (Jacobian-spectrum Preserving manifold-constrained Hyper-Connections), a framework that replaces identity skips with a trainable linear mixer acting on n parallel streams while explicitly controlling gradient conditioning. By constraining the mixer M on operator-norm-bounded manifolds (e.g., bistochastic, Stiefel, Grassmann), JPmHC prevents gradient pathologies and enhances stability. JPmHC introduces three key contributions: (i) a free-probability analysis that predicts Jacobian spectra for structured skips, providing actionable design rules for mixer selection; (ii) memory-efficient implicit differentiation for fixed-point projections, reducing activation memory and synchronization overhead; and (iii) a Stiefel-constrained mixer via Cayley transforms, ensuring orthogonality without post-hoc normalization. Empirical evaluations on ARC-AGI demonstrate that JPmHC achieves faster convergence, higher accuracy, and lower computational cost compared to bistochastic baselines, with a rank-p Grassmannian variant tracking between the two -- consistent with the spectral theory predictions. As a flexible and scalable extension of HC, JPmHC advances spectrum-aware, stable, and efficient deep learning, offering insights into topological architecture design and foundational model evolution. newline newline

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 23 of its 76 references that are in the map. First posted on arXiv 20 Feb 2026.

Builds on

23 of 76 references.

References · 23

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  3. 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
  4. 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
  5. 2015Unitary Evolution Recurrent Neural Networkscited by 291
  6. 2016Deep Information Propagationcited by 194
  7. 2022DeepNet: Scaling Transformers to 1,000 Layerscited by 176
  8. 2025ARC-AGI-2: A New Challenge for Frontier AI Reasoning Systemscited by 171
  9. 2025Hierarchical Reasoning Modelcited by 167
  10. 2017Resurrecting the sigmoid in deep learning through dynamical isometry: theory and practicecited by 132
  11. 2023Noise Is Not the Main Factor Behind the Gap Between SGD and Adam on Transformers, but Sign Descent Might Becited by 114
  12. 2016Full-Capacity Unitary Recurrent Neural Networkscited by 90
11 more
  1. 2017Mean Field Residual Networks: On the Edge of Chaoscited by 83
  2. 2024Hyper-Connectionscited by 81
  3. 2020Efficient Riemannian Optimization on the Stiefel Manifold via the Cayley Transformcited by 79
  4. 2019Trivializations for Gradient-Based Optimization on Manifoldscited by 78
  5. 2025mHC: Manifold-Constrained Hyper-Connectionscited by 76
  6. 2020Hutch++: Optimal Stochastic Trace Estimationcited by 62
  7. 2020Tensor Programs III: Neural Matrix Lawscited by 47
  8. 2022A Unified Framework for Implicit Sinkhorn Differentiationcited by 28
  9. 2018Dynamical Isometry is Achieved in Residual Networks in a Universal Way for any Activation Functioncited by 22
  10. 2023Infeasible Deterministic, Stochastic, and Variance-Reduction Algorithms for Optimization under Orthogonality Constraintscited by 18
  11. 2026KromHC: Manifold-Constrained Hyper-Connections with Kronecker-Product Residual Matricescited by 10

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 4.

4 papers.