KV-CAR: KV Cache Compression using Autoencoders and KV Reuse in Large Language Models
On the map: Efficient LLM inference and serving → KV cache optimization
Abstract (arXiv)
As Large Language Models (LLMs) scale in size and context length, the memory requirements of the key value (KV) cache have emerged as a major bottleneck during autoregressive decoding. The KV cache grows with sequence length and embedding dimension, often exceeding the memory footprint of the model itself and limiting achievable batch sizes and context windows. To address this challenge, we present KV CAR, a unified and architecture agnostic framework that significantly reduces KV cache storage while maintaining model fidelity. KV CAR combines two complementary techniques. First, a lightweight autoencoder learns compact representations of key and value tensors along the embedding dimension, compressing them before they are stored in the KV cache and restoring them upon retrieval. Second, a similarity driven reuse mechanism identifies opportunities to reuse KV tensors of specific attention heads across adjacent layers. Together, these methods reduce the dimensional and structural redundancy in KV tensors without requiring changes to the transformer architecture. Evaluations on GPT 2 and TinyLLaMA models across Wikitext, C4, PIQA, and Winogrande datasets demonstrate that KV CAR achieves up to 47.85 percent KV cache memory reduction with minimal impact on perplexity and zero shot accuracy. System level measurements on an NVIDIA A40 GPU show that the reduced KV footprint directly translates into longer sequence lengths and larger batch sizes during inference. These results highlight the effectiveness of KV CAR in enabling memory efficient LLM inference.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in KV cache optimization, one of 12 directions in Efficient LLM inference and serving. Builds on 7 of its 13 references that are in the map. First posted on arXiv 7 Dec 2025.
Builds on
7 of 13 references.
Closest ancestors · 4
Same direction, newest first
- 2025Mustafar: Promoting Unstructured Sparsity for KV Cache Pruning in LLM Inference28 May
- 2024InfiniGen: Efficient Generative Inference of Large Language Models with Dynamic KV Cache Management28 Jun
- 2024PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling4 Jun
- 2024Keyformer: KV Cache Reduction through Key Tokens Selection for Efficient Generative Inference14 Mar
Other references · 3
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025KVCompose: Efficient Structured KV Cache Compression with Composite Tokens
- 2024A Simple and Effective L2 Norm-Based Strategy for KV Cache Compression
- 2026PuzzleKV: Page-Wise Low-Rank Decomposition for KV Cache Compression
- 2026EchoKV: Efficient KV Cache Compression via Similarity-Based Reconstruction
- 2026Training Transformers for KV Cache Compressibility
- 2025H1B-KV: Hybrid One-Bit Caches for Memory-Efficient Large Language Model Inference
- 2024MiniCache: KV Cache Compression in Depth Dimension for Large Language Models
- 2026DynaCalKV: Key-Value Cache Compression via Head Grouping and Adaptive Rank Allocation