arXiv:2605.19660cs.LGcs.CL2026-05被引 1

提出轻量高效压缩框架OScaR,解决大模型KV缓存极端量化难题。

OScaR: The Occam's Razor for Extreme KV Cache Quantization in LLMs and Beyond

论文配图:OScaR: The Occam's Razor for Extreme KV Cache Quantization in LLMs and Beyond
图 1 · 摘自论文原文
  • 通过通道化旋转与全令牌缩放缓解令牌范数失衡问题
  • 在INT2量化下实现近无损性能,内存减少5.3倍,吞吐提升4.1倍
  • 适用于文本、多模态等各类大模型,适合部署优化场景

长上下文推理与多模态智能的快速发展使键值(KV)缓存的内存开销成为高效部署的主要瓶颈。尽管传统逐通道量化能有效处理键张量中的通道级异常值,但在极端压缩下效果显著下降。本文从实证与理论双重角度重新审视该范式的局限性,发现令牌范数失衡(TNI)是影响量化精度的核心瓶颈。当需共享量化参数以覆盖范数差异大的令牌组时,TNI会系统性放大误差。为此,我们提出OScaR(Omni-Scaled Canalized Rotation),一种适用于各类大模型(如纯文本、多模态、全模态)的高精度轻量级KV缓存压缩框架。其在逐通道基础上引入通道化旋转与全令牌缩放,高效抑制序列维度方差。结合优化的系统设计与CUDA内核,实验表明:在多种X-LLMs上,OScaR持续优于现有方法,在INT2量化下实现近乎无损性能,定义了新的帕累托前沿。相比BF16 FlashDecoding-v2基线,其解码速度最高提升3.0倍,内存占用降低5.3倍,吞吐量提升4.1倍。代码已开源:https://github.com/ZunhaiSu/OScaR-KV-Quant。

原文摘要 · Abstract (English)

The rapid advancement toward long-context reasoning and multi-modal intelligence has made the memory footprint of the Key-Value (KV) cache a dominant memory bottleneck for efficient deployment. While the established per-channel quantization effectively accommodates intrinsic channel-wise outliers in Key tensors, its efficacy diminishes under extreme compression. In this work, we revisit the inherent limitations of the per-channel quantization paradigm from both empirical and theoretical perspectives. Our analysis identifies Token Norm Imbalance (TNI) as the primary bottleneck to quantization fidelity. We demonstrate that TNI systematically amplifies errors when shared quantization parameters are required to span token groups exhibiting substantial norm disparities. Instead of relying on intricate quantization pipelines (e.g., TurboQuant), we propose OScaR (Omni-Scaled Canalized Rotation), an accurate and lightweight KV cache compression framework for X-LLMs (i.e., text-only, multi-modal, and omni-modal LLMs). Advancing the per-channel paradigm, OScaR employs Canalized Rotation followed by Omni-Token Scaling to mitigate TNI-induced sequence-dimensional variance both effectively and efficiently, further supported by our optimized system design and CUDA kernels. Extensive evaluations across X-LLMs show that OScaR consistently outperforms existing methods and achieves near-lossless performance under INT2 quantization, establishing it as a robust, low-complexity, and universal framework that defines a new Pareto front. Compared with the BF16 FlashDecoding-v2 baseline, our OScaR implementation achieves a notable up to 3.0x speedup in decoding, reduces memory footprint by 5.3x, and increases throughput by 4.1x. The code for OScaR is publicly available at https://github.com/ZunhaiSu/OScaR-KV-Quant.

KV缓存压缩量化大模型部署INT2

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。