Faster Transformer Decoding: N-gram Masked Self-Attention
Not on the map. Why?
Abstract (arXiv)
Motivated by the fact that most of the information relevant to the prediction of target tokens is drawn from the source sentence S=s1, ldots, sS, we propose truncating the target-side window used for computing self-attention by making an N-gram assumption. Experiments on WMT EnDe and EnFr data sets show that the N-gram masked self-attention model loses very little in BLEU score for N values in the range 4, ldots, 8, depending on the task.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 14 Jan 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 0; 2024: 2; 2025: 1; 2026: 1.
6 papers.
- 2024A Survey on Transformer Compressioncited by 46
- 2022Multilingual Neural Machine Translation with Deep Encoder and Multiple Shallow Decoderscited by 12
- 2024Revisiting the Markov Property for Machine Translationcited by 2
- 2021SimpleTRON: Simple Transformer with O(N) Complexitycited by 1
- 2025Chat-Ghosting: A Comparative Study of Methods for Auto-Completion in Dialog Systemscited by 1
- 2026Mask-Aware Execution for Efficient JEPA Trainingcited by 0
- 2026Mask-Aware Execution for Efficient JEPA Training19 Sep 2026
- 2025Chat-Ghosting: A Comparative Study of Methods for Auto-Completion in Dialog Systems8 Jul 2025
- 2024A Survey on Transformer Compression5 Feb 2024
- 2024Revisiting the Markov Property for Machine Translation3 Feb 2024
- 2022Multilingual Neural Machine Translation with Deep Encoder and Multiple Shallow Decoders5 Jun 2022
- 2021SimpleTRON: Simple Transformer with O(N) Complexity23 Nov 2021