Nemotron 3 Ultra: NVIDIA’s 550B Mixture‑of‑Experts Built to Cut the Cost of Long‑Running AI Agents
Nemotron 3 Ultra is NVIDIA’s answer to a practical business problem: how to run AI agents that keep enormous amounts of context and make many tool calls without bankrupting the cloud bill. It’s a 550‑billion‑parameter sparse model designed so only a fraction of parameters activate per token, giving teams faster, cheaper inference for long‑context AI automation.
Why businesses should care
Companies building persistent assistants—customer support that remembers previous sessions, research agents that traverse massive documents, orchestration agents that chain many small tool calls—need models that keep state without linear cost growth per step. Nemotron 3 Ultra is engineered to reduce the cost per long‑running agent step through sparse activation, long‑sequence layers, and hardware‑aware quantization.
- Lower per‑step inference cost: Sparse Mixture‑of‑Experts (MoE) activation keeps the active compute footprint small, even as total model capacity grows.
- Long memory: A context window stretched to 1,000,000 tokens (1M) supports agents that must recall very long histories.
- Deployability: A single NVFP4 checkpoint runs across multiple NVIDIA GPU generations, easing practical rollout.
Top use cases where Nemotron 3 Ultra shows up strong
- Persistent conversational assistants (multi‑session customer support, personal assistants)
- Document‑heavy research agents (legal, medical, compliance teams needing whole‑file context)
- Automated orchestration agents that issue many small tool calls and require cheap per‑step inference
- Consolidating domain specialists into a single generalist via multi‑teacher distillation
Headline metrics and what they mean
Quick facts you can brief the board with:
- Model size: 550B total parameters; about 55B active per token thanks to sparse MoE routing.
- Context window: extended to 1,000,000 tokens (1M).
- Throughput: up to ~6× inference throughput vs comparable open LLMs on decode‑heavy, long‑context workloads (example: 5.9× vs GLM‑5.1 in an 8K input → 64K output NVFP4 GB200 test using TRT‑LLM).
- Benchmarks: RULER (1M token) 94.7; PinchBench 90.0; IOI 2025 score 570.0; SWE‑Bench Verified 71.9; AA‑Omniscience non‑hallucination 78.7.
- Openness: weights, data, and recipes published under OpenMDW‑1.1; single NVFP4 checkpoint supports multiple deployment paths.
Practical translation
Those throughput gains matter most for decode‑heavy workloads—long outputs or multi‑step agents that generate a lot of tokens per decision. For heavy prefill workloads (short answers over many different prompts), gains narrow. Measurement stacks also affect numbers: NVIDIA used TRT‑LLM for tests while many comparators are profiled under vLLM, so replicate tests on your stack before committing.
How Nemotron 3 Ultra works (plain‑English technical explainer)
Nemotron 3 Ultra combines several engineering strategies targeted at agent economics:
- Mixture‑of‑Experts (MoE): Only a subset of the model’s experts activate for each token. Think of it as a team of specialists—only a few get called in per question—so you get large capacity without paying the full compute cost every step.
- Mamba‑Attention hybrid: Mamba layers provide sub‑quadratic per‑step scaling for long sequences (per‑step cost doesn’t grow with sequence length the same way self‑attention does). A smaller number of attention layers remain for precise recall where exact token relationships matter.
- LatentMoE routing: A routing variant that increases the number of experts considered per token while keeping routing cost predictable—more specialists without a proportional runtime hit.
- Multi‑Token Prediction (MTP): The model predicts multiple future tokens per forward pass. This enables speculative decoding strategies that improve throughput during long generation runs.
- NVFP4 quantization: NVIDIA’s 4‑bit format (E2M1) is used at scale during pretraining and in the shipped checkpoint; the final runtime mixes NVFP4 experts with FP8 and BF16 in other layers, yielding an effective ≈5.03 bits/element at parts of the model. The practical result: lower GPU memory use and cheaper inference when you’re already on NVIDIA hardware.
“Nemotron 3 Ultra is a very large sparse MoE tuned to keep accuracy high while making long‑running agent inference faster and cheaper.”
Training and post‑training highlights
- Pretraining: ~20 trillion tokens (split roughly 15T biased toward diversity and 5T biased toward higher quality). New additions include 173B refreshed GitHub code tokens (cutoff Sep 30, 2025).
- Post‑training: extensive supervised fine‑tuning (SFT) and reinforcement learning. Public totals report about 50M SFT samples and 2M RL tasks across 55 RL environments.
- New methods: MOPD (Multi‑teacher On‑Policy Distillation) scores student rollouts with domain‑specialized teachers to provide dense token‑level guidance; RLVR (Reinforcement Learning with Verifiable Reward) standardizes reward signals across many environments.
- Two training loss divergences were documented and fixed (one due to a gradient reduction change reverted to FP32; another mitigated by earlier learning‑rate anneal)—a level of transparency helpful for teams evaluating large‑scale pretraining risk.
“MOPD distills many domain‑specialized teachers into a single student by scoring student‑generated rollouts with dense token‑level guidance.”
Deployment and interoperability
NVIDIA ships a single NVFP4 checkpoint designed to run across Blackwell (native FP4), Hopper (W4A16), and Ampere paths. A W4A16 pathway allows MTP weights to fit on a single 8‑GPU H100 node—valuable when you want compact test deployments. Hosting/self‑serve options include Hugging Face, NVIDIA NIM, Nebius, OpenRouter, Together AI, Perplexity, and NeMo (NVIDIA‑NeMo) cookbooks on GitHub.
What to expect if you’re not on NVIDIA hardware
Significant compute and quantization advantages assume NVIDIA tooling and runtimes. Teams on non‑NVIDIA clouds should budget engineering effort to port models or accept narrower efficiency gains; running the model under different runtimes will change the throughput picture.
Key tradeoffs and limitations
- Decode‑heavy advantage vs. prefill‑heavy penalty: The sparse, Mamba‑attention design shines when you generate long outputs or run many agent steps. For workloads dominated by short generations or many distinct prompts (prefill‑heavy), Nemotron’s advantages shrink.
- Measurement differences: Benchmark numbers depend heavily on inference stacks (TRT‑LLM vs vLLM), quantization settings, and harnesses. Treat headline throughput numbers as directional until replicated on your stack.
- Distillation coverage risk: MOPD relies on domain teachers; if teachers don’t cover out‑of‑distribution cases, distilled behaviors may degrade unpredictably.
- Operational cost of pretraining pipelines: Large‑scale SFT/RL and MOPD loops carry real energy and engineering costs—consider whether fine‑tuning a smaller model or using hosted APIs is a better economic choice for your use case.
Reasoning modes: a practical knob for cost
Nemotron offers three reasoning modes: reasoning‑off, regular, and medium‑effort. Medium‑effort uses about 2.5× fewer tokens at the cost of roughly a 7% accuracy drop—meaning you can cut inference spend by about 60% per agent step while accepting a modest accuracy tradeoff. That’s a pragmatic lever when you run millions of small agent decisions daily.
Benchmarks and replication guidance
Headline benchmark numbers are promising but require careful replication. Where the numbers came from and what to validate:
- Throughput claim (~6×): from an NVFP4 GB200 test using TRT‑LLM with an 8K input → 64K output generation (5.9× vs GLM‑5.1 in that setup). Run the same test on your preferred runtime to see real impact.
- Long‑context evaluation: RULER at 1M tokens scored 94.7. If your use case needs 1M‑token recall, reproduce RULER‑style workloads with your tool calls to validate latency and downstream tool‑call costs.
- Suggested replication steps:
- Pick the inference stack you plan to use (TRT‑LLM, vLLM, or vendor runtime).
- Run an 8K→64K decode test and a long‑prefill (many short prompts) test to compare decode vs prefill behavior.
- Measure end‑to‑end latency including tool‑call overheads (API calls, database queries) not just pure token throughput.
Small hypothetical: support assistant cost comparison
Consider a persistent support assistant that must generate 10,000 tokens per session on average. If cost scales linearly with tokens and full‑effort mode is baseline, medium‑effort mode (2.5× fewer tokens) reduces token volume to ~4,000 tokens—roughly 40% of full cost per session. If your service runs 100,000 sessions a month, that delta compounds quickly. Combine this with sparse activation (only ~55B active parameters vs 550B total) and NVFP4 deployment on NVIDIA hardware, and the per‑session compute bill can shrink materially—assuming you replicate throughput on your infrastructure.
Decision checklist for CTOs and Heads of ML
- Are your agents long‑context (tens of thousands to 1M tokens) or do they make many tool calls per decision?
- Do you have an NVIDIA GPU footprint (Blackwell, Hopper, Ampere) or are you prepared to provision it?
- Can you tolerate a small, controlled accuracy drop for cost savings (e.g., medium‑effort mode ~7% accuracy loss)?
- Do you need open weights and the ability to run custom MOPD-style distillation, or will a hosted API suffice?
- Do you have engineering capacity to reproduce benchmarks on your inference stack (TRT‑LLM vs vLLM differences matter)?
How to test Nemotron 3 Ultra in your environment (quick PoC recipe)
- Obtain the NVFP4 checkpoint and NeMo cookbooks from the release repository (licensed under OpenMDW‑1.1).
- Stand up a small H100 cluster (8 GPUs) or use a hosted provider that supports NVFP4 checkpoints.
- Run two baseline tests: (A) decode‑heavy generation (8K prompt → 64K output) and (B) prefill‑heavy workload (many short prompts). Use both TRT‑LLM and vLLM if possible to compare runtimes.
- Measure: throughput (tokens/sec), end‑to‑end latency, memory footprint, and token cost per agent step including external tool latencies.
- Enable medium‑effort reasoning mode and re‑run tests to quantify cost vs accuracy tradeoffs.
- If consolidating domains, run a small MOPD distillation with one or two domain teachers and measure hallucination rates on a holdout set.
Limitations to test and monitor
- Out‑of‑distribution behavior after MOPD distillation.
- Real tool‑call latency and failure modes—benchmarks don’t account for downstream API unreliability.
- Portability of NVFP4 efficiency to non‑NVIDIA stacks.
- Operational cost of running large SFT/RL pipelines if you plan to replicate NVIDIA’s post‑training.
Final take
Nemotron 3 Ultra is a pragmatic engineering play that brings sparse MoE, long‑sequence layers, and hardware‑aware quantization together for agent economics. It won’t make every workload cheaper automatically—performance depends on your stack and workload mix—but for enterprises operating persistent, long‑context agents it offers a concrete path to lower per‑step inference cost and a useful reasoning mode to tune spend. The open release under OpenMDW‑1.1 makes it runnable and remixable, so run the recommended PoC, validate throughput on your preferred runtime, and treat MOPD distillation as a powerful but supervised tool: it works well when teachers cover the domain—and it needs monitoring when they don’t.
Next practical step: allocate a two‑week PoC to reproduce the decode‑heavy and prefill‑heavy tests on your infrastructure, and include a simple MOPD trial on one high‑value domain to measure hallucination risk and real cost savings.
Quick reference Q&A
How many parameters are active per token?
About 55 billion parameters are active per token from a 550B total, enabled by sparse MoE routing.
Why is it faster for long contexts?
LatentMoE routing, Mamba sub‑quadratic layers, and Multi‑Token Prediction (MTP) reduce per‑step compute growth with sequence length and enable speculative decoding, improving decode throughput.
Are the throughput claims apples‑to‑apples?
Not exactly—NVIDIA reported numbers using TRT‑LLM while some comparators use vLLM. Runtime, quantization, and workload skew (decode vs prefill) materially change the outcome; replicate tests on your stack before committing.