English

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

Machine Learning 2026-05-26 v2 Artificial Intelligence Probability

Abstract

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;ϕ)a_k(x;\phi), the relevant local quantity is the top-two margin Δ(x;ϕ)\Delta(x;\phi), and the relevant global quantity is the boundary mass P(Δ(X;ϕ)w)\mathbb{P}(\Delta(X;\phi)\le 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τL_\tau and the hard objective L0L_0, including an O(τα)O(\tau^\alpha) 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(τ)O(\tau) 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.

Keywords

Cite

@article{arxiv.2605.02124,
  title  = {Soft-to-Hard Routing in Sparse Mixture-of-Experts Models},
  author = {Reza Rastegar},
  journal= {arXiv preprint arXiv:2605.02124},
  year   = {2026}
}