mlsanityData to 14 Oct 2026

The Birkhoff Geometry of Manifold-Constrained Hyper-Connections: Two Channels, Vertex Viscosity, and Sinkhorn as a Retraction

arXiv 2610.06653 ↗First posted 5 Oct 2026cs.LG math.OC stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Hyper-connections widen the residual stream of a Transformer to n parallel streams. Their manifold-constrained version (mHC) mixes the streams at each layer with a doubly stochastic matrix, which it computes by Sinkhorn normalization of exponentiated logits. We give a geometric theory of this design on the Birkhoff polytope. First, a doubly stochastic mixer splits the stream into a mean channel, on which mHC is exactly a residual network, and a difference channel, which each layer contracts by its second singular value σ2 ≤ 1 - n minij Hij. Thus the extra width is a fading memory with a horizon of 1/(1-σ2) layers, and among nonnegative mixers only the permutations do not collapse. Second, the Sinkhorn-logit map is a global chart, and its logit gradient is exactly the Fisher-Rao gradient. Thus logit gradient flow follows a squared Fisher-Rao metric, and the straight-through update is exactly entropic mirror descent. Third, under logit gradient flow the logarithm of each entry moves at a rate of at most 4n3|nabla f|_∞ varepsilon, where varepsilon is the distance to the nearest permutation. Thus gradient flow approaches and leaves the vertices only at rate 1/t, but mirror descent moves at an exponential rate. Fourth, the local convergence factor of Sinkhorn is σ22, so a fixed iteration budget limits the horizon. Experiments confirm the predicted rates.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 62 references that are in the map. First posted on arXiv 5 Oct 2026.

Builds on

20 of 62 references.

References · 20

  1. 2026DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligencecited by 1,040
  2. 2025mHC: Manifold-Constrained Hyper-Connectionscited by 88
  3. 2024Hyper-Connectionscited by 84
  4. 2021Softmax Policy Gradient Methods Can Take Exponential Time to Convergecited by 48
  5. 2025MUDDFormer: Breaking Residual Bottlenecks in Transformers via Multiway Dynamic Dense Connectionscited by 31
  6. 2026mHC-lite: You Don't Need 20 Sinkhorn-Knopp Iterationscited by 17
  7. 2025Residual Matrix Transformers: Scaling the Size of the Residual Streamcited by 12
  8. 2026KromHC: Manifold-Constrained Hyper-Connections with Kronecker-Product Residual Matricescited by 11
  9. 2026JPmHC Dynamical Isometry via Orthogonal Hyper-Connectionscited by 5
  10. 2026Ablate and Rescue: A Causal Analysis of Residual Stream Hyper-Connectionscited by 4
  11. 2026Spectral-Sphere-Constrained Hyper-Connectionscited by 4
  12. 2026go-mHC: Direct Parameterization of Manifold-Constrained Hyper-Connections via Generalized Orthostochastic Matricescited by 4
8 more
  1. 2026Analyzing Stream Collapse in Hyper-Connections: From Diagnosis to Mitigationcited by 4
  2. 2026TBP-mHC: full expressivity for manifold-constrained hyper connections through transportation polytopescited by 3
  3. 2026Accelerating Birkhoff Projection for Manifold-Constrained Hyper-Connectionscited by 3
  4. 2026Interior interpretability with attention rollout: contraction and propagation profiles in Transformerscited by 3
  5. 2026How Does mHC Use Its Residual Streams? Selective Routing and Near-Identity Mixingcited by 2
  6. 2026Avoiding Premature Collapse: Adaptive Annealing for Entropy-Regularized Structural Inferencecited by 1
  7. 2026TEMPER: Tensorized Efficient Manifold-constrained Parameterization for Expressive Residual Routingcited by 1
  8. 2026oHC: Orthogonal Hyper-Connections on SO(4) via Quaternionscited by 1

Built on by

Not cited yet.