Skip to content
naulon
Not checkedNot checked for notices yet.

Insertion-based Decoding with Automatically Inferred Generation Order

Gu, Jiatao, Liu, Qi, Cho, Kyunghyun

Transactions of the Association for Computational Linguistics · 2019

doi:10.1162/tacl_a_00292 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

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 with the conventional left-to-right generation. The generated sequences show that InDIGO adopts adaptive generation orders based on input information.

Abstract licence: CC BY

References64

  1. 34.

39 more references, whose wording the paper’s licence keeps private.

All 64 references

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.