STEPQuant: When and Where Errors Matter in Delta-Rule Recurrent State Quantization

Bingchen Yao, Haobo Xu, Haokun Lin, Yichen Wu, Ziyu Guo, Renrui Zhang, Zhichao Lu, Zhenan Sun and 1 others

Zhejiang University · Institute of Automation, CAS · Tsinghua University · City University of Hong Kong · Harvard University · The Chinese University of Hong Kong

Published September 29, 2026 · on the feed October 8, 2026 · ▲ 120 · arXiv 2609.38169

Efficiency & inferenceModel architecture Full code arXiv ↗Hugging Face ↗

The abstract

Linear attention replaces growing KV caches with fixed-size recurrent states, yet these persistent states can become a substantial memory bottleneck under concurrent serving. Directly quantizing recurrent states to low precision often leads to severe accuracy degradation, as quantization errors propagate through successive state updates. We discover that the impact of these errors depends on two complementary dimensions: temporally, errors in long-lived memory can persist across many decoding steps; spatially, errors in different key rows affect model outputs differently, while state magnitudes vary substantially along both rows and columns. Motivated by these observations, we propose STEPQuant, a spatial-temporal post-training quantization framework for Delta-rule recurrent states. STEPQuant allocates precision according to error magnitude and memory lifetime, and jointly fits key-row and value-column scales based on state distributions and key-row impact on output error. Experiments on Qwen3.8-27B and Kimi-Linear-48B-A3B-Instruct across both long- and short-generation benchmarks show that STEPQuant closely matches FP32-state accuracy under a nominal 6-bit budget and outperforms uniform INT8 in its 4-bit configuration. Integrated into SGLang with optimized GPU kernels, 6-bit STEPQuant achieves over 5x recurrent-state compression and reduces total serving memory by up to 68.7%. Our code is available at https://github.com/Dreamer-Toby/STEPQuant.

The Brief

2:50

A short podcast summary of the paper. Written and voiced by AI.

Transcript

STEPQuant. When and Where Errors Matter in Delta-Rule Recurrent State Quantization. By Bingchen Yao and eight others, from Zhejiang University, the Institute of Automation, Chinese Academy of Sciences, and four other institutions. Published on the twenty-ninth of September. Its code repository is worked out: about eighty-five source files, with a readme.

Linear attention replaces the growing KV cache with a recurrent state of fixed size. Under concurrent serving, though, those persistent states add up, and can become a substantial memory bottleneck. The obvious remedy is to quantize the states directly to low precision, and that often degrades accuracy severely, because quantization errors propagate through every successive state update. The appeal of linear attention is that memory stops growing with the sequence. A fixed size is not the same as a small one, though, once many states are held at the same time.

The authors find that the impact of those errors depends on two complementary dimensions. In time, errors in long-lived memory can persist across many decoding steps. In space, errors in different key rows affect model outputs differently, while state magnitudes vary substantially along both rows and columns. Put together, an error is not just an amount. It has a duration, how long it survives in the state, and an address, which row it sits in, and both change what it costs. STEPQuant is a spatial-temporal post-training quantization framework for Delta-rule recurrent states, built on both observations.

It allocates precision according to two quantities: the magnitude of the error, and the lifetime of the memory. It also fits scales for key rows and value columns jointly, based on the state distributions and on how strongly each key row affects output error. Precision, in other words, is not spread uniformly. Parts of the state whose errors would be large or long-lived get more of it, and the row and column scales are fitted together rather than one direction at a time, because magnitudes vary along both.

Experiments use Qwen3.8-27B and Kimi-Linear-48B-A3B-Instruct, across both long and short generation benchmarks. Under a nominal six-bit budget, STEPQuant closely matches the accuracy of FP32 states, and its four-bit configuration outperforms uniform INT8. The two bit widths tell two parts of the story: six bits is where accuracy is kept, and four bits is where it still beats a uniform eight-bit scheme. Integrated into SGLang with optimized GPU kernels, six-bit STEPQuant achieves more than five times compression of the recurrent state, and reduces total serving memory by up to sixty-eight point seven percent.

The title asks when and where errors matter, and the method is that answer turned into a budget. Bits go where an error would live a long time, or land on a key row that moves the output, and the scales follow the shape of the state along both of its axes.

Paper Quest · 7 chapters · about 40 min

Play this paper

Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.

Chapter 1 🧩 · The problem

Fixed-size memory sounded like the end of memory trouble. Then came many users at once.

You serve a hybrid language model whose linear layers keep a fixed-size recurrent state per request instead of a growing cache. With many requests at once, those states pile up and eat memory.

The road ahead

  1. 1 · The problem ~6 min Linear-attention models keep a fixed-size state per request, and rounding those states to save memory makes errors travel forward and wreck accuracy.
  2. 2 · What came before ~3 min
  3. 3 · The key idea ~9 min Spend bits where a state error is large and long-lived, weight key rows by how much they move the output, and scale rows and columns together.
  4. 4 · Choose your own research ~3 min
  5. 5 · Build the method ~8 min STEPQuant first sets bit widths offline from error and lifetime, then fits row and column scales as it stores each state, inside SGLang kernels.
  6. 6 · The experiment ~6 min You’ll guess: Running six-bit STEPQuant inside SGLang, by up to how much did total serving memory shrink?
  7. 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Join free to play the whole quest ›

Free, with Google or an email address. Your stars and progress are kept.

KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.