Meta Expert: Cross-Layer Expert Sharing for Storage- and Retrieval-Efficient MoE
Ermo Hua, Xiangyu Hong, Baiting Wu, Che Jiang, Haozheng Hou, Yicheng Gu, Hanjing Wang, Qirui Zeng and 6 others
Tsinghua University · Shanghai AI Laboratory
Published October 20, 2026 · on the feed October 23, 2026 · ▲ 47 · arXiv 2610.27598
The abstract
As model parameters scale up, sparsely activated Mixture-of-Experts (MoE) approaches have become essential for model scaling. However, mainstream models currently adopt hierarchical architectures, where experts in different layers, although topologically independent, exhibit substantial similarity and redundancy in their stored content. Compared to the hierarchically arranged Local Expert in existing mainstream models, we hypothesize that inter-layer shared Meta Expert hold greater potential. To this end, we conduct a multi-dimensional empirical comparison between Local and Meta Experts, and find that models incorporating Meta Experts exhibit lower parameter redundancy, together with lower cross-entropy loss and higher downstream task accuracy. With the activated quantity and the expert granularity held fixed, our model matches the performance of Vanilla MoE using only 70--80\% of the experts, substantially improving the model's scaling potential. Beyond removing inter-layer redundancy among experts and improving information storage efficiency, our theoretical analysis further shows that, compared with Local Experts, Meta Experts provide hidden states with more flexible residual pathways, thereby improving information retrieval efficiency.
The Brief
2:09A short podcast summary of the paper. Written and voiced by AI.
Transcript
Meta Expert. Cross-Layer Expert Sharing for Storage- and Retrieval-Efficient MoE. By Ermo Hua and thirteen others, from Tsinghua University and the Shanghai AI Laboratory. Published on the twentieth of October. No code repository is linked to it.
Sparsely activated Mixture-of-Experts models, or MoE, have become essential for scaling. Mainstream designs are hierarchical: each layer holds its own experts. Those experts are topologically independent, yet they show substantial similarity and redundancy in what they store. The authors hypothesize that a Meta Expert, shared between layers, holds more potential than the hierarchically arranged Local Expert, and their comparison supports that hypothesis. If experts in different layers end up storing much the same content, then giving each layer its own copy is spending parameters twice on one thing.
They run a multi-dimensional empirical comparison of Local and Meta Experts. Models that incorporate Meta Experts show lower parameter redundancy, lower cross-entropy loss, and higher downstream task accuracy. With the activated quantity and the expert granularity held fixed, their model matches the performance of Vanilla MoE while using only seventy to eighty percent of the experts, which substantially improves its scaling potential. The comparison is matched on how much is activated, so the saving lies in the total pool of experts, not in a cheaper forward step.
A theoretical analysis adds a second reason. Beyond removing redundancy between layers and storing information more efficiently, Meta Experts give hidden states more flexible residual pathways than Local Experts do, which improves the efficiency of retrieving information as well as storing it.
The headline comparison holds two things constant, the activated quantity and the expert granularity, and the savings are a range rather than one figure: seventy to eighty percent of the experts. The retrieval benefit comes from theoretical analysis, while the storage and accuracy results are empirical. The baseline throughout is Vanilla MoE with local, per-layer experts.
Sharing experts across depth recasts the expert pool as a common store rather than a stack of separate ones, and the claim is that the model loses nothing by it, and gains on both storage and retrieval.
More with an account
Listen to every day’s papers
Daily playlists, deep dives, quests for the papers, and quizzes on their key terms.
Join free