arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2603.06003cs.LG

EvoESAP: 非均匀专家修剪用于稀疏MoE

EvoESAP: Non-Uniform Expert Pruning for Sparse MoE

Zhejiang University(浙江大学);Westlake University(西湖大学);Mohamed bin Zayed University of Artificial Intelligence(穆罕默德·本·扎耶德人工智能大学)

Zongfang Liu, Shengkun Tang, Boyang Sun, Zhiqiang Shen, Xin Yuan

AI总结:

本文提出EvoESAP,通过非均匀层间稀疏分配提升稀疏MoE模型的生成能力,同时保持多选准确率。

摘要:

稀疏混合专家(SMoE)语言模型在低计算成本下表现出色,但部署受限于内存和吞吐量,因为必须存储和服务完整专家池。训练后专家修剪可降低成本,但大多数方法集中在每层专家修剪及默认均匀层间稀疏分配,尽管层间分配对性能影响显著。本文将修剪分为层内专家排序和跨层预算分配,并引入ESAP,一种受推测解码启发的教师强制度量,衡量修剪模型与完整模型的匹配程度而不需昂贵的自回归解码。ESAP有界且稳定,使候选者比较经济。基于ESAP,本文提出EvoESAP,一种进化搜索框架,在固定全局预算下寻找改进的非均匀层间稀疏分配,同时保持层内修剪顺序固定,使其成为频率、EAN、SEER和REAP等标准的即插即用方法。在25%和50%稀疏度下,7B-30B SMoE LLMs中,EvoESAP一致发现非均匀分配,提升开放生成能力(在50%稀疏度下达+19.6%在MATH-500上),同时保持与均匀修剪相同稀疏度下的竞争多选准确率。代码可在https://github.com/ZongfangLiu/EvoESAP获取。

英文摘要:

Sparse Mixture-of-Experts (SMoE) language models achieve strong capability at low per-token compute, yet deployment remains constrained by memory footprint and throughput because the full expert pool must still be stored and served. Post-training expert pruning reduces this cost, but most methods focus on which experts to prune within each layer and default to a uniform layer-wise sparsity allocation, even though the layer-wise allocation can strongly affect performance. We decouple pruning into within-layer expert ranking and across-layer budget allocation, and introduce \textbf{E}xpected \textbf{S}peculative \textbf{A}cceptance \textbf{P}roxy (\textbf{ESAP}), a speculative-decoding-inspired, teacher-forced metric that measures how well a pruned model matches the full model without costly autoregressive decoding. ESAP is bounded and stable, enabling cheap comparison of many candidates. Building on ESAP, we propose EvoESAP, an evolutionary search framework that finds an improved non-uniform layer-wise sparsity allocation under a fixed global budget while holding the within-layer pruning order fixed, making it a plug-and-play method for criteria such as Frequency, EAN, SEER, and REAP. Across 7B--30B SMoE LLMs at 25\% and 50\% sparsity, EvoESAP consistently discovers non-uniform allocations that improve open-ended generation (up to \textbf{+19.6\%} on MATH-500 at 50\% sparsity) while preserving competitive multiple-choice accuracy compared with uniform pruning at the same sparsity. Code is available at https://github.com/ZongfangLiu/EvoESAP.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑