Pith. sign in

REVIEW 1 cited by

Domain-Specific Pruning of Large Mixture-of-Experts Models with Few-shot Demonstrations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.06792 v2 pith:EH2HL6BU submitted 2025-04-09 cs.CL cs.LG

Domain-Specific Pruning of Large Mixture-of-Experts Models with Few-shot Demonstrations

classification cs.CL cs.LG
keywords expertsexpertmodelsonlydemonstrationsachievecontributiondeepseek-r1
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Mixture-of-Experts (MoE) models achieve a favorable trade-off between performance and inference efficiency by activating only a subset of experts. However, the memory overhead of storing all experts remains a major limitation, especially in large-scale MoE models such as DeepSeek-R1(671B). In this study, we investigate domain specialization and expert redundancy in large-scale MoE models and uncover a consistent behavior we term few-shot expert localization, with only a few in-domain demonstrations, the model consistently activates a sparse and stable subset of experts on tasks within the same domain. Building on this observation, we propose a simple yet effective pruning framework, EASY-EP, that leverages a few domain-specific demonstrations to identify and retain only the most relevant experts. EASY-EP comprises two key components: output-aware expert importance assessment and expert-level token contribution estimation. The former evaluates the importance of each expert for the current token by considering the gating scores and L2 norm of the outputs of activated experts, while the latter assesses the contribution of tokens based on representation similarities before and after routed experts. Experiments on DeepSeek-R1 and DeepSeek-V3-0324 show that our method can achieve comparable performances and $2.99\times$ throughput under the same memory budget with full model with only half the experts.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Half the Experts, All the Code: One-Shot Domain Pruning of Mixture-of-Experts LLMs for Coding

    cs.LG 2026-07 conditional novelty 7.0

    Half the experts in Qwen3.6-35B-A3B and Gemma-4-26B-A4B can be pruned without detectable HumanEval+ loss, but the winning selection criterion flips per family and pruning beats quantization only below ~3-bit weight precision.