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.

Similar Papers

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 .
An Empirical Study of Iterative Refinements for Non-autoregressive Translation (2025.acl-long)

Copied to clipboard

Challenge: Iterative non-autoregressive (NAR) models have recently demonstrated impressive performance in varied generation tasks, surpassing the autoregressive Transformer.
Approach: They propose a strategy to conduct efficient refinements without performance declines by using two simple metrics to identify potential problems existing in current refinement processes.
Outcome: The proposed model outperforms the autoregressive Transformer by around one BLEU on average.
Tree-Structured Non-Autoregressive Decoding for Sequence-to-Sequence Text Generation (2025.findings-emnlp)

Copied to clipboard

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.
Deterministic Non-Autoregressive Neural Sequence Modeling by Iterative Refinement (D18-1)

Copied to clipboard

Challenge: Despite its success, neural autoregressive modeling has its weakness in decoding, i.e., finding the most likely sequence.
Approach: They propose a conditional non-autoregressive neural sequence model based on iterative refinement based upon latent variable models and conditional denoising autoencoders.
Outcome: The proposed model significantly speeds up decoding while maintaining the generation quality comparable to the autoregressive counterpart.
FlowSeq: Non-Autoregressive Conditional Sequence Generation with Generative Flow (D19-1)

Copied to clipboard

Challenge: Neural sequence-to-sequence models are autoregressive, meaning they factor the joint probability of the output sequence into the product of probabilities over the next to-ken.
Approach: They propose a non-autoregressive sequence generation model using latent variables . they use generative flow to model complex distributions using neural networks .
Outcome: The proposed model performs comparable to state-of-the-art models and has constant decoding time w.r.t the sequence length.
JANUS: Joint Autoregressive and Non-autoregressive Training with Auxiliary Loss for Sequence Generation (2022.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to train autoregressive and non-autoregressive models only consider relevance of model parameters, ignoring correlations between the two manners.
Approach: They propose a joint autoregressive and non-autoregressive training method using aUxiliary losS to enhance the model performance in both AR and NAR manners simultaneously.
Outcome: The proposed method improves the model performance in both AR and NAR manners and reduces the inference latency.
Exploring Non-Autoregressive Text Style Transfer (2021.emnlp-main)

Copied to clipboard

Challenge: Existing methods for text style transfer use autoregressive decoding, but they are slow and low parallelizability.
Approach: They propose a base NAR model by directly adapting the common training scheme from its AutoRegressive counterpart.
Outcome: The proposed model sacrifices performance due to lack of conditional dependence between output tokens . knowledge distillation, contrastive learning, and iterative decoding are employed to improve the model .
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 Machine Translation: It’s Not as Fast as it Seems (2022.naacl-main)

Copied to clipboard

Challenge: Efficient machine translation models are commercially important as they can increase inference speeds, reduce costs and carbon emissions.
Approach: They compare NAR models with autoregressive models to evaluate their performance . they point out flaws in evaluation methodology and argue for consistent evaluation .
Outcome: The proposed model is faster on GPUs, but slower under more realistic usage conditions.

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