CompeteSMoE lets experts compete by neural response, distills the winner policy into a router, and reports better sample efficiency in theory plus small benchmark gains.
Non-asymptotic oracle inequalities for the Lasso in high-dimensional mixture of experts
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We investigate the estimation properties of the mixture of experts (MoE) model in a high-dimensional setting, where the number of predictors is much larger than the sample size, and for which the literature is particularly lacking in theoretical results. We consider the class of softmax-gated Gaussian MoE (SGMoE) models, defined as MoE models with softmax gating functions and Gaussian experts, and focus on the theoretical properties of their $l_1$-regularized estimation via the Lasso. To the best of our knowledge, we are the first to investigate the $l_1$-regularization properties of SGMoE models from a non-asymptotic perspective, under the mildest assumptions, namely the boundedness of the parameter space. We provide a lower bound on the regularization parameter of the Lasso penalty that ensures non-asymptotic theoretical control of the Kullback--Leibler loss of the Lasso estimator for SGMoE models. Finally, we carry out a simulation study to empirically validate our theoretical findings.
citation-role summary
citation-polarity summary
fields
cs.AI 1years
2025 1verdicts
REJECT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
CompeteSMoE -- Statistically Guaranteed Mixture of Experts Training via Competition
CompeteSMoE lets experts compete by neural response, distills the winner policy into a router, and reports better sample efficiency in theory plus small benchmark gains.