ResidualQuant: 2-bit residuals cut Looped Transformer KV cache 80%, 3.3x decode
sehoonkim418 · x · 2026-10-12
KAIST's SEAL lab introduces ResidualQuant, tackling the KV cache bottleneck of Looped Transformers with 2-bit residual quantization.
- Problem: Looped Transformers share weights across loops to add depth, but each loop produces its own KV cache—memory still grows with recurrent depth, context length, and batch size.
- Method: Exploiting strong similarity across loops, it stores the final loop as a shared INT4 anchor, predicts earlier loops via least-squares scaling, and encodes only the residual in INT2; shared rotations, loop-wise precision allocation, and mixed precision remove the need for a separate BF16 region.
- Results: On Ouro-1.4B at 8k context, logical KV storage drops 80.7%, peak decode throughput hits 3.27×, while recovering BF16-level accuracy (76.0% on MATH500).
Paper is out; code coming soon.
More from Infra
- Palo Alto Networks Acquires Portkey, the AI Gateway Passing Every Enterprise Prompt and Dollar — YvesMulkers · 2026-10-12
- Anthropic's Compute Spree: Ex-Bitcoin Miners IREN, TeraWulf Join $530B Infrastructure Push — tengyanAI · 2026-10-12
- Random Gemini 400 errors on Cloudflare Workers traced to HKG datacenter routing — sujingshen · 2026-10-12
- DeepSeek v4.1 Flash served at 103 tok/s on 2x DGX Spark with vLLM — EAccelerate_42 · 2026-10-12
- ColGrep-Agent-2B cuts Claude Code API tokens 34% and costs 40% with local code search — IgorCarron · 2026-10-12
- UK Minister Backs Hardware-Enabled AI Verification, Betting on Britain's Chip Design Expertise — S_OhEigeartaigh · 2026-10-12