Online Quantization During Training.

Dynamic activation scales, static weight scales, distribution drift, calibration, kernel fusion, and the cost of quantizing every step.

This chapter follows the series' four-layer pyramid: intuition first, then consequences, system design, and finally implementation-level checks. It is written to be useful both as a first explanation and as a review sheet before reading the primary papers.

What you should be able to do after reading

• Explain the mechanism without relying on the feature name.
• Trace the relevant tensors, losses, or messages through one concrete example.
• Distinguish a paper claim from an inference, implementation choice, or marketing shorthand.
• Design a minimal experiment that could prove the idea wrong.

Where this chapter fits in the ten-phase map

Low precision touches every earlier mechanism: attention projections, cached representations, expert FFNs, routers, and MTP branches. A format that works for one matrix may fail in a reduction or collective. Phase 8 therefore treats precision as part of the distributed system, not a checkpoint conversion.

The dependency is useful when debugging. If the model-level equation is correct but the measured result is poor, walk backward through representation, numerical format, memory layout, routing or communication, and finally the evaluation harness. The first broken contract is usually more actionable than the final benchmark delta.

1. Static calibration assumes a stable distribution

Post-training inference can estimate ranges from a calibration set and reuse them. During pretraining, parameter updates, curriculum, sequence length, and data domains continually move activation distributions. A fixed early scale can clip later outliers or waste resolution.

2. Online scaling follows the current tile

For each activation tile the kernel measures an absolute maximum or another statistic, derives an FP8 scale, quantizes, and immediately feeds the matmul. This responds to every batch but adds reductions and metadata movement to the critical path.

3. Weights occupy a middle ground

Weights change every optimizer step but are reused across many tokens within the step. Block scales can be recomputed after updates and reused across forward and backward operations. The optimal policy depends on optimizer sharding and weight layout.

4. Max scaling is robust but noisy

An instantaneous max protects all values but a single transient outlier can coarsen the tile. Percentile clipping, delayed scaling, or amax histories trade clipping against stability. Any smoother introduces lag, which can be harmful during rapid distribution shifts.

5. Fusion decides whether online is affordable

Separate max, scale, cast, and GEMM kernels repeatedly move the tensor through memory. Fused kernels compute local statistics and convert close to consumption. The algorithm and the kernel cannot be evaluated independently.

Engineering lens. For every concept above, identify the tensor, state, metric, or system boundary that makes it observable. Then ask which assumption would make the claim fail. This keeps the chapter testable instead of leaving it as architecture vocabulary.

Worked example

Simulate a tile whose standard deviation doubles over 100 steps and receives a rare 20-sigma outlier. Compare fixed calibration, current-max, and exponential amax history on clipping rate and mean error.

Do the arithmetic with small dimensions first. Small examples expose index shifts, hidden assumptions, and missing denominators that disappear inside a billion-parameter headline. Once the hand-worked result is correct, automate it and compare the program output against the same values.

Implementation and measurement plan

Log scale distributions and saturation rates per layer over training. Alert on abrupt shifts. Benchmark fused and unfused paths, and keep a BF16 escape hatch for layers whose dynamic range defeats FP8.

1. State the exact model, checkpoint, hardware, and date behind every numerical claim.
2. Separate algorithmic complexity, theoretical FLOPs, measured latency, memory, and end-to-end cost.
3. Build a small reference implementation before optimizing kernels or distributing it.
4. Compare against an equal-compute or equal-parameter baseline and report the denominator.
5. Record failure cases and scope limits beside the successful result.

From a paper claim to an engineering contract

The primary anchor for this chapter is DeepSeek-V3 Technical Report from DeepSeek-V3. Reading a number from that source is only the first step. A reproducible contract has four layers:

Layer	Question to write down	Evidence
Mechanism	What operation, loss, state, or routing decision changes?	Equation, pseudocode, tensor shapes
Implementation	How is it realized on the named hardware and software stack?	Kernel, precision, layout, process groups
Measurement	Which denominator and baseline make the comparison fair?	Raw metrics, config, repeated runs
Scope	Where should the claim stop being trusted?	Failure cases, ablations, dated limitations

This separation prevents a frequent error in frontier-model writing: converting a theoretical reduction into a latency promise, or converting one internal benchmark into a universal quality ranking. The implementation can fail to realize the algorithm, and the workload can fail to expose the intended benefit.

Failure modes and misleading shortcuts

• Calling all dynamic quantization online training ignores weight reuse.
• Amax histories can lag regime changes.
• Percentile clipping may erase rare but important signals.
• Scale synchronization across shards can add communication.
• Calibration on evaluation data contaminates conclusions.

These are not footnotes. Frontier-model engineering is dominated by boundary conditions: a method can be mathematically correct and still lose to memory traffic, data skew, numerical drift, evaluation leakage, or a poorly stated comparison. A credible result makes those boundaries visible.

How to audit claims about this topic

Rewrite each claim with its missing boundary: name the exact mechanism, identify the tensor or resource it changes, and attach the workload and measurement. Then construct a counterexample at the edge of the claim. If a sentence cannot survive that rewrite, treat it as orientation—not evidence.

Next, trace provenance. Prefer the primary report for configuration and results, the released code for implementation behavior, and your own profiler for product performance. Secondary explainers are valuable for intuition but should not silently become the source of a numerical claim.

Decision guide: when should you use this idea?

Use it when the bottleneck named in the thesis appears in profiler traces or controlled quality experiments, the necessary kernels and runtime support exist, and the added system complexity can be observed in production. Start with the smallest configuration that exposes the bottleneck.

Delay it when a dense or higher-precision baseline does not yet converge, the evaluation harness is unstable, or the claimed resource is not limiting the workload. Sophisticated architecture cannot compensate for an invalid baseline.

Reject it when its benefit exists only under a denominator irrelevant to the product—for example, theoretical FLOPs while user latency worsens—or when numerical, safety, or operational regressions exceed the measured gain.

Hands-on study lab

1. 1. Implement three scale policies.
2. 2. Plot saturation through a curriculum change.
3. 3. Measure quantization overhead separately from GEMM.
4. 4. Choose policies for weights, activations, and gradients.

For each exercise, save the configuration, a tiny deterministic fixture, the raw measurements, and one failed case. The goal is not merely to make the code run; it is to make the conclusion independently checkable.

Quick self-check

What is the central idea?

Training activations change with data and optimization, so their scales must be refreshed online; weights change more slowly and permit different caching and update strategies.

What is the most common reading mistake?

Calling all dynamic quantization online training ignores weight reuse.

What evidence should I demand?

An exact configuration, a fair baseline, primary-source support, end-to-end measurements, and failure cases at the limits of the claim.

How do I explain it to a new engineer?

Begin with the bottleneck, show one tiny worked example, trace the changed state, and only then introduce the official name. Finish by naming one situation where the method will not help.

How do I review an implementation?

Check indexing and masks, parameter sharing, dtype transitions, layouts, process-group scope, raw metric denominators, and behavior under an adversarial or worst-case fixture. A passing happy-path shape test is not enough.

Teach-back synthesis

Close the page and reconstruct the argument in five sentences: the bottleneck; the mechanism; the state or tensor that changes; the fair measurement; and the main failure mode. Then reopen the page and compare. If you can repeat the feature names but cannot state those five sentences, revisit the worked example.

Finally, connect the idea to two neighboring phases. DeepSeek's advantage is not one isolated invention: compressed attention changes the cache, sparse experts change active compute, FP8 changes arithmetic and bandwidth, distributed schedules hide communication, and reasoning training spends the resulting capacity differently. The series becomes useful when those dependencies form one mental model.

Key takeaways

• Dynamic activation scales, static weight scales, distribution drift, calibration, kernel fusion, and the cost of quantizing every step.
• The mechanism, training recipe, runtime implementation, and measured product behavior are separate layers of evidence.
• Numbers remain meaningful only with their workload, precision, hardware, context length, and date attached.
• A small reproducible test is more valuable than a large uncheckable diagram.

Primary sources and further reading

• DeepSeek-V3. DeepSeek-V3 Technical Report.
• Micikevicius et al.. FP8 Formats for Deep Learning.
• PyTorch. Automatic Mixed Precision documentation.

Source note: explanations and worked examples here are original. Numerical claims are scoped to the linked reports; rapidly changing model comparisons are dated in the article itself.