mlsanityData to 14 Oct 2026

Dual Dimensionality for Local and Global Attention

arXiv 2606.18587 ↗First posted 17 Jun 2026cs.CL cs.AIcited by 0

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

Abstract (arXiv)

Decoder-only Transformers compute attention over the KV cache of preceding tokens. Keys (and Values) are typically represented with the same dimensionality, regardless of its distance from the prediction target. In natural language, however, the next word is most strongly influenced by the immediately preceding tokens. We hypothesize that local and distant tokens impose asymmetric demands on representational capacity: local tokens are more critical for predicting immediate outputs and thus require richer representations, whereas distant tokens primarily serve as long-range memory, for which lower-dimensional representations may suffice. We formalize this idea as Distance-Adaptive Representation (DAR), implemented in a controlled setting that preserves full-dimensional representations within a local context window while assigning reduced-dimensional representations (e.g. 1/4 of the original dimensionality) to tokens beyond that window. Across multiple pretraining scales (70M to 410M parameters), as well as continued supervised fine-tuning on a 1B-scale model, this approach closely matches the performance of full-dimensional baselines. In contrast, uniformly reducing dimensionality across all token positions leads to worse performance. These results challenge the common assumption that key and value dimensionality should be uniform across token positions. Our findings suggest a new direction for designing attention architectures that adaptively allocate representational capacity across sequences, enabling further reductions in KV cache during inference.

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 29 of its 31 references that are in the map. First posted on arXiv 17 Jun 2026.

Builds on

29 of 31 references.

Closest ancestors · 4

Same direction, newest first

  1. 2024MatryoshkaKV: Adaptive KV Compression via Trainable Orthogonal Projection16 Oct
  2. 2024SnapKV: LLM Knows What You are Looking for Before Generation22 Apr
  3. 2023Efficient Memory Management for Large Language Model Serving with PagedAttention12 Sep
  4. 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models24 Jun

Other references · 25

  1. 2017Attention Is All You Needcited by 60,361
  2. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  3. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  4. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  5. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  6. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
  7. 2021Program Synthesis with Large Language Modelscited by 3,637
  8. 2020Longformer: The Long-Document Transformercited by 3,413
  9. 2016Pointer Sentinel Mixture Modelscited by 3,096
  10. 2022Training Compute-Optimal Large Language Modelscited by 3,019
  11. 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,411
  12. 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
13 more
  1. 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,822
  2. 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,786
  3. 2023LongBench: A Bilingual, Multitask Benchmark for Long Context Understandingcited by 1,417
  4. 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
  5. 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,135
  6. 2024Tulu 3: Pushing Frontiers in Open Language Model Post-Trainingcited by 1,053
  7. 2026DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligencecited by 1,040
  8. 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 717
  9. 2024MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attentioncited by 383
  10. 2022Matryoshka Representation Learningcited by 282
  11. 2025XAttention: Block Sparse Attention with Antidiagonal Scoringcited by 137
  12. 2024SKVQ: Sliding-window Key and Value Cache Quantization for Large Language Modelscited by 44
  13. 2022Datasheet for the Pilecited by 43

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2026Linear Predictability of Attention Heads in Large Language Models
  2. 2025Bridging the Dimensional Chasm: Uncover Layer-wise Dimensional Reduction in Transformers through Token Correlation
  3. 2023Manifold-Preserving Transformers are Effective for Short-Long Range Encoding
  4. 2026A Geometric Perspective on Next-Token Prediction in Large Language Models: Three Emerging Phases
  5. 2026Attention Degradation, Function Token Anchoring, and the Limits of Attention-Based Intervention in Large Language Models
  6. 2026On the Nature of Attention Sink that Shapes Decoding Strategy in Omni-LLMs
  7. 2025Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attention
  8. 2026Learning When to Attend: Conditional Memory Access for Long-Context LLMs