← all papers · overview

Dynsplit-kv: Dynamic Semantic Splitting For Kvcache Compression In Efficient Long-context LLM Inference

Abstract

Although Key-Value (KV) Cache is essential for efficient large language models (LLMs) inference, its growing memory footprint in long-context scenarios poses a significant bottleneck, making KVCache compression crucial. Current compression methods rely on rigid splitting strategies, such as fixed intervals or pre-defined delimiters. We observe that rigid splitting suffers from significant accuracy

Related papers

Ranked by semantic similarity — how closely each paper's abstract matches this one (100% = near-identical topic).