without constraints, the gate makes tokens pile onto a few experts, causing load imbalance and routing collapse (a few experts absorb nearly all signal). Mitigations: the auxiliary balance loss
Laux=α⋅N∑i=1NfiPi, where
fi is expert
i's fraction of tokens (actual utilization) and
Pi its mean routing probability — minimizing the product encourages uniform routing; plus a per-expert capacity cap (capacity factor: max tokens per expert = capacity factor × average load), where overflow tokens are dropped or routed through a residual path (recompute/residual connection).