← Back to feed
2026-07-07infrascaling

FreqDepthKV: Frequency-Guided Depth Sharing for Robust KV Cache Compression in Long-Context LLM Inference

Anna Córdoba, Adam Puente Tercero, Nerea Angulo Hijo, Mar Linares Tercero, Julia Barrientos, Ainhoa Miranda, Jesús Olivera

PDF preview for FreqDepthKV: Frequency-Guided Depth Sharing for Robust KV Cache Compression in Long-Context LLM Inference
Read on arXiv →

Key claim

FreqDepthKV compresses caches while preserving task accuracy.

In plain English

Imagine you're working with large language models that need to handle long inputs, like lengthy documents or complex queries. These models often rely on memory caches to store information from previous layers, but as the context length increases, the memory and bandwidth costs can skyrocket. This can lead to inefficiencies, especially when trying to maintain accuracy in tasks like question answering or summarization. When you try to compress these caches aggressively, you might lose important details that are crucial for understanding and reasoning — this is what's called the loss of layer-specific evidence.

To tackle this issue, the authors propose a new method called FreqDepthKV. Instead of treating all cache data the same, this approach breaks down the information into two parts: shared low-frequency components that can be reused across layers and sparse high-frequency residuals that capture the unique details. A smart online probe then decides how to use these components based on their importance for the task at hand, allowing the model to adapt to different types of prompts without needing to retrain.

What’s exciting is that FreqDepthKV not only reduces the memory footprint significantly but also maintains high accuracy across various tasks. For instance, with a 32k-token input, it achieves performance metrics that closely match those of full KV caches while being much more efficient. This means that for builders, using this method can lead to faster processing times and lower resource costs, making it a practical solution for deploying long-context models in real-world applications.

Novelty
8.0/10

The method introduces a novel approach to cache compression that adapts to prompt structure, significantly improving efficiency.

Reliability
8.0/10

The results are supported by multiple benchmarks and demonstrate clear improvements over prior methods.

Deep reliability assessment

The methodology supports robust KV cache compression by factorizing KV states into shared low-frequency components and sparse high-frequency residuals, but the claim of preserving task accuracy under smaller cache budgets may be overclaimed without extensive testing across diverse prompts.

Reproducibility

no

Key figure

Figure 1 illustrates the core idea of FreqDepthKV, which removes redundant depth information shared by neighboring layers while preserving sparse layer-specific token evidence for retrieval-sensitive attention.

Benchmark results

~not specifiedExact Match: 58.3vs prior compressed-cache methodsclosely matching full KVSOTA
~not specifiedF1: 63vs prior compressed-cache methodsclosely matching full KVSOTA
~not specifiedROUGE-L: 32.5vs prior compressed-cache methodsclosely matching full KVSOTA
~not specifiedpass@1: 48.1vs prior compressed-cache methodsclosely matching full KVSOTA