ParisKV: Fast and Drift-Robust KV-Cache Retrieval for Long-Context LLMs
Abstract
Lay Summary
Large language models can read and generate very long texts, but doing so requires storing and searching through a large amount of past information, which makes inference slow and memory-intensive. ParisKV is a new system that helps language models efficiently find the most useful parts of this stored information when processing long contexts. Instead of checking everything, ParisKV quickly narrows down the important candidates and retrieves only the most relevant information. This makes long-context inference faster and more memory-efficient, while maintaining the model’s answer quality. Our results show that ParisKV can support much longer inputs and generations than standard approaches, and can be especially useful when full attention becomes too expensive or runs out of memory.