mlsanityData to 7 Oct 2026

Fast Model Selection and Stable Optimization for Softmax-Gated Multinomial-Logistic Mixture of Experts Models

arXiv 2602.07997 ↗First posted 8 Feb 2026stat.ML cs.LG math.STcited by 0

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

Abstract (arXiv)

Mixture-of-Experts (MoE) architectures combine specialized predictors through a learned gate and are effective across regression and classification, but for classification with softmax multinomial-logistic gating, rigorous guarantees for stable maximum-likelihood training and principled model selection remain limited. We address both issues in the full-data (batch) regime. First, we derive a batch minorization-maximization (MM) algorithm for softmax-gated multinomial-logistic MoE using an explicit quadratic minorizer, yielding coordinate-wise closed-form updates that guarantee monotone ascent of the objective and global convergence to a stationary point (in the standard MM sense), avoiding approximate M-steps common in EM-type implementations. Second, we prove finite-sample rates for conditional density estimation and parameter recovery, and we adapt dendrograms of mixing measures to the classification setting to obtain a sweep-free selector of the number of experts that achieves near-parametric optimal rates after merging redundant fitted atoms. Experiments on biological protein--protein interaction prediction validate the full pipeline, delivering improved accuracy and better-calibrated probabilities than strong statistical and machine-learning baselines.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in MoE theory and gating functions, one of 12 directions in Mixture-of-experts. Builds on 29 of its 98 references that are in the map. First posted on arXiv 8 Feb 2026.

Builds on

29 of 98 references.

Closest ancestors · 9

Same direction, newest first

  1. 2025Dendrograms of Mixing Measures for Softmax-Gated Gaussian Mixture of Experts: Consistency Without Model Sweeps14 Oct
  2. 2025Model Selection for Gaussian-gated Gaussian Mixture of Experts Using Dendrograms of Mixing Measures19 May
  3. 2023A General Theory for Softmax Gating Multinomial Logistic Mixture of Experts22 Oct
  4. 2023Towards Convergence Rates for Parameter Estimation in Gaussian-gated Mixture of Experts12 May
  5. 2022Functional mixture-of-experts for classification28 Feb
  6. 2021A non-asymptotic approach for model selection via penalization in high-dimensional mixture of experts models6 Apr
  7. 2020Non-asymptotic oracle inequalities for the Lasso in high-dimensional mixture of experts22 Sep
  8. 2019Regularized Estimation and Feature Selection in Mixtures of Generalized Linear Experts14 Jul
  9. 2019Convergence Rates for Gaussian Mixtures of Experts9 Jul

Other references · 20

  1. 2024A Survey on Mixture of Experts in Large Language Modelscited by 233
  2. 2013Deep Learning of Representations: Looking Forwardcited by 84
  3. 2019Non-asymptotic Analysis of Biased Stochastic Approximation Schemecited by 45
  4. 2014Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learningcited by 35
  5. 2013Stochastic Majorization-Minimization Algorithms for Large-Scale Optimizationcited by 28
  6. 2016A Universal Approximation Theorem for Mixture of Experts Modelscited by 17
  7. 2019On the Global Convergence of (Fast) Incremental Expectation Maximization Methodscited by 12
  8. 2023Stochastic Approximation Beyond Gradient for Signal Processing and Machine Learningcited by 10
  9. 2016Singularity structures and impacts on parameter estimation in finite mixtures of distributionscited by 9
  10. 2020Geom-SPIDER-EM: Faster Variance Reduced Stochastic Expectation Maximization for Nonconvex Finite-Sum Optimizationcited by 7
  11. 2020Fast Incremental Expectation Maximization for finite-sum optimization: nonasymptotic convergencecited by 7
  12. 2022Strong identifiability and parameter learning in regression with heterogeneous responsecited by 6
8 more
  1. 2019Properties of the Stochastic Approximation EM Algorithm with Mini-batch Samplingcited by 5
  2. 2021Non-asymptotic model selection in block-diagonal mixture of polynomial experts modelscited by 5
  3. 2021Nonconvex Optimization via MM Algorithms: Convergence Theorycited by 5
  4. 2021The perturbed prox-preconditioned spider algorithm: non-asymptotic convergence boundscited by 4
  5. 2023Stochastic Variable Metric Proximal Gradient with variance reduction for non-convex composite optimizationcited by 3
  6. 2024Risk Bounds for Mixture Density Estimation on Compact Domains via the h-Lifted Kullback--Leibler Divergencecited by 3
  7. 2021Identifying Brexit voting patterns in the British House of Commons: an analysis based on Bayesian mixture models with flexible concomitant covariate effectscited by 2
  8. 2025A Unified Framework for Variable Selection in Model-Based Clustering with Missing Not at Randomcited by 2

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Rethinking Multinomial Logistic Mixture of Experts with Sigmoid Gating Function
  2. 2026On Bayesian Softmax-Gated Mixture-of-Experts Models
  3. 2025Convergence Rates for Softmax Gating Mixture of Experts
  4. 2024On Least Square Estimation in Softmax Gating Mixture of Experts
  5. 2026Improving Minimax Estimation Rates for Contaminated Mixture of Multinomial Logistic Experts via Expert Heterogeneity
  6. 2023Revisiting Single-gated Mixtures of Experts
  7. 2024Sigmoid Gating is More Sample Efficient than Softmax Gating in Mixture of Experts
  8. 2026Redundancy Meets Synergy: Dependency-aware Expert Selection for MoE via Submodular Optimization