mlsanityData to 14 Oct 2026

Tensor Decomposition of Transformer Key-Value Caches: Spectral Structure and Format Comparison

arXiv 2609.28029 ↗First posted 23 Sep 2026math.NA cs.CL cs.LGcited by 0

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

Abstract (arXiv)

The key-value (KV) cache of autoregressive transformers can be viewed as a fourth-order tensor spanning attention heads, tokens, features, and grouped layers. We measure the singular-value spectra of all four mode unfoldings on Mistral-7B-v0.3 and LLaMA-2-13B and compare four standard tensor decompositions: Tucker, CP, tensor train, and t-SVD, at matched storage. The spectra partition the four axes into two classes. The token and feature modes carry low-rank structure, particularly for keys. The head and layer modes are nearly full-rank and resist compression at any practical error level. Among the four decompositions, Tucker achieves the lowest reconstruction error at every compression ratio from 2× to 5×, because it can leave the full-rank modes untouched. Comparisons with two-dimensional unfolding baselines show that the preferred representation differs between keys and values: 2D methods achieve lower key error, while four-way Tucker achieves lower value error at matched storage. A mode-pinning theorem certifies the full-rank preservation from the measured spectra alone. Two further spectral properties affect the compressible modes without touching the full-rank ones: values reach a higher error floor than keys at every ratio, and post-RoPE keys lose 41% - 64% of their pre-RoPE compressibility on both models.

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 12 of its 27 references that are in the map. First posted on arXiv 23 Sep 2026.

Builds on

12 of 27 references.

Closest ancestors · 2

Same direction, newest first

  1. 2025xKV: Cross-Layer KV-Cache Compression via Aligned Singular Vector Extraction24 Mar
  2. 2023Efficient Memory Management for Large Language Model Serving with PagedAttention12 Sep

Other references · 10

  1. 2017Attention Is All You Needcited by 60,361
  2. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  3. 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
  4. 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
  5. 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 717
  6. 2015Tensorizing Neural Networkscited by 250
  7. 2014Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decompositioncited by 203
  8. 2015Compression of Deep Convolutional Neural Networks for Fast and Low Power Mobile Applicationscited by 162
  9. 2016TensorLy: Tensor Learning in Pythoncited by 104
  10. 2017A Riemannian trust-region method for low-rank tensor completioncited by 8

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2022HEAT: Hardware-Efficient Automatic Tensor Decomposition for Transformer Compression
  2. 2026eOptShrinkQ: Near-Lossless KV Cache Compression Through Optimal Spectral Denoising and Quantization
  3. 2026The Residual Stream Is All You Need: On the Redundancy of the KV Cache in Transformer Inference
  4. 2026Tensor Cache: Eviction-conditioned Associative Memory for Transformers
  5. 2026Codec-Gauge: Learning Compression-Friendly Gauges for Transformer KV Caches
  6. 2025Time and Memory Trade-off of KV-Cache Compression in Tensor Transformer Decoding
  7. 2025Compression Barriers for Autoregressive Transformers
  8. 2026OCTOPUS: Optimized KV Cache for Transformers via Octahedral Parametrization Under optimal Squared error quantization