aifollow.news
返回 Rohan Paul
Rohan Paul· @rohanpaul_ai · X· · 原发布时间 AI 评分54

Cohere 论文解释稀疏 MoE 模型中推测解码为何比预期更有效

AI 导读

Cohere 的论文研究稀疏混合专家模型在小批量下的推测解码。研究者在 H100 GPU 上测试了 10 个参数规模为 300 亿至 1 万亿的模型:相邻 token 共用 20%—45% 的专家,高于独立路由预期的 4%—12%,使额外验证的成本低于先前预测。

原帖引用 · 原文

@rohanpaul_ai

– https://t.co/40825OLisu

Title: "Why Speculative Decoding Works Better Than Predicted on Sparse MoE Models"

回复Rohan Paul@rohanpaul_ai
New @cohere paper finds that speculative decoding works well on fine-grained MoE models even at batch size 1, where prior work predicted small gains. Finds that in mixture-of-experts models, neighboring tokens share 20% to 45% of their experts, against 4% to 12% expected, which makes speculative decoding cheaper than predicted. Speculative decoding lets a small drafter propose tokens that the big model checks in 1 pass. For MoE models, prior work said checking several tokens loads many extra experts, limiting gains at low batch sizes. They tested 10 MoE models from 30B to 1T parameters and profiled them on H100 GPUs. Consecutive tokens reuse many experts, and small experts use GPU bandwidth well, so checking extra tokens costs little. Adjacent tokens shared 20% to 45% of their experts, against 4% to 12% expected from independent routing. For Qwen3-235B in FP8, the verification pass ran at 89% of a normal decoding step's speed, against 52% predicted. For low-batch MoE serving, such as agent workloads, benchmark speculative decoding on your hardware instead of ruling it out.
在 X 查看这条帖子 ↗

来源:Rohan Paul · x.com

论文
发现内容有误?提交纠错