mlsanityData to 7 Oct 2026

Soft-to-Hard Routing in Sparse Mixture-of-Experts Models

arXiv 2605.02124 ↗First posted 4 May 2026cs.LG cs.AI math.PRcited by 1

On the map: Mixture-of-experts → Expert routing strategies

Abstract (arXiv)

Softmax routing approaches hard top-1 routing as the temperature tends to zero, but the limiting passage is singular at router ties. This paper develops a boundary-layer calculus for this soft-to-hard limit in population squared-loss mixture-of-experts regression. For a router with logits ak(x;φ), the relevant local quantity is the top-two margin Delta(x;φ), and the relevant global quantity is the boundary mass mathbbP(Delta(X;φ)≤ w). Under smoothness and transversality assumptions, coarea and tubular-neighborhood estimates show how this mass scales with the slab width; in the binary case the leading coefficient is an explicit surface integral over the routing interface. These geometric estimates give quantitative bounds between the soft objective Lτ and the hard objective L0, including an O(τα) uniform comparison under a margin-tail condition, and yield Gamma-convergence of the soft objectives on compact parameter spaces. The main conclusion is that the zero-temperature approximation is controlled by the probability carried by an O(τ) neighborhood of the routing interfaces, not by temperature alone. After isolating this boundary-layer part of the problem, we record a conditional landscape-transfer theorem from hard to small-temperature soft routing and a reduced two-expert Gaussian calculation illustrating local symmetry breaking. Synthetic diagnostics are included only as controlled checks of the boundary-layer predictions.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Expert routing strategies, one of 12 directions in Mixture-of-experts. Builds on 18 of its 28 references that are in the map. First posted on arXiv 4 May 2026.

Builds on

18 of 28 references.

Closest ancestors · 3

Same direction, newest first

  1. 2024Statistical Advantages of Perturbing Cosine Router in Mixture of Experts23 May
  2. 2022Mixture-of-Experts with Expert Choice Routing18 Feb
  3. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity11 Jan

Other references · 15

  1. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
  2. 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
  3. 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 890
  4. 2015Escaping From Saddle Points --- Online Stochastic Gradient for Tensor Decompositioncited by 241
  5. 2016A Geometric Analysis of Phase Retrievalcited by 92
  6. 2019Convergence Rates for Gaussian Mixtures of Expertscited by 39
  7. 2023Demystifying Softmax Gating Function in Gaussian Mixture of Expertscited by 33
  8. 2023Statistical Perspective of Top-K Sparse Softmax Gating Mixture of Expertscited by 28
  9. 2023A General Theory for Softmax Gating Multinomial Logistic Mixture of Expertscited by 23
  10. 2024On Least Square Estimation in Softmax Gating Mixture of Expertscited by 23
  11. 2024Sigmoid Gating is More Sample Efficient than Softmax Gating in Mixture of Expertscited by 23
  12. 2018Breaking the gridlock in Mixture-of-Experts: Consistent and Efficient Algorithmscited by 13
3 more
  1. 2019Learning in Gated Neural Networkscited by 6
  2. 2025On the Expressive Power of Mixture-of-Experts for Structured Complex Taskscited by 4
  3. 2025Mixture of Experts Provably Detect and Learn the Latent Cluster Structure in Gradient-Based Learningcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026How Sparse Probability Maps Shape Mixture-of-Experts Routing
  2. 2026Evidence for Shared Routing Geometry and Dynamics in Sparse Mixture-of-Experts
  3. 2026Dense Mixture-of-Experts as a Reparameterized Wide FFN: A Granularity Sweep at Fixed Compute
  4. 2025Maximum Score Routing For Mixture-of-Experts
  5. 2026SoftMoE: Soft Differentiable Routing for Mixture-of-Experts in LLMs
  6. 2024Beyond Parameter Count: Implicit Bias in Soft Mixture of Experts
  7. 2026Distributionally Robust Mixture-of-Experts Training
  8. 2026Hierarchical Copula-Gumbel-Top-K Routing: Two-Sided Dependence Control for Frozen Mixture-of-Experts at Fixed Per-Token Routing Laws