Fast Interleaved Bidirectional Sequence Generation
Not on the map. Why?
Abstract (arXiv)
Independence assumptions during sequence generation can speed up inference, but parallel generation of highly inter-dependent tokens comes at a cost in quality. Instead of assuming independence between neighbouring tokens (semi-autoregressive decoding, SA), we take inspiration from bidirectional sequence generation and introduce a decoder that generates target words from the left-to-right and right-to-left directions simultaneously. We show that we can easily convert a standard architecture for unidirectional decoding into a bidirectional decoder by simply interleaving the two directions and adapting the word positions and self-attention masks. Our interleaved bidirectional decoder (IBDecoder) retains the model simplicity and training efficiency of the standard Transformer, and on five machine translation tasks and two document summarization tasks, achieves a decoding speedup of ~2X compared to autoregressive decoding with comparable quality. Notably, it outperforms left-to-right SA because the independence assumptions in IBDecoder are more felicitous. To achieve even higher speedups, we explore hybrid models where we either simultaneously predict multiple neighbouring tokens per direction, or perform multi-directional decoding by partitioning the target sequence. These methods achieve speedups to 4X-11X across different tasks at the cost of <1 BLEU or <0.5 ROUGE (on average). Source code is released at https://github.com/bzhangGo/zero.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 27 Oct 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 3; 2023: 3; 2024: 1; 2025: 1.
8 papers.
- 2022GrIPS: Gradient-free, Edit-based Instruction Search for Prompting Large Language Modelscited by 127
- 2024Efficient Prompting Methods for Large Language Models: A Surveycited by 46
- 2022Recent Advances in Neural Text Generation: A Task-Agnostic Surveycited by 14
- 2022Nested Named Entity Recognition as Latent Lexicalized Constituency Parsingcited by 14
- 2023Plum: Prompt Learning using Metaheuristiccited by 8
- 2023Similarity-weighted Construction of Contextualized Commonsense Knowledge Graphs for Knowledge-intense Argumentation Taskscited by 6
- 2023Approximating CKY with Transformerscited by 3
- 2025Understanding Syntactic Generalization in Structure-inducing Language Modelscited by 0
- 2025Understanding Syntactic Generalization in Structure-inducing Language Models11 Aug 2025
- 2024Efficient Prompting Methods for Large Language Models: A Survey1 Apr 2024
- 2023Plum: Prompt Learning using Metaheuristic14 Nov 2023
- 2023Similarity-weighted Construction of Contextualized Commonsense Knowledge Graphs for Knowledge-intense Argumentation Tasks15 May 2023
- 2023Approximating CKY with Transformers3 May 2023
- 2022GrIPS: Gradient-free, Edit-based Instruction Search for Prompting Large Language Models14 Mar 2022
- 2022Nested Named Entity Recognition as Latent Lexicalized Constituency Parsing9 Mar 2022
- 2022Recent Advances in Neural Text Generation: A Task-Agnostic Survey6 Mar 2022