CLLGOct 27, 2020

Fast Interleaved Bidirectional Sequence Generation

arXiv:2010.14481v1990 citationsHas Code
Originality Incremental advance
AI Analysis

This addresses the problem of slow inference in autoregressive models for NLP practitioners, offering a method that is incremental but provides practical speed improvements.

The paper tackles the trade-off between speed and quality in sequence generation by introducing an interleaved bidirectional decoder (IBDecoder) that generates tokens from both left-to-right and right-to-left directions simultaneously, achieving a decoding speedup of ~2X with comparable quality on machine translation and summarization tasks, and up to 4X-11X speedups with minor quality losses.

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.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes