Sign inGet started
Paper · arXiv

Tailoring the Quantization Space for 1-Bit KV Cache Compression

The key-value (KV) cache becomes a major memory bottleneck in long-context LLM inference, placing substantial pressure on memory capacity and bandwidth. To mitigate this bottleneck, vector quantization (VQ) has emerged as a promising approach for aggressive KV cache compression. However, existing VQ methods degrade substantially in the 1-bit regime. At such extreme compression, each codebook must represent a larger group of channels with a limited set of centroids, making effective use of its capacity increasingly challenging. To address this, we introduce $\textbf{TaSQ}$, which tailors the VQ target space by combining query-guided channel weighting, cross-head normalization, and covarian...

AuthorsMinsoo Cheong, Donghyun Son, Sungjoo Yoo
Primary categorycs.LG
Published2 October 2026
Last updated at source2 October 2026
cs.LGcs.AIcs.CL
Embed this entry
<iframe src="https://silytics.si/embed/item/ee6ba8da-d91a-43ff-98fe-3a607c1766bf" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 2 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.