<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Quantization on Jaehun's Blog</title><link>https://jaehun.me/en/categories/quantization/</link><description>Recent content in Quantization on Jaehun's Blog</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Wed, 09 Sep 2026 13:09:39 +0000</lastBuildDate><atom:link href="https://jaehun.me/en/categories/quantization/index.xml" rel="self" type="application/rss+xml"/><item><title>Hardware-Aware FP4 FlashAttention-4</title><link>https://jaehun.me/en/posts/hardware-aware-fp4-flashattention-4/</link><pubDate>Mon, 07 Sep 2026 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/hardware-aware-fp4-flashattention-4/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2609.04105v1"target="_blank"&#10; class="inline-flex items-center gap-1"&#10; &gt;Paper&lt;svg class="h-3 w-3 flex-shrink-0" id="external-link" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;path fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M15 3h6v6m-11 5L21 3m-3 10v6a2 2 0 0 1-2 2H5a2 2 0 0 1-2-2V8a2 2 0 0 1 2-2h6"/&gt;&lt;/svg&gt;&#10; &lt;/a&gt;&lt;/p&gt;&#10;&lt;h2 id="why-dont-fp4-tensor-cores-make-attention-faster-blackwell-flashattention-4-solved-with-direct-p-and-quantized-backprop"&gt;Why Don&amp;rsquo;t FP4 Tensor Cores Make Attention Faster? Blackwell FlashAttention-4, Solved with Direct-P and Quantized Backprop&lt;a href="#why-dont-fp4-tensor-cores-make-attention-faster-blackwell-flashattention-4-solved-with-direct-p-and-quantized-backprop" class="heading-anchor" aria-label="Link to this section"&gt;&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt; — Blackwell&amp;rsquo;s FP4 tensor cores handle matrix multiplication far faster than BF16, but attention does not automatically inherit that benefit, because a &amp;ldquo;middle operation&amp;rdquo; — &lt;strong&gt;softmax&lt;/strong&gt; — sits between the &lt;em&gt;two matrix multiplications&lt;/em&gt;. This paper shortens the critical path with &lt;strong&gt;Direct-P&lt;/strong&gt;, which reframes softmax probability generation not as a sequential &amp;ldquo;accurate exponential → round&amp;rdquo; path but as a problem of &lt;strong&gt;directly classifying scores into E2M1 codes&lt;/strong&gt;, achieving up to &lt;strong&gt;2.13×&lt;/strong&gt; forward throughput over BF16 on an NVIDIA GB200 (source: §Abstract). For training, backward reuses the quantization state that forward produced to speed a single step of an 8B model by up to &lt;strong&gt;1.14×&lt;/strong&gt;, but lowering P/V to MXFP4 makes &lt;strong&gt;every trajectory diverge&lt;/strong&gt;, so P/V must be kept in FP8 (source: §7.6).&lt;/p&gt;</description></item><item><title>Why Gated DeltaNet Survives 4-Bit Quantization: NVFP4 W4A4 for the Recurrent Half of a Hybrid 27B LLM</title><link>https://jaehun.me/en/posts/why-gated-deltanet-survives-4-bit-quantization-nvfp4-w4a4-for-the-recurrent-half-of-a-hybrid-27b-llm/</link><pubDate>Mon, 07 Sep 2026 00:00:00 +0900</pubDate><guid>https://jaehun.me/en/posts/why-gated-deltanet-survives-4-bit-quantization-nvfp4-w4a4-for-the-recurrent-half-of-a-hybrid-27b-llm/</guid><description>&lt;p&gt;&lt;a&#10; href="https://arxiv.org/abs/2609.04098"target="_blank"&#10; class="inline-flex items-center gap-1"&#10; &gt;Paper&lt;svg class="h-3 w-3 flex-shrink-0" id="external-link" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 24 24"&gt;&lt;path fill="none" stroke="currentColor" stroke-linecap="round" stroke-linejoin="round" stroke-width="2" d="M15 3h6v6m-11 5L21 3m-3 10v6a2 2 0 0 1-2 2H5a2 2 0 0 1-2-2V8a2 2 0 0 1 2-2h6"/&gt;&lt;/svg&gt;&#10; &lt;/a&gt;&lt;/p&gt;&#10;&lt;h2 id="the-recurrent-half-is-the-easy-to-quantize-half-why-gated-deltanet-survives-at-4-bits"&gt;The Recurrent Half Is the Easy-to-Quantize Half: Why Gated DeltaNet Survives at 4 Bits&lt;a href="#the-recurrent-half-is-the-easy-to-quantize-half-why-gated-deltanet-survives-at-4-bits" class="heading-anchor" aria-label="Link to this section"&gt;&lt;/a&gt;&lt;/h2&gt;&lt;p&gt;&lt;strong&gt;TL;DR&lt;/strong&gt; — The 48 recurrent &lt;strong&gt;Gated DeltaNet (GDN)&lt;/strong&gt; layers of a hybrid 27B LLM (Qwen3.8-27B) have until now been protected at 8–16 bits, on the intuition that &amp;ldquo;error accumulates across the context.&amp;rdquo; This paper shows that intuition is &lt;strong&gt;exactly backwards&lt;/strong&gt;. &lt;code&gt;Minima&lt;/code&gt;, which quantizes &lt;strong&gt;all 496 layers — GDN gates included — to NVFP4 W4A4&lt;/strong&gt;, matches BF16 within seed noise on 6 benchmarks (5-task average −0.52) while also being the smallest (17.5 GiB) and the fastest at prefill (+14–19%). On top of that, a four-stage mechanistic study delivers an architecture-level account of &lt;strong&gt;why&lt;/strong&gt; — block scaling localizes outliers, gate nonlinearity compresses noise, and the delta rule actively erases state error.&lt;/p&gt;</description></item></channel></rss>