Sergii Kozyrev, Davyd Maiboroda
A rigorous, mechanistically deep refutation of a live community assumption with an immediately deployable recipe and released checkpoint, bounded by single-model/single-format scope.
Hybrid LLMs pair softmax attention with linear-attention layers such as Gated DeltaNet (GDN), whose recurrent state summarizes the context in fixed size. Early community 4-bit quantizations of Qwen3.8-27B (48 GDN layers, 16 attention layers) left the GDN block in 8- or 16-bit precision -- especially its decay and write-strength gates -- on the intuition that errors in a recurrence accumulate over long contexts. We test that intuition by building Minima: NVFP4 W4A4 on all 496 linear layers, GDN included. Across perplexity at 4K/32K, MMLU-Pro, GSM8K, AIME'25, GPQA-Diamond, LiveCodeBench, and RULER retrieval to 64K, Minima matches BF16 within seed noise (5-task average -0.52) while being the smallest (17.5 GiB) and fastest-prefill (+14-19%) recipe we compare, and its 32K perplexity gap shrinks with position. A four-part mechanism study explains why: (i) NVFP4's 16-element block scaling localizes the residual stream's extreme outliers, equalizing activation error across layer roles; (ii) the supposedly fragile gate projections are the least sensitive -- softplus/exponential and sigmoid parameterizations compress ~11% GEMM error to ~2% output error; (iii) the delta-rule recurrence holds injected noise at a flat plateau over 32K tokens and forgets a state impulse within hundreds of steps, because each write overwrites the state along the current key direction; (iv) the per-token quantization cost washes out with context instead of compounding. We also repair a global-scale mismatch that arises when per-module-calibrated NVFP4 checkpoints are served by kernels that fuse those modules into one GEMM, and show calibrated FP8 KV-cache scales are performance-free. The result: a practical recipe -- quantize everything, ship KV scales -- and a mechanistic account of why the recurrent half of a hybrid LLM is the easy half to quantize. Checkpoint: https://huggingface.co/minima-ai/mnma_qwen3.8_27b_nvfp4
This paper challenges a widely-held community assumption: that the recurrent (linear-attention/Gated DeltaNet) half of a hybrid LLM must be protected from aggressive quantization because per-step errors accumulate over long contexts. The authors build "Minima," a fully NVFP4 W4A4 quantization of all 496 linear layers of a 27B hybrid model (48 GDN + 16 attention layers), including the previously-protected decay (`a`) and write-strength (`b`) gate projections. The empirical result is that this matches BF16 within seed noise across six benchmark suites plus long-context retrieval, while being the smallest (17.5 GiB vs 50 GiB) and fastest-prefill recipe. Crucially, the paper does not stop at "it works" — it delivers a four-part mechanistic account of *why* the recurrent half is actually the *easy* half to quantize. This dual empirical-plus-mechanistic contribution is the paper's main strength.
The rigor here is notably above typical quantization papers. The mechanism study is the standout: (i) activation statistics captured on real 32K-token inputs showing block-scaling equalizes error across layer roles; (ii) per-projection sensitivity replay (96 replays) demonstrating the "fragile" gates are the least sensitive because softplus/exp/sigmoid compress ~11% GEMM error to ~2% output error; (iii) an FP32 lockstep recurrence experiment proving injected state error plateaus rather than compounds over 32K tokens, with an elegant explanation grounded in the delta rule's overwrite-along-key-direction property; (iv) a positional NLL decomposition showing the quantization gap *shrinks* with context. The claims are tightly coupled to controlled experiments, and error propagation is verified against a reference implementation to rounding-floor precision (Appendix A numerics are carefully done).
The serving-stack findings (§6) add credibility rather than distract: the authors discovered and repaired a global-scale mismatch between per-module calibration and fused-GEMM serving that silently corrupted the gates and *faked* better long-context perplexity — a subtle trap that would have invalidated naive comparisons. They also caught a composite-vs-text-only serving path confound and a chat-template harness invalidity for thinking models. This methodological self-scrutiny is unusually honest and strengthens confidence in the headline numbers. The per-sample validity gates, four-seed CIs, and truncation reporting are appropriate controls.
Weaknesses in rigor: single model family, single size, single quantization format. 128K+ behavior is admitted extrapolation. Minima+scales task scores are inherited rather than re-measured (justified but not ideal). Decode overhead (2–4% behind a competitor) is attributed to a kernel artifact without deep investigation.
The practical recipe — "quantize everything, ship KV scales" — directly reduces serving cost and memory for hybrid LLMs, a rapidly growing architecture class (Mamba, GDN, and hybrids are increasingly deployed). If the mechanistic account generalizes to other log-space-gated recurrent mixers, it becomes a reusable design principle: architects can trust that gates parameterized in log space are inherently quantization-robust. The released checkpoint and the explicit fused-scale repair are immediately actionable for anyone deploying hybrid models on NVFP4-capable hardware.
The impact ceiling is bounded by the specificity: the gate-shielding argument explicitly depends on the softplus/exponential parameterization, and the paper concedes that linearly-parameterized decay mixers may not benefit. So the finding is a principled but architecture-conditional result rather than a universal law.
Highly timely. It sits precisely at the intersection of two current trends — hardware-native 4-bit microformats (NVFP4) and hybrid linear-attention architectures — that the authors correctly note "have only just begun to meet." No prior work had studied quantization of recurrent-state mixers in large hybrids; public recipes simply exempted them. The paper addresses a live, real bottleneck. (I note the paper is dated 2026 and references a model, "Qwen3.8-27B," and concurrent work not yet extant; I evaluate on internal merit assuming the technical content is as described.)
Strengths: The refutation of a load-bearing community assumption with both controlled evidence *and* a mechanistic explanation; unusually careful serving-stack forensics; honest reporting of the residual perplexity gap; released artifact. The paper reframes a heuristic ("protect the recurrence") into an architectural understanding, and shows the protected projections were exactly the safe ones — a genuinely counterintuitive, well-supported inversion.
Limitations: Narrow evaluation scope (one model, one format); no 128K+ stress test; the mechanism is architecture-conditional; concurrent QAT work (QUASAR) is acknowledged but not benchmarked; some numbers inherited rather than re-measured. The commercial value is real but incremental (a better quantization recipe), not paradigm-defining.
Reproducibility is strong for a systems paper: exact serving stack (vLLM 0.27.1, TP=1, specific GPU), calibration set size, harness details, per-layer statistics, and a public checkpoint. The interdisciplinarity is low — this speaks to ML-systems and efficient-inference practitioners specifically. The refutation value is genuine: the paper explicitly overturns a community precision-map heuristic ("errors in the gates should compound fastest"), which is exactly the kind of load-bearing-assumption correction that scores above typical work. The foundationality is moderate — the paper's own related-work notes that a concurrent in-group effort already treats this result as a "foundation" for sub-4-bit recipes, suggesting real building-block value within its niche.
Overall, this is a well-executed, mechanistically deep, timely systems paper with a genuinely surprising and useful conclusion, bounded mainly by single-model/single-format evaluation scope.
Generated Sep 4, 2026
A rigorous, mechanistically deep refutation of a live community assumption with an immediately deployable recipe and released checkpoint, bounded by single-model/single-format scope.