让不同模型间高效共享知识,速度比文本通信快6.8倍
Dual-Cache Latent Space Communication between Heterogeneous Language Models

- 用可学习查询融合双方缓存,实现跨模型知识池化
- 在5个数据集上超越现有方法,最高提升4.6分精确率
- 适合异构模型协作,训练参数少76%,速度提升10倍以上
多智能体大模型系统中,任务完成常依赖其他模型的上下文信息。传统文本通信导致自回归解码成为瓶颈,且发送方无法感知接收方状态。现有隐空间协议如LCF-X虽可跨模型传递缓存,但仍受限于相同输入、固定层数和头数。本文提出XKV,通过可学习查询同时聚合双方缓存;利用接收方对齐层令牌的自注意力与层映射,生成紧凑联合记忆;并采用共享位置解码器,使每个接收端位置能按自身几何结构检索对应残差。模型保持冻结,支持不同架构、深度、头数和分词器;仅翻译器需训练。在45组数据-模型组合中,XKV取得最高宏平均分与最优平均排名,在所有数据集上均优于LCF-X(ROPES上提升4.6精确率、4.2 F1),且在4/5数据集上超越文本通信;训练参数减少76%,缓存对翻译速度提升10.3倍(5.8 vs. 59.9 ms);端到端效率较LCF-X快26%,较文本通信快6.8倍。
原文摘要 · Abstract (English)
Multi-agent LLM systems split work across models, so answering often requires knowledge that sits in another agent's context: a Sharer has encoded information that a Receiver needs to complete its task. They usually communicate by exchanging text, which puts autoregressive decoding on the critical path and reduces the exchange to a discrete message written without sight of the receiver's state. Recent latent protocols instead translate the sharer's key-value (KV) cache into the receiver's: C2C supports heterogeneous models but requires both to read the same input, while LCF-X removes this shared-context requirement through position-free sharer-cache pooling. Three restrictions remain: LCF-X compresses the sharer alone, supplies the same layer-local summary to every receiver position with no joint cross-layer memory to retrieve from, and assumes matched layer count and KV geometry. We introduce XKV, which lifts all three: learned-query attention pools both caches; self-attention over receiver-aligned layer tokens, with a learned layer map reconciling different depths, mixes the pooled summaries into a compact joint memory; and a shared position decoder lets every raw receiver cache position retrieve its own per-head-gated residual in the receiver's native KV geometry. Both models stay frozen and may differ in family, depth, KV-head count, head dimension, and tokenizer; only the translator is trained. Across 45 dataset-model-pair settings (six heterogeneous and three same-model ordered pairings, five datasets), XKV attains the highest macro score and best average rank, improving on LCF-X on every dataset (by 4.6 exact-match and 4.2 F1 points on ROPES) and surpassing text communication on four of the five, while training 76% fewer parameters and translating a cache pair 10.3x faster (5.8 vs. 59.9 ms); end to end, XKV is 26% faster than LCF-X and 6.8x faster than text communication.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。