**RoPE-Aware Bit Allocation for KV-Cache Quantization** > Existing low-bit KV-c

**RoPE-Aware Bit Allocation for KV-Cache Quantization**

> Existing low-bit KV-cache quantizers often treat each cached key as a flat vector. Under RoPE, however, a key's contribution to a future attention logit decomposes into a position-dependent sum over two-dimensional frequency blocks. This makes key-cache quantization a block-wise bit-allocation problem: high-energy RoPE blocks are more sensitive to quantization error and should receive more bits. We introduce Block-GT...

**来源信息**
- **来源**：HuggingFace Daily Papers（社区热门论文）
- **分类**：论文
- **发布时间**：2026-06-25 08:00（北京时间）
- **原文**：[打开原文](https://huggingface.co/papers/2606.24033)