GS-MoE: Training-Free MoE Compression via Groupwise Subspace Sharing and Pruning

gs-moe:-training-free-moe-compression-via-groupwise-subspace-sharing-and-pruning

GS-MoE: Training-Free MoE Compression via Groupwise Subspace Sharing and Pruning

[Submitted on 23 Oct 2026]

View PDF HTML (experimental)

Abstract:Mixture-of-Experts (MoE) models reduce computation through sparse activation, but storing their expert parameters remains a major memory bottleneck. We introduce GS-MoE, a training-free compression framework that addresses redundancy across and within experts through two compression axes: shared-subspace rank and expert intermediate width. Groupwise low-rank representations capture shared structure across experts while retaining expert-specific projections, and Nyström-based neuron compression reduces intermediate width within each expert. For fixed shared subspaces, we derive per-expert reconstruction-error reductions from the reconstruction objective and use them to guide expert grouping. Budgets are allocated hierarchically using a gradient-free layer-importance score to guide the allocation of rank and width budgets across layers, which eigenvalues and leverage then distribute as non-uniform ranks across groups and intermediate widths across experts. Experiments demonstrate the complementary benefits of compression along both axes, particularly at high compression rates on fine-grained MoE models. On DeepSeek-MoE-16B-Base, at a 60% reduction in total model parameters, GS-MoE retains approximately 90% of the uncompressed model’s average reasoning performance, compared with 73% for D$^2$-MoE, while achieving 20% lower out-of-domain perplexity. We provide a code implementation at: this https URL

Submission history

From: Carson Cary [view email]
[v1] Fri, 23 Oct 2026 00:16:36 UTC (454 KB)