Transformer Reconstructed with Dynamic Value Attention
Not on the map. Why?
Abstract (arXiv)
Since transformer was firstly published in 2017, several works have been proposed to optimize it. However, the major structure of transformer remains unchanged, ignoring one of its main intrinsic limitations, which is the same static value is used for every query in a head. Transformer itself tries to solve this problem by implementing multi-head attentions, yet the number of heads is limited by complexity. I propose a method to decide a value for each query dynamically, which could cut down all the redundant heads, keeping only one. Consequently, the following feed forward network could be cut down entirely, as each revised embedding has already fetched enough useful values far beyond the context. As a result, a single-head Dynamic Value Attention (DVA) is all you need in a transformer. According to the experiment, DVA may save 37.6% training time than the original transformer meanwhile increasing the learning capability.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 13 references that are in the map. First posted on arXiv 22 Dec 2025.
Builds on
8 of 13 references.
References · 8
- 2017Attention Is All You Needcited by 60,361
- 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
- 2014Sequence to Sequence Learning with Neural Networkscited by 2,986
- 2023Resurrecting Recurrent Neural Networks for Long Sequencescited by 408
- 2025Gated Attention for Large Language Models: Non-linearity, Sparsity, and Attention-Sink-Freecited by 283
- 2017Parallelizing Linear Recurrent Neural Nets Over Sequence Lengthcited by 127
- 2021Transformer Acceleration with Dynamic Sparse Attentioncited by 19
Built on by
Not cited yet.