Pith. sign in

REVIEW 1 cited by

AdvAug: Robust Adversarial Augmentation for 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.11834 v3 pith:26YZIJY5 submitted 2020-06-21 cs.CL

AdvAug: Robust Adversarial Augmentation for Neural Machine Translation

classification cs.CL
keywords advaugadversarialaugmentationsentencestranslationmachineneuralvicinity
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this paper, we propose a new adversarial augmentation method for Neural Machine Translation (NMT). The main idea is to minimize the vicinal risk over virtual sentences sampled from two vicinity distributions, of which the crucial one is a novel vicinity distribution for adversarial sentences that describes a smooth interpolated embedding space centered around observed training sentence pairs. We then discuss our approach, AdvAug, to train NMT models using the embeddings of virtual sentences in sequence-to-sequence learning. Experiments on Chinese-English, English-French, and English-German translation benchmarks show that AdvAug achieves significant improvements over the Transformer (up to 4.9 BLEU points), and substantially outperforms other data augmentation techniques (e.g. back-translation) without using extra corpora.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. CluCERT: Certifying LLM Robustness via Clustering-Guided Denoising Smoothing

    cs.LG 2025-12 reject novelty 5.0

    A clustering-based denoising smoothing method claims tighter certified robustness bounds and lower cost for LLMs, but its central certificate depends on a fitted stability factor and an assumed cluster shift.