Skip to content

Structure Aware Neural Architecture Search for Mixture of Experts

Aug 2026 · 0 citations · 48 references
Computer Science

TL;DR

An architecture search framework that makes the alignment between experts and the structure of the data an explicit search variable and ensures that the assignment of data clusters to experts is optimised jointly with the per-expert architectures is proposed.

Abstract

Neural Architecture Search (NAS) has so far rarely been applied to Mixture-of-Experts (MoE) models, and existing MoE designs leave the alignment between experts and the structure of the data to emerge on its own. We propose an architecture search framework that makes this alignment an explicit search variable: the assignment of data clusters to experts is optimised jointly with the per-expert architectures. We cast the joint problem as a cluster-aware likelihood maximisation, show that it coincides with the incomplete-data maximum likelihood of a latent-variable mixture, and solve it by a generalised Expectation-Maximisation procedure whose otherwise intractable expert-quality term is supplied by an adaptively refined surrogate. We prove that the iterates converge whenever the surrogate errors are summable, and that at every limit point no candidate the search produces improves the true objective. On a heterogeneous image-classification mixture the method recovers the underlying domain partition on 95% of clusters without ever observing domain labels, and on that benchmark and a four-domain time-series forecasting one alike it outperforms the MoE and NAS baselines that likewise use no label information.

View source

Similar papers

Preprint Aug 2026

A Heterogeneous Mixture of Experts Framework for Interpretable Machine Learning

The proposed approach combines interpretability, adaptive inductive bias selection, and probabilistic coherence within a unified mixture-of-experts framework to achieve interpretable expert assignments while achieving predictive performance competitive with homogeneous MoDT and Random Forests.

Soham Chatterjee, Rwitobroto Dey, Smarajit Bose · 0 citations
#machine learning Preprint Sep 2026

Towards a Statistical Understanding of Mixture-of-Experts

This paper derives oracle risk bounds for learning dense and sparse routing with evolving experts, separating approximation, expert-learning, and router-estimation errors, and characterize how sparse Top-K routing can retain the benefits of localized aggregation while controlling per-input computation.

Si-Yuan He, Bo-Kai Yang, Jie Hu et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Distribution-Consistent Inference for Dynamic Sparse Mixture-of-Experts

Layer-wise Distribution Alignment (LDA), a lightweight inference-time correction that uses layer-wise calibration statistics to align reduced-routing representations with the default configuration, is proposed, recovering much of the performance lost induced by the distributional shift under reduced routing while prese...

Dohyeon Kim, Bedionita Soro, Sung Ju Hwang · 0 citations
Preprint Oct 2026

Bayesian Optimization in Sequence-to-Architecture Latent Space for Zero-Shot NAS

Zero-shot Neural Architecture Search removes the prohibitive cost of traditional NAS, but its search process is typically based on the evolutionary algorithm (EA); lacking an explicit model of the objective, it often resorts to a near-random search through mutation. Bayesian Optimization offers a principled alternative...

Ondrej Týbl, Lukás Neumann · 0 citations
#machine learning Preprint Oct 2026

Prediction-powered Neural Architecture Search

Evaluating candidate architectures in neural architecture search (NAS) faces an inherent trade-off: on the one hand, reliable performance labels are limited because training and evaluating architectures is costly; on the other hand, zero-cost proxies (ZCPs) are cheap to compute at large scale but can be noisy. Yet, how...

Pascal Janetzky, Yu-Xin Wang, Michael Klar et al. · 0 citations
#machine learning Preprint Sep 2026

A Distributional Optimisation Perspective on Combining Models in Deep Learning

Combining predictions from different models can improve performance at machine learning tasks, but the training of the individual models and the rule used to combine them are typically chosen separately, and by ad hoc means. Recent advances in distributional optimisation (i.e. where the optimisation occurs over the set...

Cong-Ye Wang, Yan-Kai Lin, Zhe-Yang Shen et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.