Challenge: Autoregressive Transformers suffer from high inference latency due to sequential token generation.
Approach: They propose a tree-structured non-autoregressive decoding paradigm that bridges autoregressive and non-automatic decoding.
Outcome: The proposed paradigm outperforms autoregressive and non-autoregressive decoding in machine translation and paraphrase generation.

Similar Papers

Non-Autoregressive Models for Fast Sequence Generation (2022.emnlp-tutorials)

Copied to clipboard

Challenge: Autoregressive (AR) models can only generate target sequence word-by-word due to the AR mechanism and suffer from slow inference.
Approach: This tutorial provides an introduction to non-autoregressive sequence generation.
Outcome: This tutorial explains how to generate non-autoregressive sequence generation models.
Non-Autoregressive Sequence Generation (2022.acl-tutorials)

Copied to clipboard

Challenge: Non-autoregressive sequence generation (NAR) models generate output sequences in parallel to speed up generation process.
Approach: This tutorial provides a thorough introduction and review of non-autoregressive sequence generation . it aims to generate the entire or partial output sequences in parallel to speed up the generation process .
Outcome: This tutorial provides a thorough introduction and review of non-autoregressive sequence generation . it aims to reduce the performance gap between state-of-the-art models due to lack of modeling power .
A Study of Non-autoregressive Model for Sequence Generation (2020.acl-main)

Copied to clipboard

Challenge: Non-autoregressive (NAR) models generate all tokens in parallel, resulting in faster generation speed compared to autoregressive models.
Approach: They propose to use knowledge distillation and source-target alignment to bridge the gap between NAR and autoregressive models in various tasks.
Outcome: The proposed techniques can speed up NAR models in some tasks but not all . the proposed techniques reduce target token dependency while allowing for faster inference .
Non-Autoregressive Text Generation with Pre-trained Language Models (2021.eacl-main)

Copied to clipboard

Challenge: Autoregressive generation models generate tokens in a left-to-right, token-by-token fashion, resulting in lag in inference.
Approach: They propose to use BERT as the backbone of a non-autoregressive generation model for greatly improved performance.
Outcome: The proposed model outperforms existing non-autoregressive models and achieves competitive performance with many strong autoregressive model.
Non-Autoregressive Semantic Parsing for Compositional Task-Oriented Dialog (2021.naacl-main)

Copied to clipboard

Challenge: Semantic parsing using sequence-to-sequence models is stymied by higher compute requirements and higher latency.
Approach: They propose a non-autoregressive approach to predict semantic parse trees with an efficient seq2seq model architecture.
Outcome: The proposed architecture achieves an 81% reduction in latency on TOP dataset and retains competitive performance over non-pretrained models on three different semantic parsing datasets.
Directed Acyclic Transformer Pre-training for High-quality Non-autoregressive Text Generation (2023.tacl-1)

Copied to clipboard

Challenge: Existing non-AutoRegressive (NAR) text generation models lack proper pre-training, making them far behind pre-trained autoregressive models.
Approach: They propose a novel pre-training task to promote prediction consistency in non-autoregressive (NAR) generation.
Outcome: The proposed model outperforms existing pre-trained models and achieves 17 times speedup in throughput.
Enriching Non-Autoregressive Transformer with Syntactic and Semantic Structures for Neural Machine Translation (2021.eacl-main)

Copied to clipboard

Challenge: Existing non-autoregressive models have boosted the efficiency of neural machine translation, but their performance is significantly worse than that of autoregressive counterparts.
Approach: They propose to incorporate syntactic and semantic structures among natural languages into a non-autoregressive Transformer for the task of neural machine translation.
Outcome: The proposed model achieves faster speed and keeps translation quality compared with other models.
Insertion-based Tree Decoding (2021.findings-acl)

Copied to clipboard

Challenge: Existing non-autoregressive decoders that are sub-linear can speed up inference for longer sequences.
Approach: They propose a sub-linear nonautoregressive tree decoder that uses tree-based insertion operations to generate trees in sub-lines . they evaluate their approach on semantic parsing and compare it against strong baselines .
Outcome: The proposed approach achieves competitive accuracies while reducing the number of decoding steps.
Non-Autoregressive Sentence Ordering (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing sentence ordering approaches only leverage unilateral dependencies during decoding and cannot fully explore the semantic dependency between sentences.
Approach: They propose a non-autoregressive ordering network that explores bilateral dependencies between sentences and predicts sentences for each position in parallel.
Outcome: The proposed model outperforms existing autoregressive sentence ordering approaches and yields competitive performance compared with the state-of-the-arts.
POS-Constrained Parallel Decoding for Non-autoregressive Generation (2021.acl-long)

Copied to clipboard

Challenge: Existing non-autoregressive generation systems face multimodality problem due to conditionally independent decoding.
Approach: They propose to incorporate linguistic structure into NAG inference instead of teacher AG . they propose a method that provides a specific POS sequence to constrain the NAG model .
Outcome: The proposed method improves NAG models on four text generation tasks to a greater extent compared to knowledge distillation.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations