跳到正文
arXiv cs.AI· Jakob Steimle, Thomas Elsken, Daniel Ehrhardt, Lukas Rinder, Daniel Cremers, Xi Wang·· 12 小时前AI 评分34

别跳过基线:MoE 动态专家跳过方法的受控对比研究

Don't Skip the Baseline: A Controlled Comparison of Dynamic Expert Skipping in MoEs

AI 导读

研究将四种代表性 MoE 动态专家跳过方法归入统一分类,并在 Gemma4-26B-A4B、Qwen3-30B-A3B 及多模态 Qwen3-VL 上,与"静态降低专家数 k"这一简单基线在同等专家计算预算下对比。

正文 · 原文

View PDF HTML (experimental)

Abstract:A growing body of work proposes dynamic expert-skipping methods for Mixture-of-Experts (MoE) models that adjust the number of experts activated per token during inference, aiming to preserve model quality while further reducing the number of active parameters. These methods have added calibrated importance scores, inter-expert similarity metrics, or learned per-token allocators in order to identify experts to skip. However, different calibration regimes, different reductions in the effective number of experts, and evaluation suites make comparisons difficult. We classify four representative prior methods into a unified taxonomy and benchmark them against a natural, simple baseline: statically reducing the number of experts $k$ (i.e., same reduced $k$ across all layers and tokens). We provide a fair comparison of these methods at matched expert-compute budget, on two modern MoEs (Gemma4-26B-A4B and Qwen3-30B-A3B) in a text-only setting and a contemporary vision-language model (Qwen3-VL) in a multimodal setting. Surprisingly, we find that the simple baseline is hard to outperform consistently across models, modalities, benchmarks, and calibration settings. The methods we benchmark often underperform the baseline and achieved gains, when present, are minor. We further find that the effective $k$ achieved (or optimized for) in calibration can diverge from the effective $k$ in testing, resulting in over- or under-estimating the compute at inference time. Based on these findings, we recommend a calibration-free per-modality static $k$ reduction and validate this on a held-out model and modality. We further argue that a static control at matched measured compute is the baseline any dynamic skipping method must beat.
Subjects: Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
Cite as: arXiv:2610.28369 [cs.LG]
  (or arXiv:2610.28369v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2610.28369

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Jakob Steimle [view email]
[v1] Tue, 20 Oct 2026 15:29:19 UTC (263 KB)

来源:arXiv cs.AI · arxiv.org