Pith. sign in

REVIEW 3 cited by

Insertion-based Decoding with automatically Inferred Generation Order

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1902.01370 v3 pith:TFCLLAZF submitted 2019-02-04 cs.CL cs.LG

classification cs.CLcs.LG
keywords generationorderordersdecodingadaptivealgorithmarbitraryconventional
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Conventional neural autoregressive decoding commonly assumes a fixed left-to-right generation order, which may be sub-optimal. In this work, we propose a novel decoding algorithm -- InDIGO -- which supports flexible sequence generation in arbitrary orders through insertion operations. We extend Transformer, a state-of-the-art sequence generation model, to efficiently implement the proposed approach, enabling it to be trained with either a pre-defined generation order or adaptive orders obtained from beam-search. Experiments on four real-world tasks, including word order recovery, machine translation, image caption and code generation, demonstrate that our algorithm can generate sequences following arbitrary orders, while achieving competitive or even better performance compared to the conventional left-to-right generation. The generated sequences show that InDIGO adopts adaptive generation orders based on input information.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. FlowSeq: Non-Autoregressive Conditional Sequence Generation with Generative Flow

    cs.CL 2019-09 accept novelty 7.0 of 10

    A flow-based latent variable model enables non-autoregressive neural machine translation with parallel decoding and near-constant time, reaching BLEU scores comparable to state-of-the-art non-autoregressive systems.

  2. Latent-Variable Non-Autoregressive Neural Machine Translation with Deterministic Inference Using a Delta Posterior

    cs.CL 2019-08 conditional novelty 6.0 of 10

    A latent-variable non-autoregressive translation model with deterministic delta-posterior inference matches autoregressive quality within 2 BLEU points while decoding 12.5x faster.

  3. Attending to Future Tokens For Bidirectional Sequence Generation

    stat.ML 2019-08 conditional novelty 6.0 of 10

    BISON uses placeholder tokens in a bidirectional Transformer to generate sequences, and fine-tuning BERT with this scheme beats GPT2 on two dialogue tasks.

Pith tools