Skip to content
NewA calmer, faster ZeroHour

Higher-order pruning of experts in mixture-of-experts language models

arXiv cs.AI / cs.LG / cs.CLby Alex M. Tseng ()1 min read3 · 2 reads
AI summary · glm-5.3-flashSummaries by Vani AI

New HOPE method uses second-order objectives to prune Mixture-of-Experts LLMs, outperforming REAP at 50% pruning on models up to 122B parameters.

Researchers derive HOPE (Higher-Order Pruning of Experts), a second-order pruning objective for Mixture-of-Experts language models that provably minimizes an upper bound on pruning error by modeling cooperative expert interactions. They show REAP, a state-of-the-art first-order method, is a special case of HOPE with interaction terms ignored. Across three frontier MoE models up to 122B parameters, two calibration sets, and benchmarks covering math, instruction following, coding, and agentic tasks, HOPE achieves the best average rank (1.58 of 5 at 50% pruning versus 2.42 for REAP), with gains up to +6.1% on agentic coding.

Key facts
  • HOPE minimizes an upper bound on pruning error via second-order expert interactions
  • REAP is a special case of HOPE with interaction terms ignored
  • At 50% pruning, average rank 1.58 of 5 versus 2.42 for next-best REAP
  • Largest gains on agentic coding workloads, up to +6.1%
  • Evaluated on three frontier MoE models up to 122B parameters
Explain this AI news with Vani AIWhat was announced, what is new and why it matters, in a new chat

From the original article

1 min read at arxiv.org

Mixture-of-Experts (MoE) language models suffer from large parameter counts, which create a significant memory bottleneck. Expert pruning is the most direct approach for reducing this parameter count, yet existing methods make pruning decisions for each expert independently, and assume experts' contributions are purely additive. In reality, expert usage in MoEs is inherently cooperative.

arXiv cs.AI / cs.LG / cs.CL

By Alex M. Tseng · arxiv.org

Read the full article at arXiv cs.AI / cs.LG / cs.CL

A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.