GPU-Accelerated INT8 Quantization for KV Cache Compression in Large Language Models

Maanas Taneja, Purab Shingvi
1/8/2026
cs.LGcs.PF

No confident code implementation found for this paper. 3 possible matches can be shown below.

Abstract

The key-value (KV) cache in large language models presents a significant memory bottleneck during inference, growing linearly with sequence length and often exceeding the memory footprint of model weights themselves. We implement and evaluate GPU-accelerated INT8 quantization for KV cache compression, achieving 4$\times$ memory reduction with minimal accuracy degradation. We develop four CUDA kernel variants -- naive, tiled, coarsened, and vectorized -- and benchmark them across realistic workload sizes up to 1 billion elements. Our vectorized kernel achieves up to 1,694$\times$ speedup over CPU baselines while maintaining reconstruction error below 0.004 and attention score error below 0.1 even for 8K-dimensional heads. These results demonstrate that INT8 quantization provides a practical approach for reducing memory pressure in LLM inference with negligible computational overhead (6--58ms) and minimal impact on downstream model behavior

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 3 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{taneja2026gpuaccelerated,
  title  = {GPU-Accelerated INT8 Quantization for KV Cache Compression in Large Language Models},
  author = {Maanas Taneja and Purab Shingvi},
  year   = {2026},
  eprint = {2601.04719},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.04719v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.04719.svg)](https://codeofpaper.com/paper/2601.04719)

Discussion