Skip to content

CacheBridge: Efficient Cross-Model KV Cache Transfer

Sep 2026 · 4 citations · 20 references
Computer Science

TL;DR

CacheBridge is introduced, which co-designs architecture-indexed mapper support, attention-aligned calibration, and bounded mapper construction while retaining a closed-form affine interface for online deployment.

Abstract

Sharing context between LLMs in a multi-model system requires the receiving model to prefill the shared prefix because KV caches are model-specific. Recent closed-form cross-model KV transfer, hereafter Full-Head Mapping, avoids this replay by fitting a training-free affine mapper from source to target caches. However, its full-head design maps each target KV head from every source KV head in the selected layers, making transfer quality sensitive to architectural differences and causing mapper storage and application cost to grow with layer support. To this end, we introduce CacheBridge, which co-designs architecture-indexed mapper support, attention-aligned calibration, and bounded mapper construction while retaining a closed-form affine interface for online deployment. CacheBridge restricts each target head to a matched source head, weights reconstruction errors by causal attention sensitivity, and uses a fused GPU kernel to construct weighted sufficient statistics without materializing full observation tensors. Across three transfer directions, CacheBridge recovers the two Ministral 3 transfer directions where Full-Head Mapping loses substantial accuracy while preserving 99.83\% mean target retention on Qwen3. On Qwen3 $14\mathrm{B}\to32\mathrm{B}$, it reduces mapper storage by $8\times$, accelerates application by up to $3.0\times$, matches \fullhead with one tenth of the calibration data, and reduces 500-sequence construction from 92.63 to 8.63 seconds ($10.7\times$).

View source

Similar papers

#artificial intelligence Preprint Oct 2026

CacheLink: Functional KV Transport for Zero-Prefill Cross-Model Context Handoff

KV caches make long-context serving efficient by reusing past computation, but model switching breaks this reuse and forces the receiver to prefill the context again. We study \emph{zero-prefill cross-model context handoff}: translating a sender cache into a receiver-compatible state so that the receiver can continue d...

Hao-Miao Qiu, Yi-Ning Tang, Zi-Jia Song et al. · 0 citations
#machine learning Preprint Sep 2026

PatchKV: Weight-Space Compensation of KV Cache

Long-context inference with Large Language Models (LLMs) is bottlenecked by the linearly growing memory of the key-value (KV) cache. Existing compression methods reduce the cache through token eviction or approximation, but degrade sharply at aggressive compression budgets. We propose PatchKV, a training-free framework...

Chanryeol Lee, Chanhyuk Lee, Yeonwoo Choi et al. · 1 citation
#machine learning Preprint Sep 2026

Shared Global KV with Layer-Specific Local History

This work derives a sufficient suffix schedule that reduces upper-layer construction work while preserving the complete cache in exact arithmetic, and derives a sufficient suffix schedule that reduces upper-layer construction work while preserving the complete cache in exact arithmetic.

Xing-Lang Xian · 0 citations
#artificial intelligence Preprint Sep 2026

ARC-KV: Amortizing Anchor Search for Reconstruction-Based KV Cache Compaction

Long-context large language model inference is bottlenecked by KV caches that grow linearly with sequence length. This burden is especially severe for long, reusable context prefixes, whose cache must serve many downstream queries. Reconstruction-based methods such as Attention Matching achieve strong downstream task p...

Zhe-Yu Shen, Guan-Hua Wang, De-Zhan Tu et al. · 1 citation
Open access Sep 2026

CatKV: Accelerating Position-Independent Caching with Context-Adaptive KV Cache Compression

Context caching is widely adopted to reduce the dominant prefill cost for long prompts across various large language model (LLM) applications. Recently, position-independent caching (PIC) has emerged to improve KV cache reuse beyond strict prefix matching. However, the required KV caches often reside in a persistent re...

Jie-Shou Xu, Ren-Jie Liu, Yi Li et al. · 0 citations

Related blog posts

Hugging Face Blog Oct 20, 2026

MPS in PyTorch 2.15

We’re on a journey to advance and democratize artificial intelligence through open source and open science.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.