mlsanityData to 14 Oct 2026

Periodic Weak Spots: Phase Sensitivity from Chunked KV-Cache Compression

arXiv 2609.36322 ↗First posted 28 Sep 2026cs.LG cs.AIcited by 0

On the map: Efficient LLM inference and serving → KV cache optimization

Abstract (arXiv)

Chunked KV-cache compression reduces the memory and attention costs of long-context inference by compressing windows of consecutive tokens into fewer cache entries at a fixed stride. Such compression also introduces a new positional coordinate: a token's phase, or its position relative to compression-window boundaries. We uncover a systematic asymmetry in models using such compression: the same information can be easy to retrieve at one phase and difficult at another. We call this periodic variation in retrieval performance phase sensitivity. In large open-weight models with such compression, long-context retrieval accuracy can differ by up to 40 percentage points across phases, revealing periodic weak spots that average benchmark scores can conceal. To investigate this behavior, we pretrain a family of transformers from scratch across multiple KV-compression designs, reproducing phase sensitivity across the variants. Mechanistic analysis using causal interventions in these models reveals phase specialization: different attention components contribute asymmetrically to retrieving information at different source phases. We further analyze idealized retrieval models, showing how gradient flow dynamics may favor sharp phase specialization. Evaluating models with chunked KV-cache compression thus requires measuring across compression phases: high average accuracy can coexist with systematic positional failures.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in KV cache optimization, one of 12 directions in Efficient LLM inference and serving. Builds on 28 of its 45 references that are in the map. First posted on arXiv 28 Sep 2026.

Builds on

28 of 45 references.

Closest ancestors · 8

Same direction, newest first

  1. 2026DeepSeek-V4.1-Flash: Pushing the Limits of KV Cache Compression17 Sep
  2. 2026Kwai Summary Attention Technical Report27 Apr
  3. 2024DuoAttention: Efficient Long-Context LLM Inference with Retrieval and Streaming Heads14 Oct
  4. 2024RazorAttention: Efficient KV Cache Compression Through Retrieval Heads22 Jul
  5. 2024SnapKV: LLM Knows What You are Looking for Before Generation22 Apr
  6. 2024SqueezeAttention: 2D Management of KV-Cache in LLM Inference via Layer-wise Optimal Budget7 Apr
  7. 2024LoMA: Lossless Compressed Memory Attention16 Jan
  8. 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models24 Jun

Other references · 20

  1. 2025Qwen3 Technical Reportcited by 8,820
  2. 2019Generating Long Sequences with Sparse Transformerscited by 1,546
  3. 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,346
  4. 2022Interpretability in the Wild: a Circuit for Indirect Object Identification in GPT-2 smallcited by 1,165
  5. 2026DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligencecited by 1,040
  6. 2024DeepSeek-V3 Technical Reportcited by 811
  7. 2023Learning to Compress Prompts with Gist Tokenscited by 390
  8. 2024Retrieval Head Mechanistically Explains Long-Context Factualitycited by 232
  9. 2023Landmark Attention: Random-Access Infinite Context Length for Transformerscited by 213
  10. 2023Zoology: Measuring and Improving Recall in Efficient Language Modelscited by 204
  11. 2025MoBA: Mixture of Block Attention for Long-Context LLMscited by 198
  12. 2023Birth of a Transformer: A Memory Viewpointcited by 161
8 more
  1. 2024Long Context Compression with Activation Beaconcited by 104
  2. 2023Transformers as Support Vector Machinescited by 74
  3. 2023Max-Margin Token Selection in Attention Mechanismcited by 58
  4. 2024MELODI: Exploring Memory Compression for Long Contextscited by 11
  5. 2025Controllably Efficient Language Modelscited by 3
  6. 2026Incremental Learning of Sparse Attention Patterns in Transformerscited by 2
  7. 2026Specialization of softmax attention heads: insights from the high-dimensional single-location modelcited by 2
  8. 2026Gradient Flow Polarizes Softmax Outputs towards Low-Entropy Solutionscited by 2

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Moment-KV: Momentum-Based Decode-Time KV Cache Compression for Long Generation
  2. 2026HeteroCache: A Dynamic Retrieval Approach to Heterogeneous KV Cache Compression for Long-Context LLM Inference
  3. 2026PuzzleKV: Page-Wise Low-Rank Decomposition for KV Cache Compression
  4. 2026Distance-KV: Exploiting Relative Distance for Efficient Long-Context Inference
  5. 2026Thinking Outside the Box: Retention and Transmission of Information in Sliding-Window KV Inference
  6. 2026StructKV: Preserving the Structural Skeleton for Scalable Long-Context Inference
  7. 2026Sparse Attention as a Range Searching Problem: Towards an Inference-Efficient Index for KV Cache
  8. 2025Compactor: Calibrated Query-Agnostic KV Cache Compression with Approximate Leverage Scores