arXiv:2607.04371cs.AI2026-07

压缩混合专家模型,交互部署时吞吐量翻倍

Nemotron-Labs-3-Puzzle-75B-A9B: Compressing Hybrid MoE LLMs

论文配图:Nemotron-Labs-3-Puzzle-75B-A9B: Compressing Hybrid MoE LLMs
图 1 · 摘自论文原文
  • 分阶段压缩:结合知识蒸馏、强化学习与量化
  • 单卡部署下100万词上下文并发从1升至8请求
  • 适合需要高效推理的长文本与多任务场景

我们提出Nemotron-Labs-3-Puzzle-75B-A9B,一个专为交互式部署优化的Nemotron-3-Super压缩版。在单个8xB200节点的交互服务负载下,该模型在相同用户吞吐量约束下实现约2倍于原模型的服务器吞吐量。在单H100 GPU的超长上下文部署中,100万词并发请求数从1提升至8。该模型通过多阶段流水线构建,融合迭代拼图压缩框架、知识蒸馏、强化学习、量化及多标记预测头。压缩过程联合优化异构MoE剪枝、活跃参数预算和Mamba剪枝,提升推理效率同时保持模型质量。我们在涵盖推理、编码、多语言、长上下文及代理任务的广泛基准上评估该模型,尽管经过大幅压缩,其下游任务表现仍接近母模型。结果表明,大型混合专家模型可在不损失能力的前提下显著优化部署效率。模型已公开发布于Hugging Face。

原文摘要 · Abstract (English)

We present Nemotron-Labs-3-Puzzle-75B-A9B, a compressed variant of Nemotron-3-Super optimized for interactive deployment. We designed the model to maximize server throughput under high user throughput constraints. In interactive serving workloads on a single 8xB200 node, Puzzle-75B-A9B achieves approximately 2x higher server throughput than Nemotron-3-Super at matched user throughput constraints. In ultra-long-context deployment on a single H100 GPU, the compressed model increases 1M-token concurrency from 1 request to 8 requests. Puzzle-75B-A9B is constructed using a multi-stage pipeline that combines the Iterative Puzzle compression framework with knowledge distillation, reinforcement learning, quantization, and a Multi-Token Prediction head. The compression process jointly optimizes heterogeneous MoE pruning, active parameter budget, and Mamba pruning to improve inference efficiency while preserving model quality. We evaluate Puzzle-75B-A9B on a broad suite of reasoning, coding, multilingual, long-context, and agentic benchmarks. Despite substantial compression, the model retains strong downstream accuracy relative to the parent model across a wide range of tasks. These results demonstrate that large hybrid MoE models can be substantially optimized for deployment efficiency while maintaining strong downstream capability. Our model is publicly available on Hugging Face.

模型压缩MoE长文本推理优化

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。