Do Value Vectors in Deep Layers Need Context from the Residual Stream?
Not on the map. Why?
Abstract (arXiv)
The success of the transformer architecture is in large part due to its use of attention layers. An attention layer follows the standard neural network paradigm: it takes the residual stream as input and thereby produces context-dependent query, key, and value vectors. However, we find that model performance meaningfully improves when deeper layers learn only a context-free value vector to preserve the original token information, without drawing on any context from the residual stream. When the model has access to this context-free value vector, adding back the context-dependent component provides little additional benefit for aggregate benchmark performance. Such context-free value vectors can be stored as sparse model parameters, eliminating the need to recompute or persistently cache these values. Through systematic ablations on the key design choices for such context-free value vectors, we propose Bank of Values (BoV), a new way of computing value vectors in attention by learning a lookup table of token-specific value vectors for each of the last third of layers. Across 135M and 780M models, BoV improves validation loss over standard attention and, at 780M, the average score across 21 benchmarks, matching the previous best method that adds token information to the value vector with less compute and memory.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 41 of its 58 references that are in the map. First posted on arXiv 1 Jun 2026.
Builds on
41 of 58 references.
References · 41
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
- 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
- 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,793
29 more
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,311
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,093
- 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
- 2023AGIEval: A Human-Centric Benchmark for Evaluating Foundation Modelscited by 701
- 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 700
- 2018CoQA: A Conversational Question Answering Challengecited by 674
- 2024KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cachecited by 604
- 2024KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantizationcited by 571
- 2024FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precisioncited by 507
- 2025Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attentioncited by 391
- 2024DataComp-LM: In search of the next generation of training sets for language modelscited by 381
- 2024Patchscopes: A Unifying Framework for Inspecting Hidden Representations of Language Modelscited by 225
- 2024You Only Cache Once: Decoder-Decoder Architectures for Language Modelscited by 135
- 2024Reducing Transformer Key-Value Cache Size with Cross-Layer Attentioncited by 122
- 2019Large Memory Layers with Product Keyscited by 120
- 2019Augmenting Self-attention with Persistent Memorycited by 92
- 2026Conditional Memory via Scalable Lookup: A New Axis of Sparsity for Large Language Modelscited by 78
- 2025Nemotron-CLIMB: CLustering-based Iterative Data Mixture Bootstrapping for Language Model Pre-trainingcited by 62
- 2024Layer-Condensed KV Cache for Efficient Inference of Large Language Modelscited by 58
- 2024DenseFormer: Enhancing Information Flow in Transformers via Depth Weighted Averagingcited by 48
- 2018Training Deeper Neural Machine Translation Models with Transparent Attentioncited by 37
- 2023Mitigating Over-smoothing in Transformers via Regularized Nonlocal Functionalscited by 31
- 2024Value Residual Learningcited by 25
- 2025LAVa: Layer-wise KV Cache Eviction with Dynamic Budget Allocationcited by 16
- 2024MemoryFormer: Minimize Transformer Computation by Removing Fully-Connected Layerscited by 4
- 2025Improving Model Representation and Reducing KV Cache via Skip Connections with First Value Headscited by 4
- 2026The Residual Stream Is All You Need: On the Redundancy of the KV Cache in Transformer Inferencecited by 4
- 2025Key and Value Weights Are Probably All You Need: On the Necessity of the Query, Key, Value weight Triplet in Self-Attention Transformerscited by 2
- 2026MoVE: Mixture of Value Embeddings -- A New Axis for Scaling Parametric Memory in Autoregressive Modelscited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.