ResidualQuant: KV Cache Quantization for Looped Transformers with 2-Bit Residuals
On the map: Efficient LLM inference and serving → KV cache quantization
Abstract (arXiv)
Looped Transformers improve parameter efficiency by repeatedly applying shared Transformer blocks over multiple recurrent loops, increasing computational depth without increasing the parameter count. However, KV cache memory still scales with the number of loops, becoming a key memory bottleneck that limits batch size and inference throughput. KV cache quantization can alleviate this bottleneck, but existing methods often suffer substantial accuracy degradation at aggressive low-precision regimes. We observe that looped Transformers offer a unique opportunity: KV states across loops are highly similar. Based on this observation, we propose ResidualQuant, which uses the final-loop KV states as a reference and represents the remaining loops with low-precision residuals. Our method further combines least-square scaling and rotations applied to the residuals, as well as loop-wise mixed precision, to enable accurate quantization down to INT2 while retaining efficient reconstruction. Across multiple looped Transformer models and mathematical reasoning and code generation benchmarks, ResidualQuant consistently improves the accuracy-memory tradeoff over state-of-the-art rotation-based KV quantization. In particular, our method retains accuracy close to BF16 under mixed-precision settings while reducing theoretical KV storage by 80.7%, achieving up to 13.0% higher accuracy than the rotation-based baseline at the same memory budget. On an RTX 5090, the reduced KV memory traffic improves fixed-batch decode throughput by up to 2.73x, while the smaller memory footprint enables up to 2x larger batches, improving peak throughput by up to 4.15x.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in KV cache quantization, one of 12 directions in Efficient LLM inference and serving. Builds on 17 of its 37 references that are in the map. First posted on arXiv 7 Oct 2026.
Builds on
17 of 37 references.
Closest ancestors · 2
Same direction, newest first
- 2026Output-Aware Rotation for INT2 KV-Cache Quantization3 Aug
- 2026OSCAR: Offline Spectral Covariance-Aware Rotation for 2-bit KV Cache Quantization18 May
Other references · 15
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2021Program Synthesis with Large Language Modelscited by 3,509
- 2016Adaptive Computation Time for Recurrent Neural Networkscited by 479
- 2025Hierarchical Reasoning Modelcited by 167
- 2025Scaling Latent Reasoning via Looped Language Modelscited by 145
- 2025Less is More: Recursive Reasoning with Tiny Networkscited by 38
- 2025Parallel Loop Transformer for Efficient Test-Time Computation Scalingcited by 23
- 2026SMELT: Scaling Laws for Compute-Matched MoE Looped Transformerscited by 12
- 2026Memory-Efficient Looped Transformer: Decoupling Compute from Memory in Looped Language Modelscited by 11
- 2026Thinking with Looped Flowscited by 6
- 2026LoopQ: Quantization for Recursive Transformerscited by 4
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026OCTOPUS: Optimized KV Cache for Transformers via Octahedral Parametrization Under optimal Squared error quantization
- 2026WUSH-KV: KV Cache Quantization with Data-Adaptive Transforms
- 2026Quantizing Looped Transformers: Feedback Exposure and Calibration Blindness
- 2026The Residual Stream Is All You Need: On the Redundancy of the KV Cache in Transformer Inference
- 2024KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantization
- 2024QJL: 1-Bit Quantized JL Transform for KV Cache Quantization with Zero Overhead
- 2026Sequential KV Cache Compression via Probabilistic Language Tries: Beyond the Per-Vector Shannon Limit
- 2026OScaR: The Occam's Razor for Extreme KV Cache Quantization in LLMs and Beyond