What Matters for NVFP4 Training? A Comparative Study of Low-Precision Pretraining Recipes
Authors: Anjulie Agrusa, Andrei Panferov, Elizabeth Wei, Keith Wyss, Paul Gibbons, Erik Schultheis, Jinhang Choi, Frank Sun, Tijmen Blankevoort, Dan Alistarh
Organizations: NVIDIA · Institute of Science and Technology Austria · Red Hat AI
Training large language models directly in 4-bit floating-point (FP) formats promises substantial improvements in throughput and energy efficiency. While some recipe design choices have been validated at scale, many promising approaches remain untested beyond small models and short token horizons, leaving open the question of which trends will hold. We present a systematic comparison of recent NVFP4 recipes at medium model scale, evaluating dense 8B and 30B-A3B MoE models trained for up to 1T tokens, with a focus on which ingredients are necessary for accuracy recovery. We propose a final recipe grounded in the principles behind established stable NVFP4 training at scale, incorporating state-of-the-art techniques such as unbiased gradient estimation with lower quantization error than stochastic rounding. To the best of our knowledge, this is the strongest FP4 training result demonstrated at this scale to date in loss gap to BF16. Through ablation studies, we find that: (i) each technique in the optimized recipe measurably improves loss trajectory, (ii) selective high-precision layers are necessary for recovering accuracy at scale, (iii) not all tensors in the backward pass benefit equally from de-biasing, leaving room to apply complementary error-reduction techniques to the remaining tensors.
Figures & tables
Figure 1: Left: Relative train loss difference between each NVFP4 recipe and BF16 (lower is better), trained with NVIDIA ’25 NVFP4 and Mosaic NVFP4 recipes to 1T tokens on Nemotron 3 Nano. Right: Cumulative recipe updates, each adding one Mosaic NVFP4 component, trained to 400B tokens on Nemotron 3 Nano. All recipes keep the last 15% of layers in BF16. Recipe updates are described in Table 1 .
Recipe
Weight Quant
Weight Re-Quant
Tiled Random Hadamard Transforms
Random Sign Vectors
Technique to Address Bias in Gradients
Four Over Six Tensors
NVIDIA ’25 NVFP4
2D
No
Dim-16 WGRAD
Static
SR
None
Update 1
1D
Yes
Dim-16 WGRAD
Static
SR
None
Update 2
1D
Yes
Dim-128 WGRAD, DGRAD
Resampled
SR
None
Update 3
1D
Yes
Dim-128 WGRAD, DGRAD
Resampled
MS-EDEN
W.T, X.T
Mosaic NVFP4
1D
Yes
Dim-128 WGRAD, DGRAD
Resampled
MS-EDEN
W, X, W.T, X.T
Table 1: Recipe improvements over the prior state of the art at this model and token scale. All recipes keep the last 15% of layers in BF16 unless otherwise noted.
Figure 2: Stability study of the Mosaic NVFP4 recipe with the last 15% of the network kept in BF16 vs. all layers quantized on the Nemotron-H 8B model.
Figure 3: Different backward-quantization schemes on Nemotron 3 Nano, with all layers quantized (left) or the last 15% of layers kept in BF16 (right). With all layers quantized, the configuration applying MS-EDEN to gradient tensors and Four Over Six scale selection to the remaining backward tensors, X.T and W.T, yields the lowest observed loss gap. At this model size and token horizon, the backward-pass techniques show no clear separation when the last 15% of layers are kept in BF16.
Figure 4: Percent relative train (left) and validation (right) loss difference compared to BF16 (lower is better) evaluated on the Nemotron-H 8B model to 1T tokens. The Mosaic NVFP4 recipe has improved training and validation loss over most of the token horizon.
Appendix figures & tables3 assets
Supplementary material from the paper’s appendix.
Appendix
Model
No. Mamba-2 Layers
No. Attention Layers
No. FFN/MoE † Layers
No. KV Heads
Active/ Total Parameters
Nemotron 3 Nano
23
6
23
2
3.2B / 31.6B
Nemotron-H
24
4
24
8
8B
Appendix
Table 2: Model parameters for each experimental setup. Active parameter counts exclude embeddings. † Nemotron 3 Nano uses MoE layers.
Model
Batch Size
Min LR
LR
Nemotron 3 Nano
3072
1e-5
1e-3
Nemotron-H
768
8e-6
8e-4
Appendix
Table 3: Training parameters for each experimental setup.
Task
NVIDIA ’25 NVFP4 (0–100)
Mosaic NVFP4 (0–100)
Noise Reference (%)
Δ (%)
Nemotron 3 Nano (30B-A3B)
General Knowledge
MMLU, 5-shot
67.5
68.4
0.9
+1.3
MMLU-Pro, 5-shot CoT
45.0
47.1
6.3
+4.7
Math Average
79.4
79.2
4.6
-0.3
(Math 500, 4-shot; GSM8K, 8-shot CoT)
Appendix
Table 4: Downstream-task scores and measured run-to-run variability. For individual tasks, the noise reference is the relative range across three repeated runs. For aggregate rows, it is an average weighted by the NVIDIA ’25 NVFP4 task scores. Boldface denotes differences outside the corresponding noise reference.
Training large language models at 4-bit precision is critical for efficiency. We show that nGPT, an architecture that constrains weights and hidden representations to the unit hypersphere, is inherently more robust to low-precision arithmetic. This removes the need for interventions-such as applying random Hadamard transforms and performing per-tensor scaling calculations-to preserve model quality, and it enables stable end-to-end NVFP4 training. We validate this approach on both a 1.2B dense model and hybrid (Mamba-Transformer) MoE models of up to 3B/30B parameters. We trace this robustness to the dot product: while quantization noise remains largely uncorrelated in both standard and normalized architectures, the signal behaves differently. In nGPT, the hypersphere constraint enhances weak positive correlations among the element-wise products, leading to a constructive accumulation of the signal across the hidden dimension while the noise continues to average out. This yields a higher effective signal-to-noise ratio and a flatter loss landscape, with the effect strengthening as the hidden dimension grows, suggesting increasing advantages at scale. A reference implementation is available at https://github.com/anonymous452026/ngpt-nvfp4
Maxim Fishman, Brian Chmiel, Ron Banner +2
∧NVIDIA · ◦Department of Electrical and Computer Engineering - Technion, Haifa, Israel
Recent NVFP4 pretraining methods mainly target transformer linear layers, leaving optimizer states, optimizer arithmetic and attention underexplored in 4-bit pipelines. This critical gap blocks stable full-stack 4-bit pretraining, as the three core modules exhibit unique numerical failure patterns: linear layers hit hard quantization noise limits with dimension-propagated error amplification; AdamW second moments are heavy-tailed non-negative values fragile to low-precision denominators; attention carries error-prone computation paths demanding strict forward-backward quantization consistency. We propose Full-Stack FP4, the first complete NVFP4 pretraining framework resolving all three stability bottlenecks via module-wise precision strategies. For linear projections, LoRA-SVD lightweight decomposition suppresses quantization noise and breaks the direct-quantization error ceiling, shrinking the linear-only loss gap from 1.40% to 0.61%. For optimizers, we design AdamW second-moment transformation for robust NVFP4 storage and fully support native NVFP4 Newton-Schulz iterations for the Root (Muon) optimizer. For attention, a mixed-precision scheme quantizes Q/K/V and backward dS while guarding vulnerable paths in BF16, paired with unified tensor reuse to sustain forward-backward alignment. We further analyze fast error accumulation in naive low-bit matrix multiplication and the extreme sensitivity of PV / dOV^T attention branches. All modules are plug-and-play with cumulative stability and efficiency improvements. Our 3B/64B-token pretraining validates near-BF16 performance with merely 1.47% loss gap, verifying feasible stable end-to-end NVFP4 LLM pretraining.
Siyu Ding, Mingchuan Ma, Jiabo Tong +3
Institute of Automation, Chinese Academy of Sciences · Sichuan University · Beijing Zhongguancun Academy +3
Training large foundation models at low numerical precision is one of the most promising directions for reducing the compute and memory cost of modern AI. Recent 4-bit floating-point formats such as MXFP4 and NVFP4 can be applied to linear GEMM operations in LLMs, but their limited dynamic range introduces numerical instability that prior work addresses by stacking stabilization mechanisms, typically executed at higher precision and partially eroding the efficiency gains that motivate FP4. In this work, we argue that numerical format design is itself a first-class lever for stable FP4 training, and present the first systematic study of FP4 LLM pretraining on energy-efficient Huawei Ascend NPUs. We compare the recently proposed HiFloat4 (HiF4) format against both MXFP4 and NVFP4, holding one recipe fixed across all three formats across dense (OpenPangu-1B, Llama3-8B) and Mixture-of-Experts (Qwen3-MoE-30B) architectures and executing all linear and expert GEMMs in FP4. At matched storage --- NVFP4 and HiF4 both spend 4.5 bits per value --- the three formats differ far more in what they require before they will train at all than in final accuracy. HiF4 reaches a relative loss of 1.55% with no stabilization, below fully stabilized MXFP4 (1.79%) and below NVFP4 carrying the per-tensor scaling it cannot train without (2.00%); NVFP4 diverges under every combination of stochastic rounding and Hadamard transform we tried. Our results suggest that stable, accurate FP4 training does not require an ever-growing stack of stabilization techniques; it requires the right numerical format.