arXiv:2601.19178cs.AI2026-01中稿 · ICLR被引 1

通过共享用户间共性记忆,将推荐系统缓存压缩至原大小0.8%。

CollectiveKV: Decoupling and Sharing Collaborative Information in Sequential Recommendation

  • 构建全局共享的键值池,提取跨用户共性信息
  • 在三个数据集上实现0.8%缓存压缩率,性能不降反升
  • 适合长序列推荐场景,尤其适用于大规模用户系统

序列推荐模型广泛应用,但面临严苛延迟要求。主流模型采用Transformer注意力机制提升性能,但其计算复杂度随序列长度增长,导致长序列推理延迟高。为此,近期研究尝试引入KV缓存技术降低推理延迟。然而,该技术在用户基数大、历史序列长的推荐系统中带来显著存储开销。本文观察到不同用户间的KV序列存在显著相似性,表明KV中蕴含协同信号。通过奇异值分解(SVD)分析发现,KV信息可分为两部分:大部分可跨用户共享,小部分为用户特有。受此启发,我们提出CollectiveKV,一种跨用户KV共享机制。该方法通过可学习的全局KV池捕获共享信息。推理时,每个用户从池中检索高维共享KV,并与低维用户专属KV拼接,得到最终的KV。在五种序列推荐模型和三个数据集上的实验表明,该方法可将KV缓存压缩至原始大小的0.8%,同时保持或提升模型性能。

原文摘要 · Abstract (English)

Sequential recommendation models are widely used in applications, yet they face stringent latency requirements. Mainstream models leverage the Transformer attention mechanism to improve performance, but its computational complexity grows with the sequence length, leading to a latency challenge for long sequences. Consequently, KV cache technology has recently been explored in sequential recommendation systems to reduce inference latency. However, KV cache introduces substantial storage overhead in sequential recommendation systems, which often have a large user base with potentially very long user history sequences. In this work, we observe that KV sequences across different users exhibit significant similarities, indicating the existence of collaborative signals in KV. Furthermore, we analyze the KV using singular value decomposition (SVD) and find that the information in KV can be divided into two parts: the majority of the information is shareable across users, while a small portion is user-specific. Motivated by this, we propose CollectiveKV, a cross-user KV sharing mechanism. It captures the information shared across users through a learnable global KV pool. During inference, each user retrieves high-dimensional shared KV from the pool and concatenates them with low-dimensional user-specific KV to obtain the final KV. Experiments on five sequential recommendation models and three datasets show that our method can compress the KV cache to only 0.8% of its original size, while maintaining or even enhancing model performance.

序列推荐缓存压缩协同信息KV共享

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。