Pith. sign in

REVIEW 3 cited by

Non-asymptotic oracle inequalities for the Lasso in high-dimensional mixture of experts

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2009.10622 v7 pith:EUHYY4D7 submitted 2020-09-22 math.ST cs.AIcs.LGstat.MEstat.MLstat.TH

classification math.STcs.AIcs.LGstat.MEstat.MLstat.TH
keywords lassomodelstheoreticalexpertsnon-asymptoticpropertiessgmoeestimation
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Dendrograms of Mixing Measures for Softmax-Gated Gaussian Mixture of Experts: Consistency Without Model Sweeps

    stat.ML 2025-10 conditional novelty 6.0 of 10

    For softmax-gated Gaussian mixtures of experts, merging duplicate fitted atoms along a dendrogram and choosing the level by a height-likelihood score consistently recovers the true number of experts at parametric rate...

  2. CompeteSMoE -- Statistically Guaranteed Mixture of Experts Training via Competition

    cs.AI 2025-05 reject novelty 6.0 of 10

    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.

  3. Model Selection for Gaussian-gated Gaussian Mixture of Experts Using Dendrograms of Mixing Measures

    stat.ML 2025-05 conditional novelty 6.0 of 10

    A single overfitted GGMoE fit is converted into a dendrogram of merged experts, and a criterion based on merge heights and likelihood consistently recovers the true number of experts.

Pith tools