Efficiently compress the KV cache of any pretrained transformer
Project description
Deploying long-context LLMs is costly due to the linear growth of the key-value (KV) cache in transformer models. For example, handling 1M tokens with Llama 3.1-70B in float16 requires up to 330GB of memory. kvpress implements multiple KV cache compression methods and benchmarks using 🤗 transformers, aiming to simplify the development of new methods for researchers and developers in this field.
Installation
pip install kvpress
If possible, install flash attention:
pip install flash-attn --no-build-isolation
For a local installation with all dev dependencies, use poetry:
git clone https://github.com/NVIDIA/kvpress.git
cd kvpress
poetry install --with dev
Usage
kvpress provides a set of "presses" that compress the KV cache during the prefilling-phase. Each press is associated with a compression_ratio attribute that measures the compression of the cache. The easiest way to use a press is through our custom KVPressTextGenerationPipeline. It is automatically registered as a transformers pipeline with the name "kv-press-text-generation" when kvpress is imported and handles chat templates and tokenization for you:
from transformers import pipeline
from kvpress import ExpectedAttentionPress
device = "cuda:0"
model = "meta-llama/Llama-3.1-8B-Instruct"
model_kwargs = {"attn_implementation": "flash_attention_2"}
pipe = pipeline("kv-press-text-generation", model=model, device=device, model_kwargs=model_kwargs)
context = "A very long text you want to compress once and for all"
question = "\nA question about the compressed context" # optional
press = ExpectedAttentionPress(compression_ratio=0.5)
answer = pipe(context, question=question, press=press)["answer"]
In the snippet above, the compression is only applied on the context tokens so that you can evaluate the compression for different questions. Check the Wikipedia notebook demo for a more detailed example (also available on Colab here).
[!IMPORTANT]
We focus on compression during the pre-filling phase as the KV cache becomes a bottleneck for long-context sequence (100k - 1M tokens) which are essentially long context prompts. This would typically apply to improving prompt caching systems.
[!NOTE]
Usemodel_kwargs={"attn_implementation":"flash_attention_2"}to enable flash attention. To use the pressObservedAttentionPress, you need to specifymodel_kwargs={"attn_implementation":"eager"}as this press requires to materialize the attention weights
Contributing
We welcome contributions! To add a new press, simply open an issue or submit a pull request. Check the new_press.ipynb notebook for a step-by-step guide.
Available presses
All current presses are training free and inherit from BasePress (source).
Several presses inherit from ScorerPress (source) and rely on a score to prune the KV pairs with lowest importance:
RandomPress(source): random scoreKnormPress(source, paper): inverse norm of the keySnapKVPress(source, paper): average attention weight of the last queriesExpectedAttentionPress(source, notebook): expected attention weight during the generation phaseStreamingLLMPress(source, paper): keep only the initial and recent tokensTOVAPress(source, paper): attention weight of the last query averaged across headsObservedAttentionPress(source, paper): average attention weight observed during in pre-filling phaseQFilterPress(source, paper): project the Key representations on the main SVD component of the Query vectors to approximate the attention scores.PyramidKVPress(source, paper): maintain pyramid-like cache sizes, allocating more cache budget to lower layers and less to higher layersLagKVPress(source, paper): leverage on the KV lag-relative information to compress. It's query free, attention-weight free, and flash-attention compatible.KeyDiffPress(source, paper): evicts tokens based solely on key similarity.
Some presses rely on a different logic:
ThinKPress(source, paper): compress the dimensions of the keys based on the channel attention score on the last queriesSimLayerKVPress(source, paper): identify "lazy" layers, and apply the StreamingLLM approach to themDuoAttentionPress(source, paper): split heads into retrieval heads (no compression) and streaming heads (StreamingLLM approach)FinchPress(source, paper): similar to SnapKV with a dynamic window size and key value re-rotation
Finally we provide wrapper presses that can be combined with other presses:
AdaKVPress(source, paper): prune bottom scores of anyScorerPressbut across all heads, achieving head-wise compressionsPerLayerCompressionPress(source): compress each layer with a different compression ratio (experimental)ComposedPress(source): compose multiple presses together by chaining their forward hooksKeyRerotationPress(source): rerotate pruned keys to have continuous RoPE embeddingsChunkKVPress(source, paper): compresses by selecting important chunks, preserving semantic coherenceChunkPress(source, paper): compress the KV cache on each sequence chunk separately. This can yield to more uniform compression across long sequencesCriticalKVPressandCriticalAdaKVPress(source, paper): refine the scores using the L1 norm of Wo @ values, coupled with a two-stage selection.BlockPress(source, paper): segments input sequence into non-overlapping blocks and compresses iteratively.
For a detailed list of existing KV cache compression methods, check Awesome-KV-Cache-Compression or Awesome-LLM-Compression
Evaluation
The speed_and_memory.ipynb notebook can help you to measure peak memory usage and total time gain.
We provide a simple CLI to evaluate the performance of the different presses on several long-context datasets. Below we report the average performance on the RULER dataset with 4k context length for different presses.
Please refer to the evaluation directory for more details and results.
Quantization
We support KV cache quantization through the transformers QuantizedCache class (see HF blog post). To use it, simply pass a cache object to your pipeline:
from transformers import QuantizedCacheConfig, QuantoQuantizedCache
config = QuantizedCacheConfig(nbits=4)
cache = QuantoQuantizedCache(config)
pipe(..., cache=cache)
By default, the DynamicCache is used (no quantization).
[!IMPORTANT]
To use theQuantizedCache, you need to install additional dependencies (e.g.pip install optimum-quanto).
FAQ
Which models are supported ?
Some presses depend on the model architecture (e.g. ExpectedAttentionPress or SnapKVPress) hence they might not work with all models. We tested support for LlamaForCausalLM, MistralForCausalLM, Phi3ForCausalLM, Qwen2ForCausalLM, Qwen3ForCausalLM, and Gemma3ForCausalLM but many other models might be supported out of the box because their implementation is often similar in transformers.
How to run inference on multiple GPUs ?
kvpress supports multi-GPU inference through accelerate:
pipe = pipeline("kv-press-text-generation", model=model, device_map="auto")
What are the memory and throughput gains ?
Memory usage should be reduced by around compression_ratio * kv_cache_size. As the KV cache is smaller, decoding should also be faster. You can measure peak memory usage gain and total time gain using this notebook.
How does a press work ?
A press registers a forward hook (press.forward_hook method) to each attention layer during the pre-filling phase. Registration can be applied using the press as a context manager (press.__call__ method):
import torch
from transformers import AutoModelForCausalLM
from kvpress import KnormPress
device = "cuda:0"
ckpt = "meta-llama/Meta-Llama-3.1-8B-Instruct"
model = AutoModelForCausalLM.from_pretrained(ckpt).to(device)
press = KnormPress(compression_ratio=0.4)
inputs = model.dummy_inputs["input_ids"].to(device)
with torch.no_grad():
print(model(inputs).past_key_values[0][0].shape)
# torch.Size([3, 8, 5, 128])
with torch.no_grad(), press(model):
print(model(inputs).past_key_values[0][0].shape)
# torch.Size([3, 8, 3, 128])
Why not using model.generate ?
In fact you can use model.generate with a press by using the press as a context manager:
with press(model):
outputs = model.generate(inputs)
However, the generate method does not allow to exclude the question from the compression, which would artificially favors methods such as SnapKV. Ideally, we want a compression method that works whatever comes after the context (e.g. for use cases such as chat or document question answering). Finally the generate method does not allow to provide generation for multiple questions at once.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
Built Distribution
Filter files by name, interpreter, ABI, and platform.
If you're not sure about the file name format, learn more about wheel file names.
Copy a direct link to the current filters
File details
Details for the file kvpress-0.2.8.tar.gz.
File metadata
- Download URL: kvpress-0.2.8.tar.gz
- Upload date:
- Size: 40.5 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/6.1.0 CPython/3.12.9
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
aa4749eb596162b8644f18ded5d111d313e536a2966b7f817a3088333be46621
|
|
| MD5 |
9440251350ede92ce0b897610ec1d2e1
|
|
| BLAKE2b-256 |
4da372cb30413b1e906690c8ed4e96616479ba0e32676de619378ffdb7b4a2d0
|
File details
Details for the file kvpress-0.2.8-py3-none-any.whl.
File metadata
- Download URL: kvpress-0.2.8-py3-none-any.whl
- Upload date:
- Size: 57.8 kB
- Tags: Python 3
- Uploaded using Trusted Publishing? No
- Uploaded via: twine/6.1.0 CPython/3.12.9
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
1c151f6228d4d4bfba534309c119c2926d749a675bb644a560f93b9c886d894f
|
|
| MD5 |
be408a0cd466e385cc53c215ca12e35f
|
|
| BLAKE2b-256 |
63c11b81837420022cb0eb3794e943e49eb030fc08529955bdd8520db50df5a5
|