Conditional Variational Autoencoder for Neural Machine Translation

12/11/2018
by   Artidoro Pagnoni, et al.
0

We explore the performance of latent variable models for conditional text generation in the context of neural machine translation (NMT). Similar to Zhang et al., we augment the encoder-decoder NMT paradigm by introducing a continuous latent variable to model features of the translation process. We extend this model with a co-attention mechanism motivated by Parikh et al. in the inference network. Compared to the vision domain, latent variable models for text face additional challenges due to the discrete nature of language, namely posterior collapse. We experiment with different approaches to mitigate this issue. We show that our conditional variational model improves upon both discriminative attention-based translation and the variational baseline presented in Zhang et al. Finally, we present some exploration of the learned latent space to illustrate what the latent variable is capable of capturing. This is the first reported conditional variational model for text that meaningfully utilizes the latent variable without weakening the translation model.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/01/2018

Latent Visual Cues for Neural Machine Translation

In this work, we propose to model the interaction between visual and tex...
08/28/2018

A Discriminative Latent-Variable Model for Bilingual Lexicon Induction

We introduce a novel discriminative latent-variable model for the task o...
07/10/2018

Latent Alignment and Variational Attention

Neural attention has become central to many state-of-the-art models in n...
02/20/2019

Mixture Models for Diverse Machine Translation: Tricks of the Trade

Mixture models trained via EM are among the simplest, most widely used a...
02/20/2021

Kanerva++: extending The Kanerva Machine with differentiable, locally block allocated latent memory

Episodic and semantic memory are critical components of the human memory...
08/30/2019

Latent Part-of-Speech Sequences for Neural Machine Translation

Learning target side syntactic structure has been shown to improve Neura...
09/21/2020

Target Conditioning for One-to-Many Generation

Neural Machine Translation (NMT) models often lack diversity in their ge...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

Machine translation is a classic, conditional language modeling task in NLP, and was one of the first in which deep learning techniques trained end-to-end have been shown to outperform classical phrase-based pipelines. Current NMT models generally use the encoder-decoder framework

(Sutskever et al., 2014)

where an encoder transforms a source sequence to a distributed representation, which the decoder then uses to generate the target sequence. Additionally, attention mechanisms

(Bahdanau et al., 2014) allow the model to focus on relevant parts of the source sequence when decoding. However, these attention-based models may be insufficient in capturing all alignment and source sentence information (Tu et al., 2016).

To attempt to more fully capture holistic semantic information in the translation process, we explore latent variable models. Latent variable models are a class of statistical models that seek to model the relationship of observed variables with a set of unobserved, latent variables, and can allow for modeling of more complex, generative processes. However, inference in these models can often be difficult or intractable, motivating a class of variational methods that frame the inference problem as optimization. Variational Autoencoders (Kingma & Welling, 2013), in particular, have seen success in tasks such as image generation (Gregor et al., 2015), but face additional challenges when applied to discrete tasks such as text generation (Bowman et al., 2015).

We experiment with a conditional latent variable model applied to the task of translation. (Zhang et al., 2016) introduce a framework and baseline for conditional variational models and apply it to machine translation. We extend their model with a co-attention mechanism, motivated by (Parikh et al., 2016), in the inference network and show that this change leads to a more expressive approximate posterior. We compare our conditional variational model with a discriminitive, attention-based baseline, and show an improvement in BLEU on German-to-English translation. We also present our experiments testing various methods of addressing common challenges of applying VAEs to text (Bowman et al., 2015), namely posterior collapse. Finally, we demonstrate some exploration of the learned latent space in our conditional variational model.

2 Background

This section discusses recent efforts in neural machine translation, variational autoencoders (VAE), and their extension to the conditional case (CVAE).

2.1 RNN-Attention Sentence Encoding

In the standard Recurrent Neural Net (RNN)-based encoder-decoder setting, the encoder RNN represents the source sentence by learning sequentially from the previous source word and an evolving hidden state, while the decoder RNN similarly predicts the next target word using the previously generated output and its own hidden state. The probabilistic decoder model seeks to maximize , the likelihood of output sequence given source input . The attention mechanism introduced in (Bahdanau et al., 2014) enhances this model by aligning source and target words using the encoder RNN hidden states. However, it has been shown that this type of models struggles to learn smooth, interpretable global semantic features (Bowman et al., 2015).

2.2 Variational Autoencoder

The variational autoencoder (VAE) (Kingma & Welling, 2013) is a generative model that uses deep neural nets to predict parameters of the variational distribution. This models the generation of as conditioned on an unobserved, latent variable by (where

represents parameters in the neural network), and seeks to maximize the data log likelihood

. The main principle of VAE is to introduce an approximate posterior with variational parameters predicted by a neural network, in order to address the intractability of the true posterior in maximum likelihood inference. It can be seen as a regularized version of an autoencoder, where can be considered the encoder and the decoder. The objective is:

Gradients for this objective, also called the Evidence Lower Bound (ELBO), can be estimated with Monte Carlo sampling and the reparameterization trick

(Kingma & Welling, 2013; Rezende et al., 2014). Training can then be done end-to-end with stochastic gradient optimization. To generate new samples, a latent variable can be drawn from the prior , then the sample can be generated from .

2.3 Conditional Variational Autoencoder

Conditional variational autoencoder (CVAE) is an extension of VAE to conditional tasks such as translation. Each component of the model is conditioned on some observed , and models the generation process according to the graphical model shown below.


Graphical Model of CVAE

Solid lines denote the generation process and dashed lines denote the variational approximation.

Figure from (Zhang et al., 2016)

CVAE seeks to maximize , and the variational objective becomes:

Here, CVAE can be used to guide NMT by capturing features of the translation process into the latent variable .

3 Related Work

There has been substantial exploration on both the neural machine translation and variational autoencoder fronts. The attention mechanism introduced by (Bahdanau et al., 2014) has been extensively used with RNN encoder-decoder models (Wang & Jiang, 2015) to enhance their ability to deal with long source inputs.

(Bowman et al., 2015) presents a basic RNN-based VAE generative model to explicitly model holistic properties of sentences. It analyzes challenges for training variational models for text (primarily posterior collapse) and propose two workarounds: 1. KL cost annealing and 2. masking parts of the source and target tokens with ’<unk>’ symbols in order to strengthen the inferer by weakening the decoder (”word dropouts”). This model is primarily concerned with unconditional text generation and does not discuss conditional tasks.

(Kim et al., 2018) is one of the first LSTM generative models to outperform language models by using a latent code. It proposes a hybrid approach between amortized variational inference (AVI) to initialize variational parameters and stochastic variational inference (SVI) to iteratively refine them . The proposed approach outperforms strong autoregressive and variational baselines on text and image datasets, and reports success in preventing the posterior-collapse phenomenon.

(Zhang et al., 2016) introduces the basic setup for a conditional variational language model and applies it to the task of machine translation. It reports improvements over vanilla neural machine translation baselines on Chinese-English and English-German tasks.

4 Model

The model that we propose relies on an encoder-decoder translation architecture similar to (Bahdanau et al., 2014) along with an inferer network. In order to reduce the number of parameters to be trained as well as to avoid overfitting, we share embeddings and RNN parameters between the translation and the inferer networks.

4.1 Neural Encoder

We use a bidirectional LSTM (Hochreiter & Schmidhuber, 1997)

to produce annotation vectors for words in both the source sentence

and the target sentence . The LSTM outputs from the forward and backward passes are concatenated to produce a unique annotation vector for each word.

Where , and are learned source and target word embeddings. Although word embeddings are already continuous representations of words, the additional LSTM step introduces contextual information that is unique to the sentence.

4.2 Neural Inferer

The neural inferer can be divided in two parts: the prior and the posterior networks. Both prior and posterior distributions are assumed to be multivariate Gaussians. As determined by the ELBO equation, the parameters of the prior are computed by the prior network which only takes the source sentence as input. The posterior parameters are determined from both the source and the target sentences. We restrict the variance matrices of the prior and the posterior distributions to be diagonal.

4.2.1 Neural Prior

The prior distribution, denoted

is a multivariate Gaussian with mean and variance matrices parametrized by neural networks. We use the same network architecture proposed in VNMT (Zhang et al., 2016).

The source, a variable length sentence, is mapped to two fixed dimensional vectors, the mean and the variance of the multivariate gaussian distribution. First, we obtain a fixed dimensional representation of the sentence by mean-pooling the annotation vectors produced by the neural encoder over the source sentence. Then we add a linear projection layer

, and a non linearity.

We finally project to the mean vector and the scale vector:

Where

is the identity matrix. We explored concatenating a self-attention context vector to the mean-pool of the annotation vectors. This addition did not alter the performance of the model and we decided not to include it in the final model for which we report results bellow. Although

(Parikh et al., 2016) proposed self-attention as a fixed-size representation of a sentence, our results indicate that mean-pooling the annotation vectors encodes similar information.

4.2.2 Neural Posterior

During training, the latent variable will be sampled from the posterior distribution:

a multivariate Gaussian, with parameters depending on both source and target sentences.

We introduce a new architecture for the neural posterior inspired by Parikh’s co-attention (Parikh et al., 2016). In the context of variational autoencoders, it is crucial that the posterior network is as expressive as possible. We found that the posterior used in VNMT (Zhang et al., 2016), which simply takes the concatenated mean-pool vectors of the source and target codes, does not capture interactions between the source and the target sentences. Intuitively, having access to both sentences introduces the possibility of finding important stylistic translation decisions by comparing the two sentences. There are many ways in which a sentence can be translated due to the multimodal nature of natural language, and latent variable models aim at capturing precisely these translation specificities through the latent variable. Not capturing source-target interactions is thus a serious drawback in a CVAE model, we propose the first model with such interactions.

In the same spirit as the co-attention technique described in (Parikh et al., 2016), we compute pairwise dot attention coefficients between the words of the source sentence and each word of the target sentence, and vice versa. Notice here that instead of applying the co-attention mechanism directly to the word embeddings as it is done in (Parikh et al., 2016), we apply it to the annotation vectors produced by running the encoder LSTM on both source and target sentences. We found that this approach lead to a more representative posterior network, which gave better results.

The source and target attention coefficients are therefore given by:

Where the softmax is take over the second dimension. We then use these coefficients to get context vectors, which are convex combinations of the annotation vectors:

We combine the previous with a mean-pool to obtain a fixed dimensional vector, and concatenate it with the mean-pool of the annotation vectors from both the source and target sentences (similar to what is done in the prior).

Finally, we add a linear projection layer and a non linearity, and get the final fixed dimensional vector.

This will be projected to the mean vector and variance matrix just like in the prior network:

Through the use of the co-attention network, the mean and variance parameters of the posterior capture interactions between source and target sentences.

4.3 Neural Decoder

The decoder models the probability of a target sentence

given a source sentence and a latent variable by decomposing the generation process in a left to write process. At each time step given , the words that were already translated, and,

the decoder outputs a probability distribution over the vocabulary.

We use Bahdanau’s attention decoder (Bahdanau et al., 2014) with the incorporation of the dependence on the latent variable . In particular we can parametrize the probability of decoding each word as:

Where is a linear projection to a vocabulary-sized vector, is the output of the LSTM at step , is the context vector for time step , and is the sentence level latent variable.

The context vector is the result of a convex combination of the annotation vectors produced by the encoder applied to the source sentence .

Where is the vector of normalized attention weights obtained by taking the softmax of the dot product of annotation vectors and the LSTM output .

The hidden state is produced at each step by a LSTM that takes as input and the word embedding of word .

The decoder network that we present differs from Bahdanau’s architecture in that we include the dependency on the latent variable . The vector is concatenated before the last projection layer to the context vector and the LSTM hidden state. We also included it as a skip connection in the LSTM input by concatenating it to the word embedding of the target words at each time step.

5 Methods

We use the IWSLT 2016 German-English dataset for our experiments, consisting of 196k sentence pairs. We preprocess by filtering out pairs containing sentences longer than 100 words and replacing all words that appear less than five times with an ”unk” token, yielding vocabulary sizes of 26924 German words and 20489 English words. Note: for BLEU score calculation in our current results, we retain the ”unk” tokens and thus may not be directly comparable to other published results.

We trained each of our models end-to-end with Adam (Kingma & Ba, 2014) with initial learning rate 0.002, decayed by a scheduler on plateau. Our variational models used Monte Carlo sampling and the reparameterization trick for gradient estimation (Kingma & Welling, 2013; Rezende et al., 2014). Latent variables are sampled from the approximate posterior during training, but from the prior during generation.

For our variational models, we use a KL warm-up schedule by training a modified objective:

Alpha is set to

for the first five training epochs, then annealed linearly over the next ten epochs.

We compared three models: vanilla sequence-to-sequence with dot-product attention, VNMT (Zhang et al., 2016), and our Conditional VAE with co-attention. All models used 300 dimensional word embeddings, 2 layer encoder and decoder LSTMs with hidden dimensions of size 300. Variational models used 32 dimensional latent variables.

6 Results

Our main results comparing discriminative attention-based translation with a few of our CVAE models are shown in Table1.

Model PPL NELBO/NLL RE KL BLEU Greedy BLEU
Seq2seq 7.7103 2.0426 NA NA 28.43 30.22
CVAE 7.6879 2.0397 2.0305 0.0092 29.94 31.2
CVAE - KL coeff = 0.25 9.275 2.2273 1.7733 0.4540 29.21 30.96
Table 1: Experiment Results: Main Results

Perplexity, Negative ELBO / Negative Log Likelihood, Reconstruction Error, KL per Word, and BLEU scores for generation with greedy search, greedy search with zeroed out latent variable, and beam search with width 10.

6.1 Experiment 1: Expressiveness of Co-attention Inference

To assess the contribution of our co-attention based approximate posterior, we compare the reconstruction losses of our model and the VNMT model (Zhang et al., 2016)

with the KL term of the ELBO objective zeroed out. Here, all gradients will only be backpropagated through the reconstruction error, eliminating the KL regularization of the approximate posterior to resemble the prior. Hence, the reconstruction error here is a measure of the ability of the approximate posterior to encode information relevant to reconstructing the target sequence. Results are shown below in Table 2.

Model RE
VNMT 1.5771
Co-attention 1.3572
Table 2: Experiment 1: Expressiveness of Co-attention Inference

6.2 Experiment 2: Addressing Posterior Collapse

Next we explore three methods of addressing posterior collapse: Word Dropout, KL Minimum, and KL Coefficient. Results are shown in Table 3.

6.2.1 Word Dropout

Extending word dropout as used in (Bowman et al., 2015), we weaken the encoder-decoder portion of the model to steer the model to make greater use of the latent variable when translating. We mask words with <unk> in both the source and target sequences before feeding them into the encoder and decoder, respectively. However, we do not mask words fed into the inference networks, hoping to more strongly incentive use of the the latent variable.

6.2.2 KL Minimum

We set a minimum KL penalty in the objective, forcing the model to take at least a fixed KL regularization cost.

6.2.3 KL Coefficient

We fix a constant coefficient to the KL objective, allowing us to adjust the weighting of the KL penalty relative to reconstruction error.

Model PPL NELBO/NLL RE KL BLEU Greedy
CVAE 7.687 2.0397 2.0305 0.0092 29.94
CVAE - min KL = 0.1 7.741 2.0466 1.9677 0.0788 29.15
CVAE - min KL = 0.2 8.031 2.0833 1.9294 0.1539 28.85
CVAE - KL coeff = 0.1 14.323 2.6619 1.6203 1.0416 29.16
CVAE - KL coeff = 0.25 9.275 2.2273 1.7733 0.4540 29.21
Table 3: Experiment 2: Addressing Posterior Collapse

Perplexity, Negative ELBO / Negative Log Likelihood, Reconstruction Error, KL per Word, and BLEU scores for generation with greedy search, greedy search with zeroed out latent variable, and beam search with width 10.

6.3 Experiment 3: Generation and Interpolation

To explore the latent space learned by the model, we sample and generate multiple sequences. To verify that the latent space is smooth, we interpolate across the latent space and observe sentences generated. Figure 1 shows 20 sampled sentences for each example, ranked by log probability. Figure 2 shows examples of linear interpolations between two sampled latent variables. These experiments are done with the CVAE model trained with KL coefficient of 0.25.

Figure 1: Experiment 3: Ranked generation of samples by log probabilities
Figure 2: Experiment 3: Interpolations

7 Discussion

From our main results, our variational models are able to outperform a vanilla sequence-to-sequence model with attention by both BLEU and perplexity measures. However, as expected with VAEs for text, we ran into the challenge of posterior collapse for our standard CVAE model. By setting KL coefficient to 0.25 (described above), we are able to train a model that utilizes the latent variable model much more, and still outperform sequence-to-sequence in terms of BLEU.

In experiment 1, we show that the addition of our co-attention mechanism significantly improves the expressiveness of the approximate posterior network. This indicates the potential for our CVAE model to improve on previous variational baselines for translation. Furthermore, this result also confirms that capturing interactions between source and target sentences through co-attention helps provide effective information to the latent variable about the specificities of the translation process.

In experiment 2, we present a comparison between various methods of combating posterior collapse. As expected, there is a trade-off between reconstruction error and KL. Although most recent work on VAE for text in the unconditional setting has focused on various methods of weakening the decoder to face posterior collapse, we show that modifying the learning objective incentivizes the use of the inference network without affecting the translation quality. We explored with setting a minimum for the KL, adding a coefficient to the KL penalty term in the ELBO, and word dropout.

When setting a minimum for the KL, we essentially provide a minimum budget of KL that the inference network can use. In the unconditional setting, minimum KL budgeting can be achieved through the use of von Mises Fisher distribution, with uniform prior. However, in the conditional setting, with a prior that is not uniform this approach is not viable. The principal issue with setting an explicit minimum to the KL term is that when the KL term is smaller than the predefined value, there is no gradient propagated through the KL objective. The posterior is still updated through the reconstruction error term, but the prior is not updated, as it only appears in the KL term.

In experiment 3, we show an exploration of the latent space.

From sampling and generating (Figure 1), we observe that the model is able to produce somewhat diverse sentences. In the first example, the source sentence contains several <unk> tokens and thus there is a lot of uncertainty to what the sentence could mean. The generated samples are quite diverse, mentioning topics such as shuffling, beds, colonization, discrimination, etc. This demonstrates that latent variables could encode diverse semantic information. In the second example, there are slight variations in tense: ”prepare”, ”prepared”, ”was preparing”, etc. The third example shows variation in wording: ”In the middle of the 1990s”, ”center of the 1990s”, ”In the 1990s”, etc. These examples illustrate some of the semantic and stylistic attributes of the translation process that can be captured by the latent variable.

From our interpolations (Figure 2), we see that the model is able to learn reasonably smooth latent representations for translations.

From these explorations, we confirm that the model is learning a meaningful and smooth latent space that can guide the translation process.

8 Conclusion

We propose a conditional variational model for machine translation, extending the framework introduced by (Zhang et al., 2016) with a co-attention based inference network and show improvements over discriminitive sequence-to-sequence translation and previous variational baselines. We also present and compare various ways of mitigating the problem of posterior collapse that has plagued latent variable models for text. Finally, we explore the latent space learned and show that it is able to represent somewhat diverse sentences and smooth interpolations. Future work includes further exploration of latent spaces for text, applying the model to larger translation datasets or other conditional tasks such as summarization, observing performance by sentence length, and closer analysis into what the latent variable is contributing.

References