CLApr 4, 2019

ReWE: Regressing Word Embeddings for Regularization of Neural Machine Translation Systems

arXiv:1904.02461v11096 citations
Originality Incremental advance
AI Analysis

This addresses regularization challenges in neural machine translation, especially for low-resource scenarios, but is incremental as it builds on existing methods.

The paper tackles the problem of regularization in neural machine translation, particularly for low-resource settings, by proposing ReWE, a technique that regresses word embeddings to improve generalization, resulting in BLEU score improvements of 0.91 to 2.54 points over baselines.

Regularization of neural machine translation is still a significant problem, especially in low-resource settings. To mollify this problem, we propose regressing word embeddings (ReWE) as a new regularization technique in a system that is jointly trained to predict the next word in the translation (categorical value) and its word embedding (continuous value). Such a joint training allows the proposed system to learn the distributional properties represented by the word embeddings, empirically improving the generalization to unseen sentences. Experiments over three translation datasets have showed a consistent improvement over a strong baseline, ranging between 0.91 and 2.54 BLEU points, and also a marked improvement over a state-of-the-art system.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes