Paper Overview
Field: Machine Learning
Authors: Yi Pan, Haocheng Xi, Kan Zhu, Xingyang Li, Yibo Wu, Mayank Mishra, Hongtao Zhang, William X. Zheng, Baris Kasikci, Song Han, Kurt Keutzer, Rishabh Iyer, Ion Stoica
arXiv: 2609.38166
Abstract (translated)
Recent LLMs increasingly adopt hybrid designs that replace standard attention with linear attention, such as Gated DeltaNet (GDN) and Kimi Delta Attention (KDA). Although they compress the context into a fixed-size recurrent state and substantially reduce the cost of long-context processing, repeatedly reading and updating that state remains a major inference bottleneck. Quantization offers a natural way to reduce this cost, but can significantly degrade model quality due to the accumulation of rounding errors and the presence of outlier rows and columns in the state.
LeapQuant is a training-free method that achieves near-lossless performance under 8-bit recurrent-state quantization:
1. Per-window quantization: To mitigate error accumulation, it skips a window of tokens and quantizes the state only once at the end of the window. Within the window, outputs are computed from a fixed low-bit state plus a high-precision buffer update. 2. Compensator Tokens: To reduce per-quantization error, LeapQuant keeps the largest outlier values in the state as a small number of high-precision compensator tokens that share the update path with real tokens. 3. Residual smoothing: The remaining residual is smoothed to further reduce error before quantization.
Results
- Evaluated on the Qwen, Kimi, and GLM model families
- Accuracy comparable to the FP32 baseline
- Kernel-level speedup of 2.05-3.70x on average
- End-to-end inference speedup of up to 1.47x on NVIDIA B200, RTX PRO 6000, and RTX 5090 GPUs
- Paper: https://arxiv.org/abs/2609.38166