PulseAugur
实时 15:07:50
English(EN) KVpop -- Key-Value Cache Compression with Predictive Online Pruning

KVpop 方法在保持性能的同时大幅减少了 LLM 缓存内存使用量

研究人员开发了 KVpop,一种用于压缩自回归解码中键值缓存的新颖方法,这是大上下文窗口的一个重要瓶颈。KVpop 通过使用未来注意力目标直接监督保留或丢弃决策来学习驱逐策略,在保持高性能的同时实现了显著的内存节省。该方法在 Qwen3-4B 和 Qwen3-8B 等模型的数学推理任务上取得了强劲成果,优于现有的驱逐基线,并显著降低了内存成本。 AI

影响 这项研究可以显著减小大型语言模型的内存占用并提高解码速度,从而实现更广泛的部署和更长的上下文窗口。

排序理由 该集群描述了一篇详细介绍优化 LLM 性能的新颖方法的新研究论文。

在 Hugging Face Daily Papers 阅读 →

AI 生成摘要 · Google Gemini · 来自 6 个来源。 我们如何撰写摘要 →

KVpop 方法在保持性能的同时大幅减少了 LLM 缓存内存使用量

报道来源 [6]

  1. arXiv cs.AI TIER_1 English(EN) · Anna Cordoba, Adam Puente Tercero, Nerea Angulo Hijo, Mar Linares Tercero, Julia Barrientos, Ainhoa Miranda, Jesus Olivera ·

    DepthWeave-KV:面向长上下文 KV 缓存压缩的 Token 自适应跨层残差分解

    arXiv:2607.06523v1 Announce Type: new Abstract: Long-context language model inference is increasingly limited by the memory bandwidth and capacity required to store key-value caches, yet existing compression methods often apply uniform budgets across layers or tokens and degrade …

  2. arXiv cs.AI TIER_1 English(EN) · Jesus Olivera ·

    DepthWeave-KV:面向长上下文 KV 缓存压缩的 Token 自适应跨层残差分解

    Long-context language model inference is increasingly limited by the memory bandwidth and capacity required to store key-value caches, yet existing compression methods often apply uniform budgets across layers or tokens and degrade retrieval when lexical cues and semantic states …

  3. arXiv cs.LG TIER_1 English(EN) · Lukas Hauzenberger, Niklas Schmidinger, Anamaria-Roberta Hartl, David Stap, Thomas Schmied, Sebastian B\"ock, G\"unter Klambauer, Sepp Hochreiter ·

    KVpop -- 具有预测性在线剪枝的键值缓存压缩

    arXiv:2607.05061v1 Announce Type: new Abstract: Key-value (KV) cache growth is a major bottleneck in autoregressive decoding, as memory and bandwidth scale linearly with context length. Existing KV eviction methods often rely on static heuristics or proxy scores, which poorly tra…

  4. arXiv cs.LG TIER_1 English(EN) · Sepp Hochreiter ·

    KVpop -- 具有预测性在线剪枝的键值缓存压缩

    Key-value (KV) cache growth is a major bottleneck in autoregressive decoding, as memory and bandwidth scale linearly with context length. Existing KV eviction methods often rely on static heuristics or proxy scores, which poorly track future token utility and cause brittle evicti…

  5. Hugging Face Daily Papers TIER_1 English(EN) ·

    KVpop -- 具有预测性在线剪枝的键值缓存压缩

    KVpop learns optimal key-value cache eviction by directly supervising keep-or-drop decisions using future-attention targets, achieving high performance with reduced memory usage.

  6. Towards AI TIER_1 English(EN) · Mohit Sewak, Ph.D. ·

    [框架] 非对称键值缓存压缩

    <h4>Why hardware pipelines hate irregular memory layouts and what you should do instead.</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*bnzEkcDLZ_wzre7k" /></figure><p><em>A tactile physical installation illustrating the asymmetric decoupling of the key-v…