Why Gated DeltaNet Survives 4-Bit Quantization: NVFP4 W4A4 for the Recurrent Half of a Hybrid 27B LLM
Not on the map. Why?
Abstract (arXiv)
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
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 13 of its 15 references that are in the map. First posted on arXiv 3 Sep 2026.
Builds on
13 of 15 references.
References · 13
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
- 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,283
- 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,270
- 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 881
- 2024KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cachecited by 604
- 2024KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantizationcited by 571
- 2024Parallelizing Linear Transformers with the Delta Rule over Sequence Lengthcited by 373
- 2023Microscaling Data Formats for Deep Learningcited by 132
- 2025Pretraining Large Language Models with NVFP4cited by 67
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Low-Bit Recurrent States in Hybrid Language Modelscited by 0
- 2026Low-Bit Recurrent States in Hybrid Language Models25 Sep 2026
Similar, not cited
Close in wording, no citation either way
- 2026DAMP: Decay-Aware Mixed-Precision Recurrent-State Quantization
- 2026STEPQuant: When and Where Errors Matter in Delta-Rule Recurrent State Quantization
- 2026Gated DeltaNet-2: Decoupling Erase and Write in Linear Attention
- 2024BitNet a4.8: 4-bit Activations for 1-bit LLMs
- 2026Provably Shorter Scratchpads in Hybrid DeltaNet-Attention Decoders
- 2026DeltaLog: Deferred Materialization of Recurrent States for Linear Attention Decoding
- 2026HyQuant: Hybrid-Precision Quantization for LLM Attention
- 2025What Layers When: Learning to Skip Compute in LLMs with Residual Gates