<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>양자화 on Warpspace Blog</title><link>https://blog.caveduck.io/tags/%EC%96%91%EC%9E%90%ED%99%94/</link><description>Recent content in 양자화 on Warpspace Blog</description><generator>Hugo -- 0.154.5</generator><language>en-US</language><lastBuildDate>Mon, 11 May 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://blog.caveduck.io/tags/%EC%96%91%EC%9E%90%ED%99%94/index.xml" rel="self" type="application/rss+xml"/><item><title>Efficient ML #5, QAT: Undoing Quantization Error During Training</title><link>https://blog.caveduck.io/posts/quantization-aware-training/</link><pubDate>Mon, 11 May 2026 00:00:00 +0000</pubDate><guid>https://blog.caveduck.io/posts/quantization-aware-training/</guid><description>PTQ works for big models but collapses on small models and low bits (down to 13.6% at 2-bit). The fix is QAT: folding quantization into training itself. We insert fake quantization into the forward pass and punch through round&amp;rsquo;s zero-gradient problem with the STE (Straight-Through Estimator). If round has zero derivative, how does anything learn? Answered with plots measured directly on an MNIST MLP.</description></item><item><title>Efficient ML #4, Low-bit Quantization: Fighting Outliers</title><link>https://blog.caveduck.io/posts/low-bit-quantization/</link><pubDate>Mon, 04 May 2026 00:00:00 +0000</pubDate><guid>https://blog.caveduck.io/posts/low-bit-quantization/</guid><description>FP4 has only 15 representable values, so how do modern GPUs run inference in 4 bits? The culprit that breaks low-bit quantization is the outlier. From an experiment where a single outlier erases an entire layer, to four cures, group quantization (MXFP4), KL clipping, AdaRound, and Hadamard rotation, we verify each in code, including an experiment where 2-bit accuracy comes back from 53% to 97%.</description></item></channel></rss>