Keyless Attention: Value-Space Routing and Value-Only Caching for Efficient Transformers
On the map: Efficient LLM inference and serving → KV cache optimization
Abstract (arXiv)
Transformer architectures form the foundation of modern natural language processing, yet the Key-Value (KV) cache introduces substantial memory and bandwidth overhead during long-context generation, increasingly bottlenecking large-scale deployment. We propose Keyless Attention, a novel attention mechanism that replaces the conventional key projection with a dedicated value-space routing projection, eliminating key representations from the attention computation entirely and yielding a Value-Only Cache that reduces KV-cache memory by 50% while improving decode throughput. Experiments across multiple models and architectures demonstrate that Keyless Attention achieves comparable perplexity and downstream task performance to standard QKV attention, while consistently reducing KV-cache memory by 50%. Furthermore, Keyless Attention exhibits slower validation loss degradation after the best epoch, indicating improved robustness against overfitting. Ablation studies confirm that the dedicated value-space routing projection is critical, with Keyless Attention outperforming KV-sharing methods that eliminate the key cache without replacing its routing role. Experiments in the pretraining regime further confirm the viability of Keyless Attention in industrial settings.
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 33 of its 41 references that are in the map. First posted on arXiv 20 Jun 2026.
Builds on
33 of 41 references.
Closest ancestors · 4
Same direction, newest first
- 2024TurboAttention: Efficient Attention Approximation For High Throughputs LLMs11 Dec
- 2024ThinK: Thinner Key Cache by Query-Driven Pruning30 Jul
- 2024RazorAttention: Efficient KV Cache Compression Through Retrieval Heads22 Jul
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttention12 Sep
Other references · 29
- 2017Attention Is All You Needcited by 60,361
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
- 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
- 2020Longformer: The Long-Document Transformercited by 3,413
- 2016Pointer Sentinel Mixture Modelscited by 3,096
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2024Qwen2 Technical Reportcited by 2,120
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 2,022
- 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,786
17 more
- 2020Rethinking Attention with Performerscited by 1,601
- 2019Generating Long Sequences with Sparse Transformerscited by 1,546
- 2020Linformer: Self-Attention with Linear Complexitycited by 1,474
- 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
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,135
- 2015Effective Approaches to Attention-based Neural Machine Translationcited by 1,026
- 2017Crowdsourcing Multiple Choice Science Questionscited by 765
- 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 717
- 2022Efficiently Scaling Transformer Inferencecited by 539
- 2016A Corpus and Evaluation Framework for Deeper Understanding of Commonsense Storiescited by 417
- 2024vAttention: Dynamic Memory Management for Serving LLMs without PagedAttentioncited by 98
- 2025Token Pruning in Multimodal Large Language Models: Are We Solving the Right Problem?cited by 76
- 2025KV Admission: Learning What to Write for Efficient Long-Context LLM Inferencecited by 4
- 2026Zipage: Maintain High Request Concurrency for LLM Reasoning through Compressed PagedAttentioncited by 4
- 2026Do Transformers Need Three Projections? Systematic Study of QKV Variantscited by 3
- 2026QV May Be Enough: Toward the Essence of Attention in LLMscited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Low-Rank Key Value Attention
- 2025End-to-End Transformer Acceleration Through Processing-in-Memory Architectures
- 2026Bridging KV-Cache Quantization and Linear Attention: From Theory to Pretrained Weight Migration
- 2026LOOKAT: Lookup-Optimized Key-Attention for Memory-Efficient Transformers
- 2024MLKV: Multi-Layer Key-Value Heads for Memory Efficient Transformer Decoding
- 2026Learning how to Forget: Fine-tuning for Long-Context Sparse Attention
- 2024Reducing Transformer Key-Value Cache Size with Cross-Layer Attention
- 2025Trellis: Learning to Compress Key-Value Memory in Attention Models