Generating Long Sequences with Sparse Transformers

Source
doi.org
Published
Apr 23, 2019

Transformers are powerful sequence models, but require time and memory that grows quadratically with the sequence length. In this paper we introduce sparse factorizations of the attention matrix which reduce this to $O(n \sqrt{n})$. We also introduce a) a v...

doi.org

Info

Published
Apr 23, 2019
Uploaded
Jul 10, 2026
Uploaded by
Trevor McFedries
Queried
0 times