Pith. sign in

REVIEW 2 cited by

Learning to Recover from Multi-Modality Errors for Non-Autoregressive Neural Machine Translation

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 2006.05165 v1 pith:MI6KQB44 submitted 2020-06-09 cs.CL

classification cs.CL
keywords modelsegmentstranslationerrorsmachinemissingmulti-modalityneural
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Non-autoregressive neural machine translation (NAT) predicts the entire target sequence simultaneously and significantly accelerates inference process. However, NAT discards the dependency information in a sentence, and thus inevitably suffers from the multi-modality problem: the target tokens may be provided by different possible translations, often causing token repetitions or missing. To alleviate this problem, we propose a novel semi-autoregressive model RecoverSAT in this work, which generates a translation as a sequence of segments. The segments are generated simultaneously while each segment is predicted token-by-token. By dynamically determining segment length and deleting repetitive segments, RecoverSAT is capable of recovering from repetitive and missing token errors. Experimental results on three widely-used benchmark datasets show that our proposed model achieves more than 4$\times$ speedup while maintaining comparable performance compared with the corresponding autoregressive model.

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. Sculpting Features from Noise: Reward-Guided Hierarchical Diffusion for Task-Optimal Feature Transformation

    cs.LG 2025-05 conditional novelty 6.0 of 10

    DIFFT generates task-optimal feature transformations via reward-guided latent diffusion with a semi-autoregressive decoder, outperforming ten baselines on 14 tabular datasets.

  2. Youtu-Parsing: Perception, Structuring and Recognition via High-Parallelism Decoding

    cs.CV 2026-01 conditional novelty 5.0 of 10

    A 2.5B vision-language model parses documents into text, formulas, tables, charts, seals, and hierarchy, reporting 5-11x speedups via token-parallel decoding and SOTA OmniDocBench scores.

Pith tools