Fine-Tuning a KV Cache Concatenation-Aware Model or Recomputing KV Caches? Why Not Both?

📅 2026-09-09
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
为解决长上下文输入时响应质量下降和时间延迟问题,提出结合KV缓存拼接意识微调模型与选择性重计算KV缓存的方法。
📝 Abstract
In Retrieval-Augmented Generation (RAG) systems, a large number of retrieved chunks are concatenated to form the input context so that users can receive high-quality responses based on external knowledge. As a result, the input context length increases substantially, leading to a larger prefill workload and, in turn, a longer time to first token (TTFT). While previous works that reuse precomputed key-value (KV) caches effectively reduce TTFT for long-context inputs, it remains unclear whether response quality is preserved when the input context becomes very long. In this paper, we propose a combined approach that (i) fine-tunes the model while taking KV cache concatenation into account and (ii) selectively recomputes a subset of the KV caches. By applying both techniques, we demonstrate improved accuracy for long-context inputs. Experiments on the RULER benchmark show that, for a 124k-token input, our method improves the RULER score by 9.7 point over the baseline that recomputes KV caches only. Moreover, TTFT is reduced by 80% compared with full attention.
Problem

Research questions and friction points this paper is trying to address.

Retrieval-Augmented Generation
Key-Value Caches
Context Length
Time to First Token
Response Quality
Innovation

Methods, ideas, or system contributions that make the work stand out.

KV Cache Concatenation
Selective Recomputation
Fine-Tuning
Long-Context Input
Time to First Token (TTFT)
🔎 Similar Papers
No similar papers found.
F
Fumihiko Tachibana
Kioxia Corporation
D
Daisuke Miyashita
Kioxia Corporation
J
Jun Deguchi