AIMER: Calibration-Free Task-Agnostic MoE Expert Pruning
On the map: Mixture-of-experts → MoE large language models
Abstract (arXiv)
Mixture-of-Experts (MoE) language models increase parameter capacity without proportional per-token computation, yet deployment still requires storing the full expert pool, making expert pruning important for reducing memory and serving overhead. Existing task-agnostic expert-pruning methods are typically calibration-dependent: they estimate expert importance from routing or activation statistics on a calibration set, making pruning decisions sensitive to calibration-data variation while introducing substantial preprocessing cost. We propose AIMER (Absolute mean over root mean square IMportance for Expert Ranking), a simple calibration-free criterion that identifies more distinct experts by capturing the concentration pattern of expert weights, making it well suited for task-agnostic expert pruning. Across 7B to 47B MoE language models with distinct architectures and 16 diverse benchmarks, AIMER consistently delivers stronger capability balance across diverse tasks than existing calibration-free methods. Surprisingly, AIMER also achieves better balance than strong calibration-based expert-pruning baselines calibrated on the widely used task-agnostic C4 corpus, while requiring only 0.22--2.06 seconds to score all experts.
Key facts. Cited by 5 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 40 of its 53 references that are in the map. First posted on arXiv 19 Mar 2026.
Builds on
40 of 53 references.
Closest ancestors · 11
Same direction, newest first
- 2026EvoESAP: Non-Uniform Expert Pruning for Sparse MoE6 Mar
- 2025MoE Pathfinder: Trajectory-driven Expert Pruning20 Dec
- 2025REAP the Experts: Why Pruning Prevails for One-Shot MoE compression15 Oct
- 2025Dropping Experts, Recombining Neurons: Retraining-Free Pruning for Sparse Mixture-of-Experts LLMs12 Sep
- 2024Retraining-Free Merging of Sparse MoE via Hierarchical Clustering11 Oct
- 2024STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruning10 Sep
- 2024Diversifying the Expert Knowledge for Task-Agnostic Pruning in Sparse Mixture-of-Experts12 Jul
- 2024Efficient Expert Pruning for Sparse Mixture-of-Experts Language Models: Enhancing Performance and Reducing Inference Costs1 Jul
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model7 May
- 2023Merging Experts into One: Improving Computational Efficiency of Mixture of Experts15 Oct
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer23 Jan
Other references · 29
- 2017Attention Is All You Needcited by 60,361
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,371
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2024LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Codecited by 2,004
- 2019Similarity of Neural Network Representations Revisitedcited by 1,755
- 2023Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generationcited by 1,391
17 more
- 2025gpt-oss-120b & gpt-oss-20b Model Cardcited by 1,386
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2023WizardCoder: Empowering Code Large Language Models with Evol-Instructcited by 733
- 2026GLM-5: from Vibe Coding to Agentic Engineeringcited by 587
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
- 2024WildBench: Benchmarking LLMs with Challenging Tasks from Real Users in the Wildcited by 218
- 2015Data-free parameter pruning for Deep Neural Networkscited by 112
- 2023Merge, Then Compress: Demystify Efficient SMoE with Hints from Its Routing Policycited by 108
- 2022Task-Specific Expert Pruning for Sparse Mixture-of-Expertscited by 72
- 2019DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measurescited by 56
- 2024SEER-MoE: Sparse Expert Efficiency through Regularization for Mixture-of-Expertscited by 40
- 2022Memory-efficient NLLB-200: Language-specific Expert Pruning of a Massively Multilingual Machine Translation Modelcited by 36
- 2019Data-Independent Neural Pruning via Coresetscited by 35
- 2024Is C4 Dataset Optimal for Pruning? An Investigation of Calibration Data for LLM Pruningcited by 20
- 2025Finding Fantastic Experts in MoEs: A Unified Study for Expert Dropping Strategies and Observationscited by 20
- 2021RED++ : Data-Free Pruning of Deep Neural Networks via Input Splitting and Output Mergingcited by 19
- 2025You Only Prune Once: Designing Calibration-Free Model Compression With Policy Learningcited by 17
Built on by
Citing papers per year: 2026: 5.
5 papers.
- 2026How to Score Experts for One-Shot MoE Expert Pruning: A Unified Formulation and Selection Principlecited by 6
- 2026HodgeCover: Higher-Order Topological Coverage Drives Compression of Sparse Mixture-of-Expertscited by 1
- 2026Router Sensitivity Under Lightweight Fine-Tuning Identifies Prunable Experts in Mixture-of-Experts Modelscited by 0
- 2026ACE: Adaptive Calibration-Free Expert Skipping for MoE-based LLMscited by 0
- 2026RAZOR: Pruning Replaceable Experts in LLMscited by 0
- 2026RAZOR: Pruning Replaceable Experts in LLMs24 Sep 2026
- 2026ACE: Adaptive Calibration-Free Expert Skipping for MoE-based LLMs4 Sep 2026
- 2026Router Sensitivity Under Lightweight Fine-Tuning Identifies Prunable Experts in Mixture-of-Experts Models8 Aug 2026
- 2026How to Score Experts for One-Shot MoE Expert Pruning: A Unified Formulation and Selection Principle14 Jun 2026
- 2026HodgeCover: Higher-Order Topological Coverage Drives Compression of Sparse Mixture-of-Experts13 May 2026
Similar, not cited
Close in wording, no citation either way
- 2026Higher-order pruning of experts in mixture-of-experts language models
- 2025MoNE: Replacing Redundant Experts with Lightweight Novices for Structured Pruning of MoE
- 2026It Takes a MAESTRO To Prune Bad Experts
- 2026Does a Global Perspective Help Prune Sparse MoEs Elegantly?
- 2024Not All Experts are Equal: Efficient Expert Pruning and Skipping for Mixture-of-Experts Large Language Models
- 2026Towards Robust Calibration Dataset for Domain-General Mixture of Experts Pruning
- 2025Cluster-Driven Expert Pruning for Mixture-of-Experts Large Language Models
- 2026Pruning and Distilling Mixture-of-Experts into Dense Language Models