mlsanityData to 14 Oct 2026

Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging

arXiv 2506.23266 ↗First posted 29 Jun 2025cs.LGcited by 28

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

Abstract (arXiv)

Mixture of Experts (MoE) LLMs face significant obstacles due to their massive parameter scale, which imposes memory, storage, and deployment challenges. Although recent expert merging methods promise greater efficiency by consolidating multiple experts, they are fundamentally hindered by parameter conflicts arising from expert specialization. In this paper, we present Sub-MoE, a novel MoE compression framework via Subspace Expert Merging. Our key insight is to perform joint Singular Value Decomposition (SVD) on concatenated expert weights, reducing conflicting parameters by extracting shared U-matrices while enabling effective merging of the expert-specific V components. Specifically, Sub-MoE consists of two innovative phases: (1) Adaptive Expert Clustering, which groups functionally coherent experts via K-means clustering based on cosine similarity of expert outputs; and (2) Subspace Expert Merging, which first enforces Experts Union Decomposition to derive the shared U-matrix across experts in the same group, then pursues frequency-based merging for individual V-matrices, and finalizes expert reconstruction using the merged V-matrix. In this way, we align and fuse experts in a shared subspace, and can be extended with intra-expert compression for further inference optimization. Extensive experiments on Mixtral, DeepSeek, and Qwen-1.5|3 MoE LLMs demonstrate that our Sub-MoE significantly outperforms existing expert pruning and merging methods. Notably, our Sub-MoE maintains 96%|86% of original performance with 25%|50% expert reduction on Mixtral-8x7B in zero-shot benchmarks. Code will be released at https://github.com/lliai/MoERazor.

Key facts. Cited by 28 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 31 of its 46 references that are in the map. First posted on arXiv 29 Jun 2025.

Builds on

31 of 46 references.

Closest ancestors · 12

Same direction, newest first

  1. 2025Delta Decompression for MoE-based LLMs Compression24 Feb
  2. 2024Qwen2.5 Technical Report19 Dec
  3. 2024MoE-I2: Compressing Mixture of Experts Models through Inter-Expert Pruning and Intra-Expert Low-Rank Decomposition1 Nov
  4. 2024MoE-Pruner: Pruning Mixture-of-Experts Large Language Model using the Hints from Its Router15 Oct
  5. 2024Mixture Compressor for Mixture-of-Experts LLMs Gains More8 Oct
  6. 2024STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruning10 Sep
  7. 2024Revisiting SMoE Language Models by Evaluating Inefficiencies with Task Specific Expert Pruning2 Sep
  8. 2024Efficient Expert Pruning for Sparse Mixture-of-Experts Language Models: Enhancing Performance and Reducing Inference Costs1 Jul
  9. 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model7 May
  10. 2024Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Models22 Feb
  11. 2024HyperMoE: Towards Better Mixture of Experts via Transferring Among Experts20 Feb
  12. 2024DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Models11 Jan

Other references · 19

  1. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  2. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  3. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  4. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  5. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
  6. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
  7. 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 243
  8. 2019Model Fusion via Optimal Transportcited by 219
  9. 2023PowerInfer: Fast Large Language Model Serving with a Consumer-grade GPUcited by 217
  10. 2022Branch-Train-Merge: Embarrassingly Parallel Training of Expert Language Modelscited by 191
  11. 2023Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policycited by 108
  12. 2020Optimizing Mode Connectivity via Neuron Alignmentcited by 86
7 more
  1. 2024SEER-MoE: Sparse Expert Efficiency through Regularization for Mixture-of-Expertscited by 40
  2. 2024Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Modelscited by 40
  3. 2024Shortcut-connected Expert Parallelism for Accelerating Mixture-of-Expertscited by 32
  4. 2024STBLLM: Breaking the 1-Bit Barrier with Structured Binary LLMscited by 31
  5. 2024Lancet: Accelerating Mixture-of-Experts Training via Whole Graph Computation-Communication Overlappingcited by 22
  6. 2024Pruning via Merging: Compressing LLMs via Manifold Alignment Based Layer Mergingcited by 19
  7. 2024LIBMoE: A Library for comprehensive benchmarking Mixture of Experts in Large Language Modelscited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 5; 2026: 23.

28 papers.

Sort:

By area:

  1. 2026REAM: Merging Improves Pruning of Experts in LLMscited by 10
  2. 2025PuzzleMoE: Efficient Compression of Large Mixture-of-Experts Models via Sparse Expert Merging and Bit-packed inferencecited by 9
  3. 2026EvoESAP: Non-Uniform Expert Pruning for Sparse MoEcited by 9
  4. 2026KBVQ-MoE: KLT-guided SVD with Bias-Corrected Vector Quantization for MoE Large Language Modelscited by 8
  5. 2025CAMERA: Multi-Matrix Joint Compression for MoE Models via Micro-Expert Redundancy Analysiscited by 7
  6. 2025MoE Pathfinder: Trajectory-driven Expert Pruningcited by 7
  7. 2026Effective MoE-based LLM Compression by Exploiting Heterogeneous Inter-Group Experts Routing Frequency and Information Densitycited by 7
  8. 2026IndexMem: Learned KV-Cache Eviction with Latent Memory for Long-Context LLM Inferencecited by 7
  9. 2026How to Score Experts for One-Shot MoE Expert Pruning: A Unified Formulation and Selection Principlecited by 6
  10. 2025HEAPr: Hessian-based Efficient Atomic Expert Pruning in Output Spacecited by 3
  11. 2025Breaking the MoE LLM Trilemma: Dynamic Expert Clustering with Structured Compressioncited by 3
  12. 2026Bit-by-Bit: Progressive QAT Strategy with Outlier Channel Splitting for Stable Low-Bit LLMscited by 3
16 more
  1. 2026dMoE: dLLMs with Learnable Block Expertscited by 2
  2. 2026UniMoMo: Expert Merging-Based MoE Acceleration for Large Recommendation Modelscited by 2
  3. 2026ExFold: Unified Expert Folding for Training-Free MoE Prefill-Decode Accelerationcited by 2
  4. 2026Mixture-of-Experts as Soft Clustering: A Dual Jacobian-PCA Spectral Geometry Perspectivecited by 1
  5. 2026Concatenated Matrix SVD: Compression Bounds, Incremental Approximation, and Error-Constrained Clusteringcited by 1
  6. 2026Pruning and Distilling Mixture-of-Experts into Dense Language Modelscited by 1
  7. 2026Beyond Geometric Complementarity: Coherent Overlap in Sparse Mixture-of-Experts Routingcited by 1
  8. 2026Beyond Global Routing Aggregation: Phase-Aware Expert Merging for MoE Vision-Language Modelscited by 1
  9. 2026Geometric Asymmetry in MoE Specialization: Functional Decorrelation and Representational Overlapcited by 0
  10. 2026Attribution-Guided and Coverage-Maximized Pruning for Structural MoE Compressioncited by 0
  11. 2026Beyond Retraining-Free MoE Compression: A Cost-Normalized Study of Post-Compression Adjustmentcited by 0
  12. 2026SSD-LLaMA: SSD-Native Inference for Trillion-Parameter MoE at 1+ Token/s on a Consumer PCcited by 0
  13. 2026OMP-MoE: Efficient Expert Pruning for Mixture-of-Experts LLMs via Orthogonal Matching Pursuitcited by 0
  14. 2026EAT: Expert Account Tracker for Efficient MoE Inferencecited by 0
  15. 2026SPEAR: A Spectral-Disentangled MoE Neural Operator with Knowledge-Guided Expert Aggregation for Large-Scale PDE Pretrainingcited by 0
  16. 2026SLEM: Spectrum-Aware Latent Expert Mergingcited by 0

Similar, not cited

Close in wording, no citation either way

  1. 2025MergeMoE: Efficient Compression of MoE Models via Expert Output Merging
  2. 2026Shared Low-rank Basis Factorization for Data-free Mixture-of-Experts Compression
  3. 2025MoBE: Mixture-of-Basis-Experts for Compressing MoE-based LLMs
  4. 2026Shape Mutating Expert Compression:LorExperts and BTExperts
  5. 2026Benchmarking Composable Compression Techniques in Mixture-of-Experts LLMs
  6. 2026Residual Sparsification via Output Importance for Compressing Mixture-of-Experts LLMs
  7. 2024Towards Efficient Mixture of Experts: A Holistic Study of Compression Techniques
  8. 2025DeRS: Towards Extremely Efficient Upcycled Mixture-of-Experts Models