Pith. sign in

REVIEW 2 cited by

Non-Monotonic Sequential Text Generation

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.02192 v3 pith:A7C4ERLE submitted 2019-02-05 cs.CL cs.LGstat.ML

classification cs.CLcs.LGstat.ML
keywords generationtextwordsframeworkgenerategeneratinglearningleft
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Standard sequential generation methods assume a pre-specified generation order, such as text generation methods which generate words from left to right. In this work, we propose a framework for training models of text generation that operate in non-monotonic orders; the model directly learns good orders, without any additional annotation. Our framework operates by generating a word at an arbitrary position, and then recursively generating words to its left and then words to its right, yielding a binary tree. Learning is framed as imitation learning, including a coaching method which moves from imitating an oracle to reinforcing the policy's own preferences. Experimental results demonstrate that using the proposed method, it is possible to learn policies which generate text without pre-specifying a generation order, while achieving competitive performance with conventional left-to-right generation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. 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.

  2. 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