TL;DR
RetroAttention introduces a retrospective KV cache update method for LLMs, improving long-context generation efficiency and accuracy by correcting past attention outputs with minimal latency overhead.
Contribution
It presents RetroAttention, a novel technique for revising past attention outputs using new KV entries, enhancing long-context generation in LLMs.
Findings
Outperforms state-of-the-art KV compression methods
Increases effective KV exposure by up to 1.6×
Improves accuracy by up to 21.9%
Abstract
Large Language Models (LLMs) are increasingly deployed in long-context tasks such as reasoning, code generation, and multi-turn dialogue. However, inference over extended contexts is bottlenecked by the Key-Value (KV) cache, whose memory footprint grows linearly with sequence length and dominates latency at each decoding step. While recent KV cache compression methods identify and load important few tokens, they focus predominantly on input contexts and fail to address the cumulative attention errors that arise during long decoding. In this paper, we introduce RetroAttention, a novel KV cache update technique that retrospectively revises past attention outputs using newly arrived KV entries from subsequent decoding steps. By maintaining a lightweight output cache, RetroAttention enables past queries to be efficiently supplemented with more contexts, while incurring minimal latency…
Peer Reviews
Decision·ICLR 2026 Poster
S1. This paper tackles an important problem of the refinement of sparse KV cache selection. S2. In stead of proposing KV cache sparsification approaches, this paper proposes a refinement approach for the KV cache sparsificaitons, which has the potential to be applied to many backbone sparsifications. S3. The proposed approach is a backed up with formal time and space overhead analysis.
W1. The experiments are limited to small scale models. Experiments on at least medium size, e.g., 32B models, would be useful. W2. The comparison approaches are limited. More recent KV cache compression approaches, like ICECache, ArkVale, PQCache, MagicPIG, etc, should also be evaluated. W3. I would suggest to also test larger cache reuse depth, e.g., w > 5, to show the effectiveness of reusage.
1. RetroAttention has consistent gains over strong baselines while adding only marginal latency thanks to its memory-bound design. 2. The scheme expands each query's effective KV budget by up to 1.6x without increasing the actual KV budget or KV memory traffic. This helps improve contextual completeness under fixed memory. This is a very nice approach and I liked this part.
1. This method works only long-generation scenarios. This approach wont help if KV cache overheads are not a problem (such as cases using extreme quantization). 2. An interesting fact is that the methods are not very simple (which would have been preferred). The benefits saturate as the retrospective window increases (nearly w=8). The approach introduces extra kernel steps (mask management, output merges, KV overwrites) that, while small, add complexity and non-zero overhead.
+ The work introduces a new method for updating past KV caches using information from future tokens, allowing the model to retrospectively correct potential errors accumulated in earlier cache entries. + Concrete mechanism with system awareness. The design (supplementary attention + output cache + KV overwrite downstream) is explicit and connected to a memory-bound analysis; figures and pseudo-code aid clarity.
- Motivation not fully convincing relative to simpler practices. The paper assumes non-trivial benefits from recomputing within a small local window. However, in LServe-style serving (LServe: Efficient Long-sequence LLM Serving with Unified Sparse Attention), adjacent tokens often select the same pages—so neighboring queries tend to attend to similar KV slices. If adjacent queries already share top-k pages, retrospective supplementation within a small window may add little new signal while incre
Videos
Taxonomy
TopicsTopic Modeling · Natural Language Processing Techniques · Multimodal Machine Learning Applications
