paper-with-me

Papers

Alignment Collapse Under KV Cache Quantization: Diagnosis and Mitigation

2026-06-01 · Bruce Changlong Xu, Adarsh Kumarappan, Mu Zhou arxiv

Key-value (KV) cache quantization is widely used to reduce Large Language Model (LLM) inference memory, yet existing evaluations solely focus on measuring perplexity and accuracy without assessing the safety impact. In this study, we explore alignment preservation under KV cache quantization. Across eleven instruction-tuned models (3.8B-72B) and five benchmarks (1,894 prompts), we find that low-bit quantization can silently destroy safety alignment: Mistral-7B loses 15.2% of its refusals at only 1.03x perplexity, and no universal safe bit-width exists, with sharp model-specific phase transitions invisible to standard metrics. We identify that the root cause is geometric: safety features occupy a low-dimensional activation subspace 10^2-10^3x more vulnerable to quantization noise than the full representation space perplexity averages over. Inspired by this observation, we propose Per-Channel Reduction (PCR), a diagnostic that classifies each model into one of three mechanistic failure modes: outlier-crushes-safety, where safety lives in non-outlier channels collaterally damaged by outlier-driven scale factors; outlier-as-safety, where safety overlaps outlier channels and finer granularity cannot rescue it; and multi-layer dilution, where safety is distributed across many layers and per-layer fixes fail. PCR predicts the correct mitigation direction on all nine primary models and one held-out model from an independent family using 20 calibration prompts. PCR generalizes across unseen prompts, models, and production quantizers, including KIVI with up to 97.2% recovery, succeeding where attention-based allocation methods fail. The resulting training-free protocol, requiring approximately 35 GPU-minutes, recovers up to 97% of lost alignment at minimal memory overhead, addressing vulnerabilities confirmed in production vLLM serving with FP8 KV cache on NVIDIA GPUs.

📄 PDF Abstract BibTeX arXiv:2606.09864

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

OSCAR: Offline Spectral Covariance-Aware Rotation for 2-bit KV Cache Quantization

2026-05-18 · Zhongzhu Zhou, Donglin Zhuang, Jisen Li, Ziyan Chen 외 arxiv

INT2 KV-cache quantization is attractive for long-context LLM serving, but it remains difficult to make both accurate and deployable. Simple rotations such as Hadamard transforms reduce outliers, but still degrade at INT…

RoPE-Aware Bit Allocation for KV-Cache Quantization

2026-06-23 · Fengfeng Liang, Yuechen Zhang, Jiaya Jia arxiv

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 frequ…

Quantization Dominates Rank Reduction for KV-Cache Compression

2026-04-13 · Samuel Salfati arxiv

We compare two strategies for compressing the KV cache in transformer inference: rank reduction (discard dimensions) and quantization (keep all dimensions, reduce precision). At matched storage budgets across five models…

TriRoute: Unified Learned Routing for Joint Adaptive Attention, Experts, and KV-Cache Allocation

2026-07-07 · Andrii Balashov, Olena Ponomarova arxiv

Conditional computation can decouple language model quality from per-token inference cost, yet leading techniques act on a single axis in isolation: Mixture-of-Experts (MoE) sparsifies the FFN, Mixture-of-Depths (MoD) sk…

From Signal Degradation to Computation Collapse: Uncovering the Two Failure Modes of LLM Quantization

2026-04-21 · Chenxi Zhou, Pengfei Cao, Jiang Li, Bohan Yu 외 arxiv

Post-Training Quantization (PTQ) is critical for the efficient deployment of Large Language Models (LLMs). While 4-bit quantization is widely regarded as an optimal trade-off, reducing the precision to 2-bit usually trig…