Moment-KV: Momentum-Based Decode-Time KV Cache Compression for Long Generation
On the map: Efficient LLM inference and serving → KV cache optimization
Abstract (arXiv)
Key-Value (KV) cache remains a major bottleneck for deploying Large Language Models (LLMs) in long-generation tasks. Prior work often applies uniform compression across both prefill and decoding caches, but compressing the prefill cache degrades performance by corrupting critical context. While preserving the prefill cache is essential, decoding-phase compression remains underexplored, with existing methods relying on rigid recency windows or instantaneous attention. Our analysis of attention dynamics reveals strong temporal patterns: critical tokens receive sustained attention over long horizons, while local reasoning involves short-lived bursts. Static heuristics fail to capture this behavior, leading to premature eviction of important tokens or retention of stale ones. We propose Moment-KV, a decoding-time KV cache compression method based on momentum-driven temporal attention aggregation. Our method models token importance as a continuously evolving state, where attention is aggregated with decay, capturing both long-term influence and recent relevance. Experiments show that Moment-KV significantly improves generation fidelity in long-generation tasks (2.3-3.2 %) while maintaining decoding latency.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in KV cache optimization, one of 12 directions in Efficient LLM inference and serving. Builds on 11 of its 14 references that are in the map. First posted on arXiv 28 May 2026.
Builds on
11 of 14 references.
Closest ancestors · 6
Same direction, newest first
- 2025FlowKV: Enhancing Multi-Turn Conversational Coherence in LLMs via Isolated Key-Value Cache Management21 May
- 2024SCOPE: Optimizing Key-Value Cache Compression in Long-context Generation18 Dec
- 2024A Simple and Effective L2 Norm-Based Strategy for KV Cache Compression17 Jun
- 2024PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling4 Jun
- 2024PyramidInfer: Pyramid KV Cache Compression for High-throughput LLM Inference21 May
- 2024SnapKV: LLM Knows What You are Looking for Before Generation22 Apr
Other references · 5
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2021Training Verifiers to Solve Math Word Problemscited by 9,743
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
- 2024∞Bench: Extending Long Context Evaluation Beyond 100K Tokenscited by 360
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025AttentionPredictor: Temporal Patterns Matter for KV Cache Compression
- 2025Retrospective Sparse Attention for Efficient Long-Context Generation
- 2024KV-Compress: Paged KV-Cache Compression with Variable Compression Rates per Attention Head
- 2026Where Matters More Than What: Decoding-aligned KV Cache Compression via Position-aware Pseudo Queries
- 2026More Than a Quick Glance: Overcoming the Greedy Bias in KV-Cache Compression
- 2026Behavior-Preserving KV Cache Compression
- 2026SGD-KV: Summarization Guided KV Cache Compression
- 2025G-KV: Decoding-Time KV Cache Eviction with Global Attention