MC#: Mixture Compressor for Mixture-of-Experts Large Models
Wei Huang, Yue Liao, Yukang Chen, Jianhui Liu, Haoru Tan, Si Liu, Shiming Zhang, Shuicheng Yan, Xiaojuan Qi
TL;DR
This work tackles the memory and computation bottlenecks of Mixture-of-Experts architectures by introducing MC#, a two-stage compression framework that combines Pre-Loading Mixed-Precision Quantization (PMQ) with Online Top-any Pruning (OTP). PMQ assigns per-expert bit-widths via an LP-based optimization over expert significance and quantization error, enabling ultra-low-bit static compression, while OTP uses a differentiable, Gumbel-Softmax-based mechanism to prune experts dynamically per token, reducing runtime cost. The approach yields a Pareto-optimal trade-off between size and performance, achieving up to a 6.2x weight reduction at an average of $2.57$ bits with only $1.7\%$ accuracy loss on DeepSeek-VL2 across multimodal benchmarks, and reducing expert activation by more than $20\%$ with less than $1\%$ performance degradation. Together, PMQ and OTP enable highly compressed MoE-based large models that can still outperform equal-sized, full-precision baselines on several benchmarks, highlighting practical potential for efficient deployment in diverse hardware.
Abstract
Mixture-of-Experts (MoE) effectively scales large language models (LLMs) and vision-language models (VLMs) by increasing capacity through sparse activation. However, preloading all experts into memory and activating multiple experts per input introduces significant computational and memory overhead, making the expert module a major contributor to model size and inference cost. To address this, we propose MC# (Mixture-Compressor-sharp), a framework that combines static quantization and dynamic expert pruning by leveraging the significance of experts and tokens for aggressive compression of MoE-LLMs/VLMs. To reduce storage and loading costs, we introduce Pre-Loading Mixed-Precision Quantization (PMQ), which optimizes bit allocation via linear programming, balancing expert importance and quantization error for a Pareto-optimal trade-off between size and performance. To reduce runtime computation, Online Top-any Pruning (OTP) uses Gumbel-Softmax sampling to dynamically select a subset of experts per token, enabling fine-grained control over activation. By combining PMQ's static bit-width optimization with OTP's dynamic routing, MC# achieves extreme compression with minimal accuracy loss. On DeepSeek-VL2, MC# achieves a 6.2 times weight reduction at 2.57 average bits with only a 1.7% accuracy drop across five multimodal benchmarks. Additionally, OTP reduces expert activation over 20% with less than 1% performance degradation, demonstrating strong potential for efficient MoE-based model deployment.
