NVIDIA Research Blog: Why KV Cache Compression Breaks in Production vLLM Deployments

blaizedsouza · x · 2026-11-03

A long-form NVIDIA Research blog (Weian Mao, Song Han et al.) examines KV cache compression through an infrastructure lens: most algorithms work in the lab but fail in real deployments.

The hook is a counterintuitive interview question: a reasoning model served on vLLM keeps OOM-ing on long traces; you compress the KV cache and evict 90% of cached tokens, yet VRAM usage barely moves. The culprit is paged attention — memory is only reclaimed when a block is completely empty, and surviving tokens leave almost every block partially occupied, so the "freed" memory never comes back.

Two infrastructure collisions plague the field:

Concrete example: a 4-bit Qwen3-32B on a 24GB GPU OOMs around 24K tokens of a 32K-token reasoning trace, since KV cache dominates memory for long chains of thought. The post surveys the field's main ideas and shows how a geometric property hidden beneath RoPE has recently been used to resolve both problems.

Original post →

More from Infra

Infra channel →