Is Temperature Sample Efficient for Softmax Gaussian Mixture of Experts?
On the map: Mixture-of-experts → MoE theory and gating functions
Abstract (arXiv)
Dense-to-sparse gating mixture of experts (MoE) has recently become an effective alternative to a well-known sparse MoE. Rather than fixing the number of activated experts as in the latter model, which could limit the investigation of potential experts, the former model utilizes the temperature to control the softmax weight distribution and the sparsity of the MoE during training in order to stabilize the expert specialization. Nevertheless, while there are previous attempts to theoretically comprehend the sparse MoE, a comprehensive analysis of the dense-to-sparse gating MoE has remained elusive. Therefore, we aim to explore the impacts of the dense-to-sparse gate on the maximum likelihood estimation under the Gaussian MoE in this paper. We demonstrate that due to interactions between the temperature and other model parameters via some partial differential equations, the convergence rates of parameter estimations are slower than any polynomial rates, and could be as slow as O(1/log(n)), where n denotes the sample size. To address this issue, we propose using a novel activation dense-to-sparse gate, which routes the output of a linear layer to an activation function before delivering them to the softmax function. By imposing linearly independence conditions on the activation function and its derivatives, we show that the parameter estimation rates are significantly improved to polynomial rates. Finally, we conduct a simulation study to empirically validate our theoretical results.
Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). Placed in MoE theory and gating functions, one of 12 directions in Mixture-of-experts. Builds on 20 of its 30 references that are in the map. First posted on arXiv 25 Jan 2024.
Builds on
20 of 30 references.
Closest ancestors · 6
Same direction, newest first
- 2023A General Theory for Softmax Gating Multinomial Logistic Mixture of Experts22 Oct
- 2023Statistical Perspective of Top-K Sparse Softmax Gating Mixture of Experts25 Sep
- 2023Towards Convergence Rates for Parameter Estimation in Gaussian-gated Mixture of Experts12 May
- 2023Demystifying Softmax Gating Function in Gaussian Mixture of Experts5 May
- 2021DSelect-k: Differentiable Selection in the Mixture of Experts with Applications to Multi-Task Learning7 Jun
- 2019Convergence Rates for Gaussian Mixtures of Experts9 Jul
Other references · 14
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2016Gaussian Error Linear Units (GELUs)cited by 3,431
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2020Conformer: Convolution-augmented Transformer for Speech Recognitioncited by 1,838
- 2024Mixtral of Expertscited by 1,785
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
- 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 890
- 2021Scaling Vision with Sparse Mixture of Expertscited by 740
- 2022M3ViT: Mixture-of-Experts Vision Transformer for Efficient Multi-task Learning with Model-Accelerator Co-designcited by 97
- 2021SpeechMoE: Scaling to Large Acoustic Models with Dynamic Routing Mixture of Expertscited by 48
- 2023Brainformers: Trading Simplicity for Efficiencycited by 31
Built on by
Citing papers per year: 2024: 7; 2025: 8.
15 papers.
Sort:
By area:
- 2024FuseMoE: Mixture-of-Experts Transformers for Fleximodal Fusioncited by 67
- 2024Mixture of Experts Meets Prompt-Based Continual Learningcited by 43
- 2024CompeteSMoE -- Effective Training of Sparse Mixture of Experts via Competitioncited by 23
- 2024Sigmoid Gating is More Sample Efficient than Softmax Gating in Mixture of Expertscited by 23
- 2024Statistical Advantages of Perturbing Cosine Router in Mixture of Expertscited by 16
- 2024Revisiting Prefix-tuning: Statistical Benefits of Reparameterization among Promptscited by 15
- 2025RepLoRA: Reparameterizing Low-Rank Adaptation via the Perspective of Mixture of Expertscited by 6
- 2025Revisit Visual Prompt Tuning: The Expressiveness of Prompt Expertscited by 5
- 2025On Zero-Initialized Attention: Optimal Prompt and Gating Factor Estimationcited by 4
- 2025Robust Experts: the Effect of Adversarial Training on CNNs with Sparse Mixture-of-Experts Layerscited by 4
- 2025Convergence Rates for Softmax Gating Mixture of Expertscited by 3
- 2024On Parameter Estimation in Deviated Gaussian Mixture of Expertscited by 2
3 more
- 2025Hypernetwork-Driven Low-Rank Adaptation Across Attention Heads5 Oct 2025
- 2025Robust Experts: the Effect of Adversarial Training on CNNs with Sparse Mixture-of-Experts Layers5 Sep 2025
- 2025Uncertainty-driven Embedding Convolution28 Jul 2025
- 2025On Minimax Estimation of Parameters in Softmax-Contaminated Mixture of Experts24 May 2025
- 2025Convergence Rates for Softmax Gating Mixture of Experts5 Mar 2025
- 2025RepLoRA: Reparameterizing Low-Rank Adaptation via the Perspective of Mixture of Experts5 Feb 2025
- 2025On Zero-Initialized Attention: Optimal Prompt and Gating Factor Estimation5 Feb 2025
- 2025Revisit Visual Prompt Tuning: The Expressiveness of Prompt Experts31 Jan 2025
- 2024Revisiting Prefix-tuning: Statistical Benefits of Reparameterization among Prompts3 Oct 2024
- 2024Statistical Advantages of Perturbing Cosine Router in Mixture of Experts23 May 2024
- 2024Mixture of Experts Meets Prompt-Based Continual Learning23 May 2024
- 2024Sigmoid Gating is More Sample Efficient than Softmax Gating in Mixture of Experts22 May 2024
- 2024FuseMoE: Mixture-of-Experts Transformers for Fleximodal Fusioncited by 67
- 2024Mixture of Experts Meets Prompt-Based Continual Learningcited by 43
- 2024CompeteSMoE -- Effective Training of Sparse Mixture of Experts via Competitioncited by 23
- 2024Sigmoid Gating is More Sample Efficient than Softmax Gating in Mixture of Expertscited by 23
- 2024Statistical Advantages of Perturbing Cosine Router in Mixture of Expertscited by 16
- 2025RepLoRA: Reparameterizing Low-Rank Adaptation via the Perspective of Mixture of Expertscited by 6
- 2025Revisit Visual Prompt Tuning: The Expressiveness of Prompt Expertscited by 5
- 2025Robust Experts: the Effect of Adversarial Training on CNNs with Sparse Mixture-of-Experts Layerscited by 4
- 2025Convergence Rates for Softmax Gating Mixture of Expertscited by 3
- 2024On Parameter Estimation in Deviated Gaussian Mixture of Expertscited by 2
- 2025On Minimax Estimation of Parameters in Softmax-Contaminated Mixture of Expertscited by 1
- 2025Robust Experts: the Effect of Adversarial Training on CNNs with Sparse Mixture-of-Experts Layers5 Sep 2025
- 2025On Minimax Estimation of Parameters in Softmax-Contaminated Mixture of Experts24 May 2025
- 2025Convergence Rates for Softmax Gating Mixture of Experts5 Mar 2025
- 2025RepLoRA: Reparameterizing Low-Rank Adaptation via the Perspective of Mixture of Experts5 Feb 2025
- 2025Revisit Visual Prompt Tuning: The Expressiveness of Prompt Experts31 Jan 2025
- 2024Statistical Advantages of Perturbing Cosine Router in Mixture of Experts23 May 2024
- 2024Mixture of Experts Meets Prompt-Based Continual Learning23 May 2024
- 2024Sigmoid Gating is More Sample Efficient than Softmax Gating in Mixture of Experts22 May 2024
- 2024On Parameter Estimation in Deviated Gaussian Mixture of Experts7 Feb 2024
- 2024FuseMoE: Mixture-of-Experts Transformers for Fleximodal Fusion5 Feb 2024
- 2024CompeteSMoE -- Effective Training of Sparse Mixture of Experts via Competition4 Feb 2024
- 2024Revisiting Prefix-tuning: Statistical Benefits of Reparameterization among Promptscited by 15
- 2025On Zero-Initialized Attention: Optimal Prompt and Gating Factor Estimationcited by 4
- 2025Hypernetwork-Driven Low-Rank Adaptation Across Attention Headscited by 1
- 2025Uncertainty-driven Embedding Convolutioncited by 0
- 2025Hypernetwork-Driven Low-Rank Adaptation Across Attention Heads5 Oct 2025
- 2025Uncertainty-driven Embedding Convolution28 Jul 2025
- 2025On Zero-Initialized Attention: Optimal Prompt and Gating Factor Estimation5 Feb 2025
- 2024Revisiting Prefix-tuning: Statistical Benefits of Reparameterization among Prompts3 Oct 2024
Similar, not cited
Close in wording, no citation either way
- 2026On Bayesian Softmax-Gated Mixture-of-Experts Models
- 2025Dendrograms of Mixing Measures for Softmax-Gated Gaussian Mixture of Experts: Consistency Without Model Sweeps
- 2026Rethinking Multinomial Logistic Mixture of Experts with Sigmoid Gating Function
- 2024On Least Square Estimation in Softmax Gating Mixture of Experts
- 2024Beyond Parameter Count: Implicit Bias in Soft Mixture of Experts
- 2020Non-asymptotic oracle inequalities for the Lasso in high-dimensional mixture of experts
- 2020Fast Deep Mixtures of Gaussian Process Experts
- 2025Model Selection for Gaussian-gated Gaussian Mixture of Experts Using Dendrograms of Mixing Measures