AI News AI资讯 1d ago Updated 23h ago 更新于 23小时前 50

Meet Nemotron Labs 3 Puzzle 75B A9B: A Compressed Hybrid MoE LLM Delivering 2.03x Server Throughput 遇见Nemotron Labs 3 Puzzle 75B A9B:一种提供2.03倍服务器吞吐量的压缩混合MoE大语言模型

NVIDIA released Nemotron-Labs-3-Puzzle-75B-A9B, a compressed hybrid MoE variant of Nemotron-3-Super, reducing total parameters from 120.7B to 75.3B and active parameters from 12.8B to 9.3B while preserving the original 88-block architecture. The model achieves significant deployment efficiency gains, including a 1.6x to 2.14x increase in server throughput on 8xB200 nodes and enabling 8 concurrent 1M-token requests on a single H100 GPU by reducing weight footprint from 70GB to 44.5GB. The compres NVIDIA发布Nemotron-Labs-3-Puzzle-75B-A9B,将原120.7B参数模型压缩至75.3B,激活参数从12.8B降至9.3B,保留混合MoE架构布局。 在单张H100上处理1M上下文时,权重占用从70GB降至44.5GB,并发请求能力从1提升至8,吞吐量提升约4倍。 采用“迭代Puzzle”架构搜索策略,结合知识蒸馏恢复,相比单步压缩在多项基准测试中平均提升0.57分。 性能增益在解码密集型场景(如长文本生成)最为显著,吞吐量最高提升2.14倍,而预填充密集型场景增益较小。

72
Hot 热度
68
Quality 质量
75
Impact 影响力

Analysis 深度分析

TL;DR

  • NVIDIA released Nemotron-Labs-3-Puzzle-75B-A9B, a compressed hybrid MoE variant of Nemotron-3-Super, reducing total parameters from 120.7B to 75.3B and active parameters from 12.8B to 9.3B while preserving the original 88-block architecture.
  • The model achieves significant deployment efficiency gains, including a 1.6x to 2.14x increase in server throughput on 8xB200 nodes and enabling 8 concurrent 1M-token requests on a single H100 GPU by reducing weight footprint from 70GB to 44.5GB.
  • The compression utilizes an iterative "Puzzle" neural architecture search framework that combines intermediate channel pruning, top-k expert reduction, and Mamba SSM state pruning, outperforming single-step compression methods.
  • While general reasoning benchmarks like Arena-Hard-V2 and SWE-Bench show minor performance drops (-4.2 and -2.6 respectively), long-context capabilities (RULER) remain largely unaffected, indicating targeted capacity preservation.

Why It Matters

This development demonstrates a practical path for deploying large hybrid Mamba-Transformer models on consumer-grade or limited enterprise hardware by significantly lowering memory bandwidth and storage constraints without catastrophic accuracy loss. For AI practitioners, it highlights the efficacy of iterative, constraint-aware neural architecture search in balancing computational efficiency with model capability, particularly for high-concurrency, long-context inference scenarios.

Technical Details

  • Architecture Preservation: The compressed model retains the parent's 88-block layout (40 Mamba, 40 MoE, 8 Attention). Compression is applied selectively: Mamba SSM state size is reduced from 128 to 96, MoE expert intermediate sizes are varied (mean 59.9% of original), and activated routed experts per token range from 4-18 (mean 50%).
  • Iterative Puzzle Framework: Unlike single-step pruning, this method uses a mixed-integer program to select layer alternatives iteratively. It alternates bounded compression with short knowledge distillation recovery across three stages (75% -> 60% -> 50% capacity targets), allowing scores to be recalculated against the current compressed model rather than just the teacher.
  • Pruning Techniques: Three specific techniques were employed: intermediate channel pruning ranked by output contribution, top-k reduction varying per layer, and uniform Mamba SSM pruning. Channel ranking was based on estimates averaged over 67M tokens of validation data.
  • Performance Benchmarks: On 8xB200 nodes with NVFP4 weights, throughput boosts ranged from 1.60x to 2.14x depending on input/output ratios. On a single H100 with 1M context, concurrency increased from 1 to 8 requests due to reduced memory footprint, with aggregate decode throughput roughly 4x that of the uncompressed model serving a single request.

Industry Insight

  • Hybrid Models Gain Traction: The successful compression of a hybrid Mamba-Transformer MoE model suggests that hybrid architectures are becoming viable for production environments where memory bandwidth is a bottleneck, offering a middle ground between pure Transformer efficiency and Mamba's linear scaling.
  • Iterative Search Over Single-Step: The 0.57-point average gain of iterative Puzzle over single-step methods indicates that accounting for inter-layer dependencies during compression is critical for maintaining high-end reasoning capabilities, urging researchers to adopt multi-stage distillation strategies.
  • Memory-Constrained Deployment: The ability to fit complex 1M-context workloads onto single H100 GPUs by reducing parameter count makes advanced long-context AI accessible to organizations without massive multi-GPU clusters, potentially accelerating adoption in edge or mid-tier cloud deployments.

TL;DR

  • NVIDIA发布Nemotron-Labs-3-Puzzle-75B-A9B,将原120.7B参数模型压缩至75.3B,激活参数从12.8B降至9.3B,保留混合MoE架构布局。
  • 在单张H100上处理1M上下文时,权重占用从70GB降至44.5GB,并发请求能力从1提升至8,吞吐量提升约4倍。
  • 采用“迭代Puzzle”架构搜索策略,结合知识蒸馏恢复,相比单步压缩在多项基准测试中平均提升0.57分。
  • 性能增益在解码密集型场景(如长文本生成)最为显著,吞吐量最高提升2.14倍,而预填充密集型场景增益较小。

为什么值得看

本文展示了如何通过非均匀剪枝和迭代式架构搜索,在保持混合Mamba-Transformer MoE模型性能的同时大幅降低部署成本。对于需要大规模并发处理长上下文任务的AI从业者而言,该方案提供了极具吸引力的硬件效率优化路径。

技术解析

  • 架构压缩策略:在保持88层混合结构(40 Mamba + 40 MoE + 8 Attention)不变的前提下,统一剪枝Mamba SSM状态大小(128至96),并异质性调整MoE专家中间层大小及激活专家数量(从22个降至4-18个),注意力层保持不变以维持KV缓存效率。
  • 迭代Puzzle算法:采用分解神经架构搜索框架Puzzletron,通过混合整数规划选择每层的替代实现。区别于单步压缩,该方法交替进行有界压缩和短期知识蒸馏恢复,逐步逼近目标容量,从而捕捉层间高阶交互影响。
  • 性能基准表现:在8xB200节点上,匹配NVFP4精度时,解码密集型场景(8K输入/64K输出)总吞吐量提升达2.14倍;在单H100上,1M上下文并发数从1增至8,预填充速度提升1.2倍。
  • 恢复与训练细节:使用Nemotron-3-Nano的数据进行知识蒸馏恢复,分三阶段逐步降低MoE权重容量至教师的60%,激活专家预算降至50%,并在更长序列长度(128K)下进行微调以恢复性能。

行业启示

  • 混合架构的部署优化潜力:证明了对Mamba-Transformer混合模型进行针对性剪枝(特别是Mamba状态和MoE路由)能有效解决显存瓶颈,为长上下文服务提供低成本解决方案。
  • 迭代式压缩优于一次性剪枝:引入迭代压缩结合蒸馏恢复的方法,能在大幅减少参数量时更好地保留模型智能,建议在模型轻量化过程中优先考虑此类渐进式策略而非简单缩放。
  • 硬件约束驱动的设计导向:明确针对特定硬件(如H100的80GB HBM)和负载特征(预填充vs解码)进行架构搜索,能最大化实际业务场景中的吞吐量和并发能力,指导未来模型设计需更紧密贴合推理基础设施限制。

Disclaimer: The above content is generated by AI and is for reference only. 免责声明:以上内容由 AI 生成,仅供参考。

LLM 大模型 Open Source 开源 Inference 推理 Quantization 量化 Deployment 部署