Speeding Up Entmax
Not on the map. Why?
Abstract (arXiv)
Softmax is the de facto standard in modern neural networks for language processing when it comes to normalizing logits. However, by producing a dense probability distribution each token in the vocabulary has a nonzero chance of being selected at each generation step, leading to a variety of reported problems in text generation. α-entmax of Peters et al. (2019, arXiv:1905.05702) solves this problem, but is considerably slower than softmax. In this paper, we propose an alternative to α-entmax, which keeps its virtuous characteristics, but is as fast as optimized softmax and achieves on par or better performance in machine translation task.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 16 of its 40 references that are in the map. First posted on arXiv 12 Nov 2021.
Builds on
16 of 40 references.
References · 16
- 2017Attention Is All You Needcited by 60,361
- 2016Layer Normalizationcited by 5,669
- 2014Sequence to Sequence Learning with Neural Networkscited by 2,986
- 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,918
- 2019The Curious Case of Neural Text Degenerationcited by 2,916
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2018A Call for Clarity in Reporting BLEU Scorescited by 1,799
- 2018Hierarchical Neural Story Generationcited by 1,193
- 2016From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classificationcited by 341
- 2019Sparse Sequence-to-Sequence Modelscited by 170
- 2019Adaptively Sparse Transformerscited by 155
- 2019On NMT Search Errors and Model Errors: Cat Got Your Tongue?cited by 114
4 more
- 2021Sparse Attention with Linear Unitscited by 41
- 2018Sparse and Constrained Attention for Neural Machine Translationcited by 13
- 2021Smoothing and Shrinking the Sparse Seq2Seq Search Spacecited by 11
- 2019Machine Translation of Restaurant Reviews: New Corpus for Domain Adaptation and Robustnesscited by 10
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 1; 2025: 1.
3 papers.