mlsanityData to 14 Oct 2026

Unlocking the Address Book: Dissecting the Sparse Semantic Structure of LLM Key-Value Caches via Sparse Autoencoders

arXiv 2512.10547 ↗First posted 11 Dec 2025cs.LGcited by 1

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

also in 1 more
Abstract (arXiv)

The Key-Value (KV) cache is the primary memory bottleneck in long-context Large Language Models, yet it is typically treated as an opaque numerical tensor. In this work, we propose STA-Attention, a framework that utilizes Top-K Sparse Autoencoders (SAEs) to decompose the KV cache into interpretable ``semantic atoms.'' Unlike standard L1-regularized SAEs, our Top-K approach eliminates shrinkage bias, preserving the precise dot-product geometry required for attention. Our analysis uncovers a fundamental Key-Value Asymmetry: while Key vectors serve as highly sparse routers dominated by a ``Semantic Elbow,'' deep Value vectors carry dense content payloads requiring a larger budget. Based on this structure, we introduce a Dual-Budget Strategy that selectively preserves the most informative semantic components while filtering representational noise. Experiments on Yi-6B, Mistral-7B, Qwen2.5-32B, and others show that our semantic reconstructions maintain perplexity and zero-shot performance comparable to the original models, effectively bridging the gap between mechanistic interpretability and faithful attention modeling.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in KV cache optimization, one of 12 directions in Efficient LLM inference and serving. Builds on 29 of its 40 references that are in the map. First posted on arXiv 11 Dec 2025.

Builds on

29 of 40 references.

Closest ancestors · 6

Same direction, newest first

  1. 2025RocketKV: Accelerating Long-Context LLM Inference via Two-Stage KV Cache Compression19 Feb
  2. 2024Lexico: Extreme KV Cache Compression via Sparse Coding over Universal Dictionaries12 Dec
  3. 2024ShadowKV: KV Cache in Shadows for High-Throughput Long-Context LLM Inference28 Oct
  4. 2024Compute Or Load KV Cache? Why Not Both?4 Oct
  5. 2023Efficient Memory Management for Large Language Model Serving with PagedAttention12 Sep
  6. 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models24 Jun

Other references · 23

  1. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  2. 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,548
  3. 2022Locating and Editing Factual Associations in GPTcited by 2,691
  4. 2023Sparse Autoencoders Find Highly Interpretable Features in Language Modelscited by 1,420
  5. 2020Transformer Feed-Forward Layers Are Key-Value Memoriescited by 1,336
  6. 2022Mass-Editing Memory in a Transformercited by 1,001
  7. 2022Toy Models of Superpositioncited by 971
  8. 2019Are Sixteen Heads Really Better than One?cited by 816
  9. 2022Transformers learn in-context by gradient descentcited by 732
  10. 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 717
  11. 2020Intrinsic Dimensionality Explains the Effectiveness of Language Model Fine-Tuningcited by 671
  12. 2021Knowledge Neurons in Pretrained Transformerscited by 601
11 more
  1. 2023FlexGen: High-Throughput Generative Inference of Large Language Models with a Single GPUcited by 575
  2. 2024Scaling and evaluating sparse autoencoderscited by 553
  3. 2022Efficiently Scaling Transformer Inferencecited by 539
  4. 2024Gemma Scope: Open Sparse Autoencoders Everywhere All At Once on Gemma 2cited by 394
  5. 2023Linearity of Relation Decoding in Transformer Language Modelscited by 200
  6. 2020Low-Rank Bottleneck in Multi-head Attention Modelscited by 89
  7. 2021Sparse is Enough in Scaling Transformerscited by 86
  8. 2017Residual Connections Encourage Iterative Inferencecited by 77
  9. 2023Successor Heads: Recurring, Interpretable Attention Heads In The Wildcited by 77
  10. 2025CommVQ: Commutative Vector Quantization for KV Cache Compressioncited by 28
  11. 2024Head-wise Shareable Attention for Large Language Modelscited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2025SALS: Sparse Attention in Latent Space for KV cache Compression
  2. 2024CSR:Achieving 1 Bit Key-Value Cache via Sparse Representation
  3. 2026PuzzleKV: Page-Wise Low-Rank Decomposition for KV Cache Compression
  4. 2025Progressive Sparse Attention: Algorithm and System Co-design for Efficient Attention in LLM Serving
  5. 2025Homogeneous Keys, Heterogeneous Values: Exploiting Local KV Cache Asymmetry for Long-Context LLMs
  6. 2025Cache Me If You Must: Adaptive Key-Value Quantization for Large Language Models
  7. 2025KV-CAR: KV Cache Compression using Autoencoders and KV Reuse in Large Language Models
  8. 2026Learning how to Forget: Fine-tuning for Long-Context Sparse Attention