DiEP: Adaptive Mixture-of-Experts Compression through Differentiable Expert Pruning

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Bai, Sikai, Li, Haoxi, Zhang, Jie, Hong, Zicong, Guo, Song
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866911163678195712
author Bai, Sikai
Li, Haoxi
Zhang, Jie
Hong, Zicong
Guo, Song
author_facet Bai, Sikai
Li, Haoxi
Zhang, Jie
Hong, Zicong
Guo, Song
contents Despite the significant breakthrough of Mixture-of-Experts (MoE), the increasing scale of these MoE models presents huge memory and storage challenges. Existing MoE pruning methods, which involve reducing parameter size with a uniform sparsity across all layers, often lead to suboptimal outcomes and performance degradation due to varying expert redundancy in different MoE layers. To address this, we propose a non-uniform pruning strategy, dubbed \textbf{Di}fferentiable \textbf{E}xpert \textbf{P}runing (\textbf{DiEP}), which adaptively adjusts pruning rates at the layer level while jointly learning inter-layer importance, effectively capturing the varying redundancy across different MoE layers. By transforming the global discrete search space into a continuous one, our method handles exponentially growing non-uniform expert combinations, enabling adaptive gradient-based pruning. Extensive experiments on five advanced MoE models demonstrate the efficacy of our method across various NLP tasks. Notably, \textbf{DiEP} retains around 92\% of original performance on Mixtral 8$\times$7B with only half the experts, outperforming other pruning methods by up to 7.1\% on the challenging MMLU dataset.
format Preprint
id arxiv_https___arxiv_org_abs_2509_16105
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle DiEP: Adaptive Mixture-of-Experts Compression through Differentiable Expert Pruning
Bai, Sikai
Li, Haoxi
Zhang, Jie
Hong, Zicong
Guo, Song
Computation and Language
Despite the significant breakthrough of Mixture-of-Experts (MoE), the increasing scale of these MoE models presents huge memory and storage challenges. Existing MoE pruning methods, which involve reducing parameter size with a uniform sparsity across all layers, often lead to suboptimal outcomes and performance degradation due to varying expert redundancy in different MoE layers. To address this, we propose a non-uniform pruning strategy, dubbed \textbf{Di}fferentiable \textbf{E}xpert \textbf{P}runing (\textbf{DiEP}), which adaptively adjusts pruning rates at the layer level while jointly learning inter-layer importance, effectively capturing the varying redundancy across different MoE layers. By transforming the global discrete search space into a continuous one, our method handles exponentially growing non-uniform expert combinations, enabling adaptive gradient-based pruning. Extensive experiments on five advanced MoE models demonstrate the efficacy of our method across various NLP tasks. Notably, \textbf{DiEP} retains around 92\% of original performance on Mixtral 8$\times$7B with only half the experts, outperforming other pruning methods by up to 7.1\% on the challenging MMLU dataset.
title DiEP: Adaptive Mixture-of-Experts Compression through Differentiable Expert Pruning
topic Computation and Language
url https://arxiv.org/abs/2509.16105