mlsanityData to 7 Oct 2026

Breaking the gridlock in Mixture-of-Experts: Consistent and Efficient Algorithms

arXiv 1802.07417 ↗First posted 21 Feb 2018cs.LGcited by 13

On the map: Mixture-of-experts → MoE theory and gating functions

Abstract (arXiv)

Mixture-of-Experts (MoE) is a widely popular model for ensemble learning and is a basic building block of highly successful modern neural networks as well as a component in Gated Recurrent Units (GRU) and Attention networks. However, present algorithms for learning MoE including the EM algorithm, and gradient descent are known to get stuck in local optima. From a theoretical viewpoint, finding an efficient and provably consistent algorithm to learn the parameters remains a long standing open problem for more than two decades. In this paper, we introduce the first algorithm that learns the true parameters of a MoE model for a wide class of non-linearities with global consistency guarantees. While existing algorithms jointly or iteratively estimate the expert parameters and the gating paramters in the MoE, we propose a novel algorithm that breaks the deadlock and can directly estimate the expert parameters by sensing its echo in a carefully designed cross-moment tensor between the inputs and the output. Once the experts are known, the recovery of gating parameters still requires an EM algorithm; however, we show that the EM algorithm for this simplified problem, unlike the joint EM algorithm, converges to the true parameters. We empirically validate our algorithm on both the synthetic and real data sets in a variety of settings, and show superior performance to standard baselines.

Key facts. Cited by 13 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 27 of its 55 references that are in the map. First posted on arXiv 21 Feb 2018.

Builds on

27 of 55 references.

References · 27

  1. 2017Attention Is All You Needcited by 59,932
  2. 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,530
  3. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
  4. 2014Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modelingcited by 2,341
  5. 2015Effective Approaches to Attention-based Neural Machine Translationcited by 1,024
  6. 2017Convergence Analysis of Two-layer Neural Networks with ReLU Activationcited by 137
  7. 2014Statistical guarantees for the EM algorithm: From population to sample-based analysiscited by 131
  8. 2017Spurious Local Minima are Common in Two-Layer ReLU Neural Networkscited by 104
  9. 2017Recovery Guarantees for One-hidden-layer Neural Networkscited by 94
  10. 2017Learning One-hidden-layer Neural Networks with Landscape Designcited by 79
  11. 2017Hard Mixtures of Experts for Large Scale Weakly Supervised Visioncited by 67
  12. 2014Spectral Methods meet EM: A Provably Optimal Algorithm for Crowdsourcingcited by 63
15 more
  1. 2016Ten Steps of EM Suffice for Mixtures of Two Gaussianscited by 40
  2. 2017Gradient Descent Learns One-hidden-layer CNN: Don't be Afraid of Spurious Local Minimacited by 40
  3. 2015Generative Image Modeling Using Spatial LSTMscited by 35
  4. 2016Local Maxima in the Likelihood of Gaussian Mixture Models: Structural Results and Algorithmic Consequencescited by 34
  5. 2016Global analysis of Expectation Maximization for mixtures of two Gaussianscited by 31
  6. 2016Solving a Mixture of Many Random Linear Equations by Tensor Decomposition and Alternating Minimizationcited by 26
  7. 2013Spectral Experts for Estimating Mixtures of Linear Regressionscited by 22
  8. 2016Polynomial-time Tensor Decompositions with Sum-of-Squarescited by 22
  9. 2014Guaranteed Non-Orthogonal Tensor Decomposition via Alternating Rank-1 Updatescited by 21
  10. 2014Hierarchical Mixture-of-Experts Model for Large-Scale Gaussian Process Regressioncited by 15
  11. 2013Learning Mixtures of Linear Classifierscited by 8
  12. 2013Learning Mixtures of Discrete Product Distributions using Spectral Decompositionscited by 7
  13. 2014Score Function Features for Discriminative Learning: Matrix and Tensor Frameworkcited by 7
  14. 2016LSTM-based Mixture-of-Experts for Knowledge-Aware Dialoguescited by 6
  15. 2014Provable Tensor Methods for Learning Mixtures of Generalized Linear Modelscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2019: 1; 2020: 0; 2021: 2; 2022: 1; 2023: 3; 2024: 4; 2025: 1; 2026: 1.

13 papers.

Sort:

By area:

Similar, not cited

Close in wording, no citation either way

  1. 2023Towards Convergence Rates for Parameter Estimation in Gaussian-gated Mixture of Experts
  2. 2024Generalization Error Analysis for Sparse Mixture-of-Experts: A Preliminary Study
  3. 2023Pushing Mixture of Experts to the Limit: Extremely Parameter Efficient MoE for Instruction Tuning
  4. 2023Improving Expert Specialization in Mixture of Experts
  5. 2023Revisiting Single-gated Mixtures of Experts
  6. 2025Convergence Rates for Softmax Gating Mixture of Experts
  7. 2026∞-MoE: Generalizing Mixture of Experts to Infinite Experts
  8. 2021Sparse MoEs meet Efficient Ensembles