mlsanityData to 14 Oct 2026

Attribution-Guided and Coverage-Maximized Pruning for Structural MoE Compression

arXiv 2606.18304 ↗First posted 16 Jun 2026cs.LG cs.AIcited by 0

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

Abstract (arXiv)

Mixture-of-Experts (MoE) models scale compute efficiently, yet remain expensive to deploy due to their substantial memory footprint and inference overhead. Prior compression methods mainly operate at the expert level, either removing entire experts or ranking experts by coarse-grained importance scores. However, such expert-wise decisions are often too coarse to capture fine-grained redundancy, leading to misallocated pruning budgets and limited compression. To address this problem, we observe that information within MoE experts is highly concentrated in a small subset of channels, leaving substantial redundancy even in experts deemed important. Based on this observation, we propose a structural pruning framework tailored for MoE models. Our method reformulates prune-ratio allocation as a channel-score coverage maximization problem and solves it efficiently using an attribution-based approximation. Experiments on DeepSeek and Qwen MoE models show that our method preserves model accuracy under 50% or 25% structured pruning when combined with 4-bit quantization. On Qwen3-30B-A3B, our approach reduces memory footprint by 5.27× and consistently outperforms state-of-the-art baselines across diverse benchmarks.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in MoE large language models, one of 12 directions in Mixture-of-experts. Builds on 43 of its 52 references that are in the map. First posted on arXiv 16 Jun 2026.

Builds on

43 of 52 references.

Closest ancestors · 18

Same direction, newest first

  1. 2025PuzzleMoE: Efficient Compression of Large Mixture-of-Experts Models via Sparse Expert Merging and Bit-packed inference6 Nov
  2. 2025Collaborative Compression for Large-Scale MoE Deployment on Edge30 Sep
  3. 2025DiEP: Adaptive Mixture-of-Experts Compression through Differentiable Expert Pruning19 Sep
  4. 2025EAC-MoE: Expert-Selection Aware Compressor for Mixture-of-Experts Large Language Models3 Aug
  5. 2025Sub-MoE: Efficient Mixture-of-Expert LLMs Compression via Subspace Expert Merging29 Jun
  6. 2025Cluster-Driven Expert Pruning for Mixture-of-Experts Large Language Models10 Apr
  7. 2024Condense, Don't Just Prune: Enhancing Efficiency and Performance in MoE Layer Pruning26 Nov
  8. 2024MoE-I2: Compressing Mixture of Experts Models through Inter-Expert Pruning and Intra-Expert Low-Rank Decomposition1 Nov
  9. 2024MoE-Pruner: Pruning Mixture-of-Experts Large Language Model using the Hints from Its Router15 Oct
  10. 2024Mixture Compressor for Mixture-of-Experts LLMs Gains More8 Oct
  11. 2024STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruning10 Sep
  12. 2024Diversifying the Expert Knowledge for Task-Agnostic Pruning in Sparse Mixture-of-Experts12 Jul
6 more
  1. 2024Efficient Expert Pruning for Sparse Mixture-of-Experts Language Models: Enhancing Performance and Reducing Inference Costs1 Jul
  2. 2024Towards Efficient Mixture of Experts: A Holistic Study of Compression Techniques4 Jun
  3. 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model7 May
  4. 2024Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Models22 Feb
  5. 2024OpenMoE: An Early Effort on Open Mixture-of-Experts Language Models29 Jan
  6. 2024Mixtral of Experts8 Jan

Other references · 25

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  2. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  3. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  5. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  6. 2023Let's Verify Step by Stepcited by 3,789
  7. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
  8. 2023GPQA: A Graduate-Level Google-Proof Q&A Benchmarkcited by 2,879
  9. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  10. 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 2,004
  11. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
  12. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
13 more
  1. 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
  2. 2025Layer by Layer: Uncovering Hidden Representations in Language Modelscited by 311
  3. 2025OpenCodeReasoning: Advancing Data Distillation for Competitive Codingcited by 113
  4. 2023Fluctuation-based Adaptive Structured Pruning for Large Language Modelscited by 111
  5. 2024SEER-MoE: Sparse Expert Efficiency through Regularization for Mixture-of-Expertscited by 40
  6. 2024DB-LLM: Accurate Dual-Binarization for Efficient LLMscited by 37
  7. 2024A Survey of Low-bit Large Language Models: Basics, Systems, and Algorithmscited by 31
  8. 2019Deep Model Transferability from Attribution Mapscited by 28
  9. 2024DISP-LLM: Dimension-Independent Structural Pruning for Large Language Modelscited by 24
  10. 2024A Provably Effective Method for Pruning Experts in Fine-tuned Sparse Mixture-of-Expertscited by 21
  11. 2025Domain-Specific Pruning of Large Mixture-of-Experts Models with Few-shot Demonstrationscited by 16
  12. 2025MoDES: Accelerating Mixture-of-Experts Multimodal Large Language Models via Dynamic Expert Skippingcited by 11
  13. 2025LLMC+: Benchmarking Vision-Language Model Compression with a Plug-and-play Toolkitcited by 7

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026PRIME: Frequency-Aware Unified Pruning and Merging for MoE Compression
  2. 2025REAP the Experts: Why Pruning Prevails for One-Shot MoE compression
  3. 2026OMP-MoE: Efficient Expert Pruning for Mixture-of-Experts LLMs via Orthogonal Matching Pursuit
  4. 2026Shared Low-rank Basis Factorization for Data-free Mixture-of-Experts Compression
  5. 2025μ-MoE: Test-Time Pruning as Micro-Grained Mixture-of-Experts
  6. 2025MC#: Mixture Compressor for Mixture-of-Experts Large Models
  7. 2022Task-Specific Expert Pruning for Sparse Mixture-of-Experts
  8. 2025CAMERA: Multi-Matrix Joint Compression for MoE Models via Micro-Expert Redundancy Analysis