mlsanityData to 14 Oct 2026

MoBE: Mixture-of-Basis-Experts for Compressing MoE-based LLMs

arXiv 2508.05257 ↗First posted 7 Aug 2025cs.LGcited by 9

On the map: Mixture-of-experts → MoE large language models

Abstract (arXiv)

The Mixture-of-Experts (MoE) architecture has become a predominant paradigm for scaling large language models (LLMs). Despite offering strong performance and computational efficiency, large MoE-based LLMs like DeepSeek-V3-0324 and Kimi-K2-Instruct present serious challenges due to substantial memory requirements in deployment. While recent works have explored MoE compression to address this issue, existing methods often suffer from considerable accuracy drops (e.g., 7-14% relatively) even at modest compression rates. This paper introduces a novel Mixture-of-Basis-Experts (MoBE) method that achieves model compression while incurring minimal accuracy drops. Specifically, each up/gate matrix in an expert is decomposed via a rank decomposition as W = AB, where matrix A is unique to each expert. The relatively larger matrix B is further re-parameterized as a linear combination of basis matrices {Bi} shared across all experts within a given MoE layer. The factorization is learned by minimizing the reconstruction error relative to the original weight matrices. Experiments demonstrate that MoBE achieves notably lower accuracy drops compared to prior works. For instance, MoBE can reduce the parameter counts of Qwen3-235B-A22B-2507, DeepSeek-V3-0324 (671B) and Kimi-K2-Instruct (1T) by 24%-30% with only 1%-2% accuracy drop (about 2% drops when measured relatively).

Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Placed in MoE large language models, one of 12 directions in Mixture-of-experts. Builds on 32 of its 45 references that are in the map. First posted on arXiv 7 Aug 2025.

Builds on

32 of 45 references.

Closest ancestors · 12

Same direction, newest first

  1. 2025Qwen3 Technical Report14 May
  2. 2025MoLAE: Mixture of Latent Experts for Parameter-Efficient Language Models29 Mar
  3. 2025Every FLOP Counts: Scaling a 300B Mixture-of-Experts LING LLM without Premium GPUs7 Mar
  4. 2025Delta Decompression for MoE-based LLMs Compression24 Feb
  5. 2024MoE-I2: Compressing Mixture of Experts Models through Inter-Expert Pruning and Intra-Expert Low-Rank Decomposition1 Nov
  6. 2024MoE-Pruner: Pruning Mixture-of-Experts Large Language Model using the Hints from Its Router15 Oct
  7. 2024Retraining-Free Merging of Sparse MoE via Hierarchical Clustering11 Oct
  8. 2024STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruning10 Sep
  9. 2024Diversifying the Expert Knowledge for Task-Agnostic Pruning in Sparse Mixture-of-Experts12 Jul
  10. 2024Efficient Expert Pruning for Sparse Mixture-of-Experts Language Models: Enhancing Performance and Reducing Inference Costs1 Jul
  11. 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model7 May
  12. 2024Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Models22 Feb

Other references · 20

  1. 2017Attention Is All You Needcited by 60,361
  2. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  3. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  4. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  5. 2020Scaling Laws for Neural Language Modelscited by 6,586
  6. 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
  7. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  8. 2021Program Synthesis with Large Language Modelscited by 3,637
  9. 2016Gaussian Error Linear Units (GELUs)cited by 3,502
  10. 2022Training Compute-Optimal Large Language Modelscited by 3,019
  11. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
  12. 2022Locating and Editing Factual Associations in GPTcited by 2,691
8 more
  1. 2022Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language modelscited by 1,998
  2. 2020GLU Variants Improve Transformercited by 1,804
  3. 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,336
  4. 2023Instruction-Following Evaluation for Large Language Modelscited by 1,228
  5. 2023C-Eval: A Multi-Level Multi-Discipline Chinese Evaluation Suite for Foundation Modelscited by 708
  6. 2023CMMLU: Measuring massive multitask language understanding in Chinesecited by 449
  7. 2022MultiPL-E: A Scalable and Extensible Approach to Benchmarking Neural Code Generationcited by 136
  8. 2023Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policycited by 108

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 9.

9 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Shared Low-rank Basis Factorization for Data-free Mixture-of-Experts Compression
  2. 2024Towards Efficient Mixture of Experts: A Holistic Study of Compression Techniques
  3. 2026Pruning and Distilling Mixture-of-Experts into Dense Language Models
  4. 2024Mixture Compressor for Mixture-of-Experts LLMs Gains More
  5. 2025PuzzleMoE: Efficient Compression of Large Mixture-of-Experts Models via Sparse Expert Merging and Bit-packed inference
  6. 2025SlimMoE: Structured Compression of Large MoE Models via Expert Slimming and Distillation
  7. 2024QuantMoE-Bench: Examining Post-Training Quantization for Mixture-of-Experts
  8. 2025Grove MoE: Towards Efficient and Superior MoE LLMs with Adjugate Experts