Skip to main content
Search

# KV Cache Quantization

7 related articles

Subscribe to updates
  1. arXiv

    Low-bit inference stops choosing between accuracy and speed: StrataFlux streams refinement bits from RAM and SSD, cutting 2-bit Llama-3.1-8B perplexity from 9.46 to 8.40

    StrataFlux, from Cornell and Carnegie Mellon researchers, keeps low-bit weights and KV cache resident on the GPU and fetches only a small set of refinement bits from host RAM or SSD for the computation at hand, recovering accuracy while retaining quantization's memory and speed advantages. On an RTX 5090, 2-bit Llama-3.1-8B-Instruct weights drop WikiText-2 perplexity from 9.46 to 8.40 while keeping 95.4% of the quantized base's throughput; with 2-bit weights and KV, Qwen3-8B's AIME 2024/2025 accuracy rises from 11.0% to 47.1% at unchanged GPU memory use.

  2. arXiv

    FOSCAR stops dequantizing each KV value: folding scales and offsets into the matmul lets 2-bit decode attention beat BF16 on H100 and B200

    Low-bit KV caches cut memory traffic, yet existing kernels still convert every integer back to floating point and apply its scale and offset, so instruction issue becomes the new bottleneck. FOSCAR folds each quantization group's shared scale and offset into the other matrix operand or the partial product, and builds Tensor Core operands directly from packed integers with bit manipulation. Its INT2 kernels reach geometric-mean speedups over FlashInfer BF16 on H100 and B200, and the kernel library is open-sourced.

  3. LMSYS Org

    SGLang stores KV cache in 4 bits: long-context decode throughput rises 26–30%, and FP8 stalls first under agent concurrency

    SGLang adds NVFP4 storage to its paged KV cache, cutting per-token key-value bytes to about 56% of FP8. On Qwen3.8-27B at 32K, 160K and 1M input lengths with matched decode concurrency, peak-batch decode throughput rises about 26–30%; on agentic load beyond concurrency 12, FP8 throughput collapses while NVFP4 keeps climbing. Accuracy gaps vary by task, reaching 1.60 points on SWE-bench Verified.

  4. Baseten

    NVIDIA puts vision inside its open Nemotron line: 120B parameters, 12B active per token, GDPval Elo up from 493 to 1190

    NVIDIA released Nemotron 3.5 Super VL, an open multimodal model now available for inference and training on Baseten, so agents can read documents, interpret application screens and analyze video directly. It builds on the Nemotron 3 Super architecture as a 120B-parameter Mixture-of-Experts model that activates 12B parameters per token, adding a vision encoder for image input. In NVIDIA's reported evaluations it scores an Elo of 1190 on GDPval versus 493 for Nemotron 3 Super, and also scores higher on SciCode and GPQA-diamond.

  5. arXiv

    Async RL squeezes context into fewer decode steps; INT4 KV cache speeds rollouts but loses accuracy, bounded INT8 protection recovers it

    Sustained concurrency in asynchronous RLVR rollout concentrates context processing into fewer decode steps, making the KV cache rather than weights the dominant cost. KV4-RL stores the full context in calibration-free INT4 and protects only attention sinks and recent context in bounded INT8; across full-parameter GRPO training on Qwen3-4B-Base and Qwen3-8B-Base, its six-benchmark mean accuracy stays within 0.5 percentage points of BF16 rollout while substantially accelerating rollout and full iterations.

  6. arXiv

    ResidualQuant anchors on the final-loop KV and stores 2-bit residuals, cutting looped-Transformer KV storage by 80.7% at near-BF16 accuracy under INT2/4

    To address the KV cache memory bottleneck that grows with recurrent depth in looped Transformers, the authors propose ResidualQuant, which uses the final-loop KV states as an anchor and represents the remaining loops as low-precision residuals, combined with least-squares scaling, rotations applied to the residuals, and loop-wise INT4/INT2 mixed precision; across Ouro-1.4B and Huginn-3.5B on mathematical reasoning and code generation benchmarks it improves the accuracy-memory tradeoff over rotation-based KV quantization, reducing theoretical KV storage by 80.7% relative to BF16 while retaining accuracy close to BF16 under mixed precision.

  7. arXiv

    WUSH-KV cuts 2-bit KV-cache perplexity from OSCAR's 13.74 to 10.51 and leads OSCAR on all four 8B downstream tasks

    The work adapts the WUSH transform, originally for weight-activation quantization, to the KV cache of grouped-query attention: calibration data builds separate key and value transforms per KV head (the value transform folded into the weights, the key transform applied after RoPE), the transform is shown to be near-optimal among sensitivity-balanced transforms for the QuEST quantizer, and end-to-end evaluation in SGLang with OSCAR-style percentile-clipped affine quantization gives 2-bit WikiText-2 perplexity of 10.51 on Qwen3-8B versus OSCAR's 13.74, with the 8B model scoring higher than OSCAR on AIME 2025, MATH-500, GPQA Diamond, and LiveCodeBench v6.

You’re all caught up