AI & ML
Can KV Cache Be Reused Across Model Updates? A DeepSeek-V4-Flash Case Study
arXiv cs.DC0 views
arXiv:2611.14051v1 Announce Type: new Abstract: Reusing key--value (KV) caches across language model updates could avoid repeated computation of shared context, but changes in model weights raise a fundamental question about what these caches preserve. We investigate direct cache reuse across four model updates, with a detailed study of DeepSeek-V4-Flash to Flash-0731. Our central finding is that caches can retain useful task information without faithfully reproducing the updated model's behavior. Retrieval accuracy varies substantially across updates, ranging from near-native performance to large losses. With source caches already available, reuse achieves median time-to-first-token speedups of $2.10$--$5.08\times$ on three longer-prefix QA benchmarks. To characterize the behavioral differences behind these outcomes, we introduce Functional Cache Divergence, which compares next-token distributions under reused and native caches. Direct KV cache reuse better preserves native model behavior in natural-text continuation, whereas compatibility degrades with increasing prefix length in single-token retrieval tasks. Answer-margin analyses help explain how correct retrieval decisions survive substantial internal state changes. Yet even agreement on the first generated token does not ensure agreement in answer content or stopping behavior. These findings establish task utility and fidelity to native inference as distinct criteria for evaluating cross-version KV cache reuse.
Source:https://arxiv.org/abs/2611.14051PreviousEnergy-Proportional Serverless Computing on SBC ClustersNextPerformance Portability Explained: Insights from accelerating ICON microphysics
Related posts
FDR-Controlled Variable Selection for Generalized Linear Models and Cox Regression with Virtual Dummies
0arXiv eess.SP
Terrain Perception for Agricultural UAVs in Complex Farmland via Rotating mmWave Radar
0arXiv eess.SP
FUTON: Fourier Tensor Networks for Implicit Neural Representations
0arXiv eess.SP
Writing Bug Reports for Software Repair Agents: What Information Matters Most?
0arXiv cs.SE
SACS: A Code Smell Dataset using Semi-automatic Generation Approach
0arXiv cs.SE
Resolution of Vinzant's Conjecture on Phase Retrieval Injectivity
0arXiv math.IT