Papers › Deterministic Non-Autoregressive Neural Sequence Modeling by Iterative Refinement

Deterministic Non-Autoregressive Neural Sequence Modeling by Iterative Refinement

19 Feb 2018EMNLP 2018 10arXiv:1802.06901archive 2025-07-28

Jason Lee, Elman Mansimov, Kyunghyun Cho

We propose a conditional non-autoregressive neural sequence model based on iterative refinement. The proposed model is designed based on the principles of latent variable models and denoising autoencoders, and is generally applicable to any sequence generation task. We extensively evaluate the proposed model on machine translation (En-De and En-Ro) and image caption generation, and observe that it significantly speeds up decoding while maintaining the generation quality comparable to the autoregressive counterpart.

PaperPDFConference PDFCodeCode Syntology ran

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

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1802.06901")

Code

Syntology Ran 3 of 4 code samples harvested from 2 repositories linked to this paper; 1 has no recorded run. Of those that ran: 1 ran · honoured contract; 1 ran · our draft was wrong; 1 ran with no contract checked.

By repository: official repository: 3 samples from 1 repository, 2 ran; community (archive-listed): 1 sample from 1 repository, 1 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

nyu-dl/dl4mt-nonauto officialmentioned in papermentioned on GitHubpytorch report
zhajiahe/Token_Drop mentioned on GitHubpytorchMIT 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.

Code Syntology ran Syntology

4 samples harvested; 3 ran; 1 honoured the contract we drafted; 1 has no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
1ran · our draft was wrong
1ran
1unverified

Licence: 1 of the 4 samples is 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 2 repositories linked to this paper, official or community; each sample names its own and says which. “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. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (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 from a repository marked official are listed first. 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 four 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; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). 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.

grad_reverse nyu-dl/dl4mt-nonauto/model.py official repository ran · honoured contract fingerprinted BSD-3-Clause (permissive) · 2a7e189196f18f84 · report
positional_encodings_like nyu-dl/dl4mt-nonauto/model.py official repository ran · our draft was wrong fingerprinted BSD-3-Clause (permissive) · 2ade611efde18805 · report
demask nyu-dl/dl4mt-nonauto/model.py official repository unverified BSD-3-Clause (permissive) · 896064f7021686ca · report
safe_readline zhajiahe/Token_Drop/fairseq/binarizer.py community (archive-listed) ran MIT recorded; this copy not marked cleared · pointer only · 82bdf940665aeeb4 · report

Tasks

Caption GenerationDenoisingMachine TranslationTranslation

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Machine Translation IWSLT2015 English-German Denoising autoencoders (non-autoregressive) BLEU score 27.01 #5 of 8 Archive leaderboard report
Machine Translation IWSLT2015 German-English Denoising autoencoders (non-autoregressive) BLEU score 32.43 #5 of 15 Archive leaderboard report
Machine Translation WMT2014 English-German Denoising autoencoders (non-autoregressive) BLEU score 21.54 #75 of 91 Archive leaderboard report
Machine Translation WMT2014 German-English Denoising autoencoders (non-autoregressive) BLEU score 25.43 #12 of 16 Archive leaderboard report
Machine Translation WMT2016 English-Romanian Denoising autoencoders (non-autoregressive) BLEU score 29.66 #10 of 21 Archive leaderboard report
Machine Translation WMT2016 Romanian-English Denoising autoencoders (non-autoregressive) BLEU score 30.30 #19 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.

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