atlas

Research map / Architectures and efficiency / Attention and transformers

PrefixKV: Adaptive Prefix KV Cache is What Vision Instruction-Following Models Need for Efficient Generation

NeurIPS 2025 · Architectures and efficiency › Attention and transformers · approach: KV cache eviction and compression · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes PrefixKV, which allocates per-layer KV cache sizes for LVLMs by binary-searching a global cumulative-importance threshold so each layer keeps maximal top-ranked KV information under a fixed budget.

Problem

KV cache compression for large vision-language models usually keeps the same cache size in every layer, ignoring layer-wise differences in KV importance distributions, which causes large information loss in some layers and degraded generation.

Approach

Defines the cache as a top-importance "prefix" per layer and reframes per-layer size allocation as searching for a global cumulative-priority threshold p (via binary search) that meets the overall budget; the resulting configuration is estimated offline on about 10 random samples and reused at inference.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use adaptive layer-wise prefix KV retention instead of PyramidLLaVA-1.5-7B · LLaVA-Description, 20% cache budgetPPL: 12.4 -> 3.69Helped
use adaptive layer-wise prefix KV retention instead of H₂OLLaVA-1.5-7B · MM-Vet, 20% cache budgetROUGE: 0.26 -> 0.41Helped
use adaptive layer-wise prefix KV retention instead of ElasticLLaVA-1.5-13B · MM-Vet, 20% cache budgetPPL: 11.6 -> 5.16Helped
use adaptive layer-wise prefix KV retention instead of full cacheLLaVA-1.5-7B · batch size 16, token length 1024+512throughput (token/s): 266.6 -> 486.7Helped
allocate KV cache sizes adaptively across layers rather than retaining the same size in every layer (ablation)PrefixKV · MM-Vet, LLaVA-1.5-7B, 30% cache budgetPPL: 14.7 PPLHelped
estimate the global prefix configuration offline from random samples instead of online binary searching (ablation)PrefixKV · MM-VetPPLNo clear effect
combine PrefixKV with positional cache merging (ablation)PrefixKV · MM-Vet, LLaVA-1.5-7BPPLHurt
combine PrefixKV with feature-similarity cache merging (ablation)PrefixKV · MM-Vet, LLaVA-1.5-7BPPLHelped

Surprising findings

Limitations

Experimental setup

Datasets: LLaVA-1.5 training set (10 random samples for offline estimation)

Benchmarks: LLaVA-Description MM-Vet LongBench Needle-in-a-HayStack

Metrics: PPL ROUGE-L F1 latency throughput mean absolute error

Baselines: Local (StreamingLLM) H2O PyramidKV Elastic Cache KIVI

Builds on: H2O PyramidKV Elastic Cache StreamingLLM FastV

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy