arXiv:2603.01426cs.CL2026-03被引 4

揭示大模型缓存压缩中的注意力路由失效问题

Understanding the Physics of Key-Value Cache Compression for LLMs through Attention Dynamics

  • 将缓存压缩视为对注意力路由的受控扰动,区分保留、可访问与使用三要素
  • 90%压缩率附近出现幻觉突变,与全局淘汰率飙升相关,呈相变特征
  • 不同模型路由动态差异显著,提示压缩鲁棒性受结构稀疏性影响

随着大模型上下文窗口扩展至10万+令牌,键值(KV)缓存成为主要内存瓶颈。近期方法宣称可实现80-90%压缩率且基准性能损失极小。我们指出此类评估忽略了结构性问题:注意力不仅是存储,更是路由机制,保留KV对并不保证语义可达性。本文提出基于物理视角的KV压缩分析框架,将其视为对令牌级路由的可控扰动,区分保留性、可达性与利用率。通过合成任务测试多实体追踪、消歧、指代消解与多跳推理,发现中等压缩率虽显著降低内部表征但精度下降甚微,暴露冗余;所有模型在90%压缩率附近均出现幻觉安全悬崖,与全局淘汰率(GER)峰值高度相关,暗示语义可达性的相变现象;不同架构路由动态各异,LLaMA呈现早期共识与晚期分化,Qwen则为后期汇聚型收敛,形成不同韧性特征。除擦除外,还识别出表征刚性问题:过度头部共识会破坏路由灵活性,即便令牌仍存。结果表明稀疏的令牌-路由结构决定压缩容忍度,将KV压缩重定义为注意力几何结构的探针,并将长上下文可扩展性与自注意力中的稀疏性及彩票猜想相联系。

原文摘要 · Abstract (English)

As context windows in LLMs scale to 100K+ tokens, the key-value (KV) cache becomes the dominant memory bottleneck, with recent methods claiming 80-90% savings and minimal benchmark degradation. We argue these evaluations miss a structural issue: attention is not just storage but routing, and retaining KV pairs does not guarantee semantic accessibility. We propose a physics-inspired view of KV compression as a controlled perturbation of token-level routing, distinguishing retention, accessibility, and utilization. Using synthetic tasks probing multi-entity tracking, disambiguation, coreference, and multi-hop reasoning, we find that moderate compression degrades internal representations with little accuracy loss, revealing redundancy; all models exhibit a sharp hallucination safety cliff near 90% compression, correlated with spikes in Global Eviction Ratio (GER), suggesting a phase transition in semantic reachability; and architectures differ in routing dynamics, with LLaMA showing early consensus and late diversification, and Qwen showing funnel-like late convergence, leading to distinct resilience profiles. Beyond erasure, we identify representational rigidity, where excessive head-level consensus collapses routing flexibility despite token survival. These results suggest sparse token-route structures govern compression tolerance, reframing KV compression as a structural probe of attention geometry and linking long-context scalability to sparsity and the lottery ticket hypothesis in self-attention.

大模型压缩注意力机制缓存优化长上下文

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