The Pitfalls of KV Cache Compression
Alex Chen, Renato Geh, Aditya Grover, Guy Van den Broeck, Daniel Israel
TL;DR
The paper tackles the nonuniform degradation and leakage risks of KV cache compression in LLMs, especially in multi-instruction prompts and system prompts. It analyzes multiple eviction policies ( StreamingLLM, H2O, K-norm, SnapKV, TOVA ) across models to show that degradation, leakage, and instruction-following fidelity depend on policy, instruction order, and eviction bias. It proposes two practical remedies—token whitelisting of must-retained tokens and fair eviction that distributes retention across instruction partitions—demonstrating improvements in defending against leakage with minimal impact on directive following. These findings highlight that careful eviction policy design is essential for robust KV cache compression in realistic, multi-instruction scenarios.
Abstract
KV cache compression promises increased throughput and efficiency with negligible loss in performance. While the gains in throughput are indisputable and recent literature has indeed shown minimal degradation on particular benchmarks, in general the consequences of compression in realistic scenarios such as multi-instruction prompting have been insufficiently studied. In this paper, we identify several pitfalls practitioners should be aware of when deploying KV cache compressed LLMs. Importantly, we show that certain instructions degrade much more rapidly with compression, effectively causing them to be completely ignored by the LLM. As a practical example of that, we highlight system prompt leakage as a case study, empirically showing the impact of compression on leakage and general instruction following. We show several factors that play a role in prompt leakage: compression method, instruction order, and KV eviction bias. We then propose simple changes to KV cache eviction policies that can reduce the impact of these factors and improve the overall performance in multi-instruction tasks.
