[2604.04356] REAM: Merging Improves Pruning of Experts in LLMs

Computer Science > Artificial Intelligence arXiv:2604.04356 (cs) [Submitted on 6 Apr 2026] Title:REAM: Merging Improves Pruning of Experts in LLMs Authors:Saurav Jha, Maryam Hashemzadeh, Ali Saheb Pasand, Ali Parviz, Min-Joong Lee, Boris Knyazev View a PDF of the paper titled REAM: Merging Improves Pruning of Experts in LLMs, by Saurav Jha and 5 other authors View PDF HTML (experimental) Abstract:Mixture-of-Experts (MoE) large language models (LLMs) are among the top-performing architectures. The largest models, often with hundreds of billions of parameters, pose significant memory challenges for deployment. Traditional approaches to reduce memory requirements include weight pruning and quantization. Motivated by the Router-weighted Expert Activation Pruning (REAP) that prunes experts, we propose a novel method, Router-weighted Expert Activation Merging (REAM). Instead of removing experts, REAM groups them and merges their weights, better preserving original performance. We evaluate REAM against REAP and other baselines across multiple MoE LLMs on diverse multiple-choice (MC) question answering and generative (GEN) benchmarks. Our results reveal a trade-off between MC and GEN performance that depends on the mix of calibration data. By controlling the mix of general, math and coding data, we examine the Pareto frontier of this trade-off and show that REAM often outperforms the baselines and in many cases is comparable to the original uncompressed models. Comments: Subjects:...