NOVA-KV Optimizes LLM KV Cache with Attention-Preserving Quantization

Samuel Fern\'andez-Mendui\~na, Amir Ziashahabi, Eduardo Pavez, Antonio Ortega, Salman Avestimehr· August 6, 2026 View original

Key takeaways

  • KV cache size is a major bottleneck for long-context LLM decoding.
  • NOVA-KV uses attention-preserving transforms and vector quantization to reduce cache size.
  • It maintains long-context retrieval accuracy while improving throughput.
  • The method offers a significant advancement for efficient LLM serving.

Who benefits

AI/ML DevelopmentCloud ComputingData CentersTelecommunications

Summary

NOVA-KV introduces a novel vector quantization method for LLM Key-Value (KV) caches that uses attention-preserving transforms and MSE-optimal vector quantizers to significantly reduce cache size while maintaining long-context retrieval accuracy.

Decoding large language models (LLMs) with long contexts is often bottlenecked by the bandwidth required to load the Key-Value (KV) cache. Reducing the cache size is crucial for improving decoding speed and serving capacity, but this must be done without compromising attention product accuracy or incurring high reconstruction costs. Existing quantization methods for KV caches often fall short, either being data-oblivious or using suboptimal transforms and scalar quantizers. This research formulates KV cache quantization as a transform coding problem, where the primary distortion criterion is the error in attention products. The authors derive closed-form optimal transforms for keys and values based on calibration statistics, showing that the optimal key transform is non-orthogonal and converts attention-aware distortion into mean-squared error (MSE) in the transform domain. This allows for the use of MSE-optimal vector quantizers directly on the transformed coefficients. To meet fixed-width layout requirements, the method groups coefficients into equal-volume partitions, enabling equal-size codebooks to achieve variable-rate optimality. The resulting method, NOVA-KV, recovers most of the long-context retrieval accuracy lost by scalar quantization methods at comparable throughput, demonstrating a significant advancement in efficient LLM serving.

Why it matters

AI engineers and infrastructure teams can deploy larger LLMs more efficiently and cost-effectively by significantly reducing KV cache memory footprint and improving decoding throughput without sacrificing model accuracy.

How to implement this in your domain

  1. 1Analyze current LLM serving infrastructure to identify KV cache bandwidth as a bottleneck.
  2. 2Implement NOVA-KV's attention-preserving transforms and vector quantization for KV caches.
  3. 3Calibrate the optimal transforms for keys and values using representative datasets.
  4. 4Integrate MSE-optimal vector quantizers into the KV cache management system.
  5. 5Benchmark the performance of LLMs with NOVA-KV against existing quantization methods in terms of throughput, memory usage, and accuracy.

Original post by Samuel Fern\'andez-Mendui\~na, Amir Ziashahabi, Eduardo Pavez, Antonio Ortega, Salman Avestimehr

"arXiv:2608.04074v1 Announce Type: new Abstract: Long-context LLM decoding reads the key-value (KV) cache at every step. Loading it takes longer than computing attention over it, so throughput is bandwidth-bound. Hence, reducing the cache size can raise both decoding speed and ser…"

View on X

Originally posted by Samuel Fern\'andez-Mendui\~na, Amir Ziashahabi, Eduardo Pavez, Antonio Ortega, Salman Avestimehr on X · view source

Want to go deeper?

Turn these trends into skills with Learnijoy's hands-on AI & tech courses.

Explore courses