Shared Global KV with Layer-Specific Local History
Not on the map. Why?
Abstract (arXiv)
Decoder-only Transformer language models cache keys and values (KV) to reuse past computation during generation. Sharing KV across layers saves storage but reduces the diversity of representations available across depth. We study what local memory should retain alongside shared global KV, separating historical content from the input source used to form it. At 126M parameters and 2K context, an eight-seed study finds about 1.4% lower held-out test perplexity with local history than with a current-token local branch. Capacity, entry-count and training-compute controls support the value of historical content. In a two-seed comparison, this value persists when adjacent layers share local inputs while retaining independent projections; source sharing also shortens exact cache-construction dependencies. Against GQA and adjacent-layer KV sharing, equal bounded learning-rate searches and new-seed confirmation yield better same-source likelihood with larger caches and higher long-request latency. The ordering against adjacent-layer sharing persists after equal-token adaptation to 8K, with a short-context cost. The eight-seed external-book history effect remains uncertain, and downstream outcomes vary by task. We derive a sufficient suffix schedule that reduces upper-layer construction work while preserving the complete cache in exact arithmetic.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 28 of its 34 references that are in the map. First posted on arXiv 23 Sep 2026.
Builds on
28 of 34 references.
References · 28
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
- 2020Longformer: The Long-Document Transformercited by 3,413
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2020GLU Variants Improve Transformercited by 1,804
- 2019Root Mean Square Layer Normalizationcited by 1,480
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
- 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,160
- 2023Extending Context Window of Large Language Models via Positional Interpolationcited by 740
- 2019Compressive Transformers for Long-Range Sequence Modellingcited by 726
16 more
- 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 717
- 2025Gated Attention for Large Language Models: Non-linearity, Sparsity, and Attention-Sink-Freecited by 283
- 2024You Only Cache Once: Decoder-Decoder Architectures for Language Modelscited by 144
- 2024Reducing Transformer Key-Value Cache Size with Cross-Layer Attentioncited by 131
- 2024Hymba: A Hybrid-head Architecture for Small Language Modelscited by 99
- 2026Attention Residualscited by 65
- 2024Layer-Condensed KV Cache for Efficient Inference of Large Language Modelscited by 59
- 2024Block Transformer: Global-to-Local Language Modeling for Fast Inferencecited by 32
- 2025Parallel Loop Transformer for Efficient Test-Time Computation Scalingcited by 24
- 2024GoldFinch: High Performance RWKV/Transformer Hybrid with Linear Pre-Fill and Extreme KV-Cache Compressioncited by 18
- 2024A Systematic Study of Cross-Layer KV Sharing for Efficient LLM Inferencecited by 17
- 2025Reconstructing KV Caches with Cross-layer Fusion For Enhanced Transformerscited by 6
- 2024Inference-Friendly Models With MixAttentioncited by 4
- 2026POP: Prefill-Only Pruning for Efficient Large Model Inferencecited by 2
- 2026UniPrefill: Universal Long-Context Prefill Acceleration via Block-wise Dynamic Sparsificationcited by 2
- 2026You Only Index Once: Cross-Layer Sparse Attention with Shared Routingcited by 2
Built on by
Not cited yet.