Papers › FlowSeq: Non-Autoregressive Conditional Sequence Generation with Generative Flow

FlowSeq: Non-Autoregressive Conditional Sequence Generation with Generative Flow

5 Sep 2019IJCNLP 2019 11arXiv:1909.02480archive 2025-07-28

Xuezhe Ma, Chunting Zhou, Xi-An Li, Graham Neubig, Eduard Hovy

Most sequence-to-sequence (seq2seq) models are autoregressive; they generate each token by conditioning on previously generated tokens. In contrast, non-autoregressive seq2seq models generate all tokens in one pass, which leads to increased efficiency through parallel processing on hardware such as GPUs. However, directly modeling the joint distribution of all tokens simultaneously is challenging, and even with increasingly complex model structures accuracy lags significantly behind autoregressive models. In this paper, we propose a simple, efficient, and effective model for non-autoregressive sequence generation using latent variable models. Specifically, we turn to generative flow, an elegant technique to model complex distributions using neural networks, and design several layers of flow tailored for modeling the conditional density of sequential latent variables. We evaluate this model on three neural machine translation (NMT) benchmark datasets, achieving comparable performance with state-of-the-art non-autoregressive NMT models and almost constant decoding time w.r.t the sequence length.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 1 code sample harvested from 1 repository linked to this paper: 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code; here there are none.

By repository: official repository: 1 sample from 1 repository, 1 ran (1 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

No sample is linked to this paper from 1 of its repositories that Syntology harvested for other papers:

Levels written on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

XuezheMax/flowseq officialmentioned in papermentioned on GitHubpytorchSyntology: 1 sample, 1 ran (0 instrument-failed) · 0 unverified report
keonlee9420/VAENAR-TTS pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Glow: Generative Flow with Invertible 1x1 Convolutions (arXiv:1807.03039; that paper's own run record: 85 ran (of which 47 constructed an object rather than computing a result; 73 with no instrument failure: 3 honoured, 0 violated, 70 with no contract checked; 12 where Syntology's instrument failed) · 44 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

1 sample harvested: 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · honoured contract

Licence: 0 of the 1 sample are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from XuezheMax/flowseq. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of six reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

XuezheMax/flowseq official repository 1 sample, 1 ran (0 instrument-failed) · 0 unverified
calc_bleu experiments/translate.py ran · honoured contract Apache-2.0 (permissive) · 6890088b59086e6e · report fixture: returned float · level recorded 2026-09-22

Tasks

Machine TranslationNMTTranslation

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Machine Translation IWSLT2015 German-English FlowSeq-base BLEU score 24.75 #12 of 15 Archive leaderboard report
Machine Translation WMT2014 English-German FlowSeq-large (NPD n = 30) BLEU score 23.64 #72 of 91 Archive leaderboard report
Machine Translation WMT2014 English-German FlowSeq-large (NPD n = 15) BLEU score 23.14 #73 of 91 Archive leaderboard report
Machine Translation WMT2014 English-German FlowSeq-large (IWD n = 15) BLEU score 22.94 #74 of 91 Archive leaderboard report
Machine Translation WMT2014 English-German FlowSeq-large BLEU score 20.85 #77 of 91 Archive leaderboard report
Machine Translation WMT2014 English-German FlowSeq-base BLEU score 18.55 #83 of 91 Archive leaderboard report
Machine Translation WMT2014 German-English FlowSeq-large (NPD n = 30) BLEU score 28.29 #9 of 16 Archive leaderboard report
Machine Translation WMT2014 German-English FlowSeq-large (NPD n = 15) BLEU score 27.71 #10 of 16 Archive leaderboard report
Machine Translation WMT2014 German-English FlowSeq-large (IWD n=15) BLEU score 27.16 #11 of 16 Archive leaderboard report
Machine Translation WMT2014 German-English FlowSeq-large BLEU score 25.4 #13 of 16 Archive leaderboard report
Machine Translation WMT2014 German-English FlowSeq-base BLEU score 23.36 #14 of 16 Archive leaderboard report
Machine Translation WMT2016 English-Romanian FlowSeq-large (NPD n = 30) BLEU score 32.35 #3 of 21 Archive leaderboard report
Machine Translation WMT2016 English-Romanian FlowSeq-large (NPD n=15) BLEU score 31.97 #4 of 21 Archive leaderboard report
Machine Translation WMT2016 English-Romanian FlowSeq-large (IWD n = 15) BLEU score 31.08 #5 of 21 Archive leaderboard report
Machine Translation WMT2016 English-Romanian FlowSeq-large BLEU score 29.86 #8 of 21 Archive leaderboard report
Machine Translation WMT2016 English-Romanian FlowSeq-base BLEU score 29.26 #11 of 21 Archive leaderboard report
Machine Translation WMT2016 Romanian-English FlowSeq-large (NPD n = 30) BLEU score 32.91 #11 of 21 Archive leaderboard report
Machine Translation WMT2016 Romanian-English FlowSeq-large (NPD n = 15) BLEU score 32.46 #14 of 21 Archive leaderboard report
Machine Translation WMT2016 Romanian-English FlowSeq-large (IWD n = 15) BLEU score 32.03 #15 of 21 Archive leaderboard report
Machine Translation WMT2016 Romanian-English FlowSeq-large BLEU score 30.69 #18 of 21 Archive leaderboard report
Machine Translation WMT2016 Romanian-English FlowSeq-base BLEU score 30.16 #20 of 21 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

LSTMSeq2SeqSigmoid ActivationTanh Activation

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections