Generating Sentences From a Continuous Space Yoavgo

1 Introduction

Recurrent neural network language models (rnnlms, Mikolov et al., 2011) represent the state of the art in unsupervised generative modeling for natural language sentences. In supervised settings, rnnlm decoders conditioned on task-specific features are the state of the art in tasks like machine translation(Sutskever et al., 2014; Bahdanau et al., 2015) and image captioning (Vinyals et al., 2015; Mao et al., 2015; Donahue et al., 2015). The rnnlm generates sentences word-by-word based on an evolving distributed state representation, which makes it a probabilistic model with no significant independence assumptions, and makes it capable of modeling complex distributions over sequences, including those with long-term dependencies. However, by breaking the model structure down into a series of next-step predictions, the rnnlm does not expose an interpretable representation of global features like topic or of high-level syntactic properties.

We propose an extension of the rnnlm that is designed to explicitly capture such global features in a continuous latent variable. Naively, maximum likelihood learning in such a model presents an intractable inference problem. Drawing inspiration from recent successes in modeling images (Gregor et al., 2015), handwriting, and natural speech (Chung et al., 2015), our model circumvents these difficulties using the architecture of a variational autoencoder and takes advantage of recent advances in variational inference (Kingma and Welling, 2015; Rezende et al., 2014) that introduce a practical training technique for powerful neural network generative models with latent variables.

i went to the store to buy some groceries .

i store to buy some groceries .

i were to buy any groceries .

horses are to buy any groceries .

horses are to buy any animal .

horses the favorite any animal .

horses the favorite favorite animal .

horses are my favorite animal .

Table 1: Sentences produced by greedily decoding from points between two sentence encodings with a conventional autoencoder. The intermediate sentences are not plausible English.

Our contributions are as follows: We propose a variational autoencoder architecture for text and discuss some of the obstacles to training it as well as our proposed solutions. We find that on a standard language modeling evaluation where a global variable is not explicitly needed, this model yields similar performance to existing rnnlm

s. We also evaluate our model using a larger corpus on the task of imputing missing words. For this task, we introduce a novel evaluation strategy using an adversarial classifier, sidestepping the issue of intractable likelihood computations by drawing inspiration from work on non-parametric two-sample tests and adversarial training. In this setting, our model's global latent variable allows it to do well where simpler models fail. We finally introduce several qualitative techniques for analyzing the ability of our model to learn high level features of sentences. We find that they can produce diverse, coherent sentences through purely deterministic decoding and that they can interpolate smoothly between sentences.

2 Background

2.1 Unsupervised sentence encoding

A standard rnn

language model predicts each word of a sentence conditioned on the previous word and an evolving hidden state. While effective, it does not learn a vector representation of the full sentence. In order to incorporate a continuous latent sentence representation, we first need a method to map between sentences and distributed representations that can be trained in an unsupervised setting. While no strong generative model is available for this problem, three non-generative techniques have shown promise: sequence autoencoders, skip-thought, and paragraph vector.

Sequence autoencoders have seen some success in pre-training sequence models for supervised downstream tasks (Dai and Le, 2015) and in generating complete documents (Li et al., 2015a). An autoencoder consists of an encoder function and a probabilistic decoder model , and maximizes the likelihood of an example conditioned on , the learned code for . In the case of a sequence autoencoder, both encoder and decoder are rnns and examples are token sequences.

Standard autoencoders are not effective at extracting for global semantic features. In Table 1 , we present the results of computing a path or homotopy between the encodings for two sentences and decoding each intermediate code. The intermediate sentences are generally ungrammatical and do not transition smoothly from one to the other. This suggests that these models do not generally learn a smooth, interpretable feature system for sentence encoding. In addition, since these models do not incorporate a prior over

, they cannot be used to assign probabilities to sentences or to sample novel sentences.

Two other models have shown promise in learning sentence encodings, but cannot be used in a generative setting: Skip-thought models (Kiros et al., 2015)

are unsupervised learning models that take the same model structure as a sequence autoencoder, but generate text conditioned on a neighboring sentence from the target text, instead of on the target sentence itself. Finally, paragraph vector models

(Le and Mikolov, 2014) are non-recurrent sentence representation models. In a paragraph vector model, the encoding of a sentence is obtained by performing gradient-based inference on a prospective encoding vector with the goal of using it to predict the words in the sentence.

2.2 The variational autoencoder

The variational autoencoder (vae, Kingma and Welling, 2015; Rezende et al., 2014) is a generative model that is based on a regularized version of the standard autoencoder. This model imposes a prior distribution on the hidden codes which enforces a regular geometry over codes and makes it possible to draw proper samples from the model using ancestral sampling.

The vae modifies the autoencoder architecture by replacing the deterministic function with a learned posterior recognition model, . This model parametrizes an approximate posterior distribution over (usually a diagonal Gaussian) with a neural network conditioned on . Intuitively, the vae learns codes not as single points, but as soft ellipsoidal regions in latent space, forcing the codes to fill the space rather than memorizing the training data as isolated codes.

If the vae

were trained with a standard autoencoder's reconstruction objective, it would learn to encode its inputs deterministically by making the variances in

vanishingly small (Raiko et al., 2015). Instead, the vae uses an objective which encourages the model to keep its posterior distributions close to a prior , generally a standard Gaussian ( , ). Additionally, this objective is a valid lower bound on the true log likelihood of the data, making the vae a generative model. This objective takes the following form:

This forces the model to be able to decode plausible sentences from every point in the latent space that has a reasonable probability under the prior.

In the experiments presented below using vae models, we use diagonal Gaussians for the prior and posterior distributions and , using the Gaussian reparameterization trick of Kingma and Welling (2015)

. We train our models with stochastic gradient descent, and at each gradient step we estimate the reconstruction cost using a single sample from

, but compute the kl divergence term of the cost function in closed form, again followingKingma and Welling (2015).

3 A VAE for sentences

Figure 1: The core structure of our variational autoencoder language model. Words are represented using a learned dictionary of embedding vectors.

We adapt the variational autoencoder to text by using single-layer lstm rnns(Hochreiter and Schmidhuber, 1997) for both the encoder and the decoder, essentially forming a sequence autoencoder with the Gaussian prior acting as a regularizer on the hidden code. The decoder serves as a special rnn language model that is conditioned on this hidden code, and in the degenerate setting where the hidden code incorporates no useful information, this model is effectively equivalent to an rnnlm. The model is depicted in Figure1, and is used in all of the experiments discussed below.

We explored several variations on this architecture, including concatenating the sampled to the decoder input at every time step, using a softplus parametrization for the variance, and using deep feedforward networks between the encoder and latent variable and the decoder and latent variable. We noticed little difference in the model's performance when using any of these variations. However, when including feedforward networks between the encoder and decoder we found that it is necessary to use highway network layers (Srivastava et al., 2015)

for the model to learn. We discuss hyperparameter tuning in the appendix.

We also experimented with more sophisticated recognition models , including a multistep sampling model styled after draw (Gregor et al., 2015), and a posterior approximation using normalizing flows (Rezende and Mohamed, 2015). However, we were unable to reap significant gains over our plain vae.

While the strongest results with vaes to date have been on continuous domains like images, there has been some work on discrete sequences: a technique for doing this using rnn encoders and decoders, which shares the same high-level architecture as our model, was proposed under the name Variational Recurrent Autoencoder (vrae) for the modeling of music in Fabius and van Amersfoort (2014). While there has been other work on including continuous latent variables in rnn-style models for modeling speech, handwriting, and music (Bayer and Osendorfer, 2015; Chung et al., 2015), these models include separate latent variables per timestep and are unsuitable for our goal of modeling global features.

In a recent paper with goals similar to ours, Miao et al. (2015) introduce an effective VAE-based document-level language model that models texts as bags of words, rather than as sequences. They mention briefly that they have to train the encoder and decoder portions of the network in alternation rather than simultaneously, possibly as a way of addressing some of the issues that we discuss in Section 3.1.

3.1 Optimization challenges

Our model aims to learn global latent representations of sentence content. We can quantify the degree to which our model learns global features by looking at the variational lower bound objective (1). The bound breaks into two terms: the data likelihood under the posterior (expressed as cross entropy), and the kl divergence of the posterior from the prior. A model that encodes useful information in the latent variable will have a non-zero kl divergence term and a relatively small cross entropy term. Straightforward implementations of our vae fail to learn this behavior: except in vanishingly rare cases, most training runs with most hyperparameters yield models that consistently set equal to the prior , bringing the kl divergence term of the cost function to zero.

When the model does this, it is essentially behaving as an rnnlm. Because of this, it can express arbitrary distributions over the output sentences (albeit with a potentially awkward left-to-right factorization) and can thereby achieve likelihoods that are close to optimal. Previous work on vaes for image modeling (Kingma and Welling, 2015) used a much weaker independent pixel decoder model , forcing the model to use the global latent variable to achieve good likelihoods. In a related result, recent approaches to image generation that use lstm decoders are able to do well without vae-style global latent variables (Theis and Bethge, 2015).

This problematic tendency in learning is compounded by the lstm decoder's sensitivity to subtle variation in the hidden states, such as that introduced by the posterior sampling process. This causes the model to initially learn to ignore and go after low hanging fruit, explaining the data with the more easily optimized decoder. Once this has happened, the decoder ignores the encoder and little to no gradient signal passes between the two, yielding an undesirable stable equilibrium with the kl cost term at zero. We propose two techniques to mitigate this issue.

KL cost annealing

In this simple approach to this problem, we add a variable weight to the kl term in the cost function at training time. At the start of training, we set that weight to zero, so that the model learns to encode as much information in as it can. Then, as training progresses, we gradually increase this weight, forcing the model to smooth out its encodings and pack them into the prior. We increase this weight until it reaches 1, at which point the weighted cost function is equivalent to the true variational lower bound. In this setting, we do not optimize the proper lower bound on the training data likelihood during the early stages of training, but we nonetheless see improvements on the value of that bound at convergence. This can be thought of as annealing from a vanilla autoencoder to a vae. The rate of this increase is tuned as a hyperparameter.

Figure 2: The weight of the kl divergence term of variational lower bound according to a typical sigmoid annealing schedule plotted alongside the (unweighted) value of the kl divergence term for our vae on the Penn Treebank.

Figure2 shows the behavior of the kl cost term during the first 50k steps of training on Penn Treebank (Marcus et al., 1993) language modeling with kl cost annealing in place. This example reflects a pattern that we observed often: kl spikes early in training while the model can encode information in cheaply, then drops substantially once it begins paying the full kl divergence penalty, and finally slowly rises again before converging as the model learns to condense more information into .

Word dropout and historyless decoding

In addition to weakening the penalty term on the encodings, we also experiment with weakening the decoder. As in rnnlms and sequence autoencoders, during learning our decoder predicts each word conditioned on the ground-truth previous word. A natural way to weaken the decoder is to remove some or all of this conditioning information during learning. We do this by randomly replacing some fraction of the conditioned-on word tokens with the generic unknown word token unk. This forces the model to rely on the latent variable to make good predictions. This technique is a variant of word dropout (Iyyer et al., 2015; Kumar et al., 2015), applied not to a feature extractor but to a decoder. We also experimented with standard dropout (Srivastava et al., 2014) applied to the input word embeddings in the decoder, but this did not help the model learn to use the latent variable.

This technique is parameterized by a keep rate . We tune this parameter both for our vae and for our baseline rnnlm. Taken to the extreme of , the decoder sees no input, and is thus able to condition only on the number of words produced so far, yielding a model that is extremely limited in the kinds of distributions it can model without using .

Table 2: Penn Treebank language modeling results, reported as negative log likelihoods and as perplexities. Lower is better for both metrics. For the vae, the kl term of the likelihood is shown in parentheses alongside the total likelihood.

4 Results: Language modeling

In this section, we report on language modeling experiments on the Penn Treebank in an effort to discover whether the inclusion of a global latent variable is helpful for this standard task. For this reason, we restrict our vae hyperparameter search to those models which encode a non-trivial amount in the latent variable, as measured by the kl divergence term of the variational lower bound.

Results

We used the standard train–test split for the corpus, and report test set results in Table 2 . The results shown reflect the training and test set performance of each model at the training step at which the model performs best on the development set. Our reported figures for the vae reflect the variational lower bound on the test likelihood, while for the rnnlms, which can be evaluated exactly, we report the true test likelihood. This discrepancy puts the vae at a potential disadvantage.

In the standard setting, the vae performs slightly worse than the rnnlm baseline, though it does succeed in using the latent space to a limited extent: it has a reconstruction cost (99) better than that of the baseline rnnlm, but makes up for this with a kl divergence cost of 2. Training a vae in the standard setting without both word dropout and cost annealing reliably results in models with equivalent performance to the baseline rnnlm, and zero kl divergence.

To demonstrate the ability of the latent variable to encode the full content of sentences in addition to more abstract global features, we also provide numbers for an inputless decoder that does not condition on previous tokens, corresponding to a word dropout keep rate of . In this regime we can see that the variational lower bound contains a significantly larger kl term and shows a substantial improvement over the weakened rnnlm, which is essentially limited to using unigram statistics in this setting. While it is weaker than a standard decoder, the inputless decoder has the interesting property that its sentence generating process is fully differentiable. Advances in generative models of this kind could be promising as a means of generating text while using adversarial training methods, which require differentiable generators.

Even with the techniques described in the previous section, including the inputless decoder, we were unable to train models for which the kl divergence term of the cost function dominates the reconstruction term. This suggests that it is still substantially easier to learn to factor the data distribution using simple local statistics, as in the rnnlm, such that an encoder will only learn to encode information in when that information cannot be effectively described by these local statistics.

but now , as they parked out front and owen stepped out of the car , he could see
True: that the transition was complete .	RNNLM: it , " i said .	VAE: through the driver 's door .
you kill him and his
True: men .	RNNLM: . "	VAE: brother .
not surprising , the mothers dont exactly see eye to eye with me
True: on this matter .	RNNLM: , i said .	VAE: , right now .

Table 3: Examples of using beam search to impute missing words within sentences. Since we decode from right to left, note the stereotypical completions given by the rnnlm, compared to the vae completions that often use topic data and more varied vocabulary.

5 Results: Imputing missing words

We claim that the our vae's global sentence features make it especially well suited to the task of imputing missing words in otherwise known sentences. In this section, we present a technique for imputation and a novel evaluation strategy inspired by adversarial training. Qualitatively, we find that the vae yields more diverse and plausible imputations for the same amount of computation (see the examples given in Table 3), but precise quantitative evaluation requires intractable likelihood computations. We sidestep this by introducing a novel evaluation strategy.

While the standard rnnlm is a powerful generative model, the sequential nature of likelihood computation and decoding makes it unsuitable for performing inference over unknown words given some known words (the task of imputation). Except in the special case where the unknown words all appear at the end of the decoding sequence, sampling from the posterior over the missing variables is intractable for all but the smallest vocabularies. For a vocabulary of size , it requires runs of full rnn inference per step of Gibbs sampling or iterated conditional modes. Worse, because of the directional nature of the graphical model given by an rnnlm, many steps of sampling could be required to propagate information between unknown variables and the known downstream variables. The vae, while it suffers from the same intractability problems when sampling or computing map imputations, can more easily propagate information between all variables, by virtue of having a global latent variable and a tractable recognition model.

For this experiment and subsequent analysis, we train our models on the Books Corpus introduced in Kiros et al. (2015). This is a collection of text from 12k e-books, mostly fiction. The dataset, after pruning, contains approximately 80m sentences. We find that this much larger amount of data produces more subjectively interesting generative models than smaller standard language modeling datasets. We use a fixed word dropout rate of 75% when training this model and all subsequent models unless otherwise specified. Our models (the vae and rnnlm) are trained as language models, decoding right-to-left to shorten the dependencies during learning for the vae. We use 512 hidden units.

Inference method

To generate imputations from the two models, we use beam search with beam size 15 for the rnnlm and approximate iterated conditional modes (Besag, 1986) with 3 steps of a beam size 5 search for the vae. This allows us to compare the same amount of computation for both models. We find that breaking decoding for the vae into several sequential steps is necessary to propagate information among the variables. Iterated conditional modes is a technique for finding the maximum joint assignment of a set of variables by alternately maximizing conditional distributions, and is a generalization of "hard-em

" algorithms like k-means

(Kearns et al., 1998). For approximate iterated conditional modes, we first initialize the unknown words to the unk token. We then alternate assigning the latent variable to its mode from the recognition model, and performing constrained beam search to assign the unknown words. Both of our generative models are trained to decode sentences from right-to-left, which shortens the dependencies involved in learning for the vae, and we impute the final 20% of each sentence. This lets us demonstrate the advantages of the global latent variable in the regime where the rnnlm suffers the most from its inductive bias.

Adversarial evaluation

Drawing inspiration from adversarial training methods for generative models as well as non-parametric two-sample tests (Goodfellow et al., 2014; Li et al., 2015b; Denton et al., 2015; Gretton et al., 2012), we evaluate the imputed sentence completions by examining their distinguishability from the true sentence endings. While the non-differentiability of the discrete rnn decoder prevents us from easily applying the adversarial criterion at train time, we can define a very flexible test time evaluation by training a discriminant function to separate the generated and true sentences, which defines an adversarial error.

We train two classifiers: a bag-of-unigrams logistic regression classifier and an

lstm logistic regression classifier that reads the input sentence and produces a binary prediction after seeing the final eos token. We train these classifiers using early stopping on a train/dev/test split of 320k sentences, constructing a dataset of 50% complete sentences from the corpus (positive examples) and 50% sentences with imputed completions (negative examples). We define the adversarial error as the gap between the ideal accuracy of the discriminator (50%, i.e. indistinguishable samples), and the actual accuracy attained.

Table 4: Results for adversarial evaluation of imputations. Unigram and lstm numbers are the adversarial error (see text) and rnnlm numbers are the negative log-likelihood given to entire generated sentence by the rnnlm, a measure of sentence typicality. Lower is better on both metrics. The vae is able to generate imputations that are significantly more difficult to distinguish from the true sentences.

Results

As a consequence of this experimental setup, the rnnlm cannot choose anything outside of the top 15 tokens given by the rnn's initial unconditional distribution when producing the final token of the sentence, since it has not yet generated anything to condition on, and has a beam size of 15. Table 4 shows that this weakness makes the rnnlm produce far less diverse samples than the vae and suffer accordingly versus the adversarial classifier. Additionally, we include the score given to the entire sentence with the imputed completion given a separate independently trained language model. The likelihood results are comparable, though the rnnlms favoring of generic high-probability endings such as "he said," gives it a slightly lower negative log-likelihood. Measuring the rnnlm likelihood of sentences themselves produced by an rnnlm is not a good measure of the power of the model, but demonstrates that the rnnlm can produce what it sees as high-quality imputations by favoring typical local statistics, even though their repetitive nature produces easy failure modes for the adversarial classifier. Accordingly, under the adversarial evaluation our model substantially outperforms the baseline since it is able to efficiently propagate information bidirectionally through the latent variable.

Table 5: Samples from a model trained with varying amounts of word dropout. We sample a vector from the Gaussian prior and apply greedy decoding to the result. Note that diverse samples can be achieved using a purely deterministic decoding procedure. Once we use reach a purely inputless decoder in the 0% setting, however, the samples cease to be plausible English sentences.

he had been unable to conceal the fact that there was a logical explanation for his inability to

alter the fact that they were supposed to be on the other side of the house .

with a variety of pots strewn scattered across the vast expanse of the high ceiling , a vase of

colorful flowers adorned the tops of the rose petals littered the floor and littered the floor .

atop the circular dais perched atop the gleaming marble columns began to emerge from atop the

stone dais, perched atop the dais .

Table 6: Greedily decoded sentences from a model with 75% word keep probability, sampling from lower-likelihood areas of the latent space. Note the consistent topics and vocabulary usage.

6 Analyzing variational models

We now turn to more qualitative analysis of the model. Since our decoder model is a sophisticated rnnlm, simply sampling from the directed graphical model (first then ) would not tell us much about how much of the data is being explained by each of the latent space and the decoder. Instead, for this part of the evaluation, we sample from the Gaussian prior, but use a greedy deterministic decoder for , the rnnlm conditioned on . This allows us to get a sense of how much of the variance in the data distribution is being captured by the distributed vector as opposed to the decoder. Interestingly, these results qualitatively demonstrate that large amounts of variation in generated language can be achieved by following this procedure. In the appendix, we provide some results on small text classification tasks.

6.1 Analyzing the impact of word dropout

Figure 3: The values of the two terms of the cost function as word dropout increases.

input	we looked out at the setting sun .	i went to the kitchen .	how are you doing ?
mean	they were laughing at the same time .	i went to the kitchen .	what are you doing ?
samp. 1	ill see you in the early morning .	i went to my apartment .	" are you sure ?
samp. 2	i looked up at the blue sky .	i looked around the room .	what are you doing ?
samp. 3	it was down on the dance floor .	i turned back to the table .	what are you doing ?

Table 7: Three sentences which were used as inputs to the vae, presented with greedy decodes from the mean of the posterior distribution, and from three samples from that distribution.

For this experiment, we train on the Books Corpus and test on a held out 10k sentence test set from that corpus. We find that train and test set performance are very similar. In Figure 3, we examine the impact of word dropout on the variational lower bound, broken down into kl divergence and cross entropy components. We drop out words with the specified keep rate at training time, but supply all words as inputs at test time except in the setting.

We do not re-tune the hyperparameters for each run, which results in the model with no dropout encoding very little information in (i.e., the kl component is small). We can see that as we lower the keep rate for word dropout, the amount of information stored in the latent variable increases, and the overall likelihood of the model degrades somewhat. Results from the Section4 indicate that a model with no latent variable would degrade in performance significantly more in the presence of heavy word dropout.

We also qualitatively evaluate samples, to demonstrate that the increased kl allows meaningful sentences to be generated purely from continuous sampling. Since our decoder model is a sophisticated rnnlm, simply sampling from the directed graphical model (first then ) would not tell us about how much of the data is being explained by the learned vector vs. the language model. Instead, for this part of the qualitative evaluation, we sample from the Gaussian prior, but use a greedy deterministic decoder for , taking each token . This allows us to get a sense of how much of the variance in the data distribution is being captured by the distributed vector as opposed to by local language model dependencies.

These results, shown in Table 5 , qualitatively demonstrate that large amounts of variation in generated language can be achieved by following this procedure. At the low end, where very little of the variance is explained by , we see that greedy decoding applied to a Gaussian sample does not produce diverse sentences. As we increase the amount of word dropout and force to encode more information, we see the sentences become more varied, but past a certain point they begin to repeat words or show other signs of ungrammaticality. Even in the case of a fully dropped-out decoder, the model is able to capture higher-order statistics not present in the unigram distribution.

Additionally, in Table 6

we examine the effect of using lower-probability samples from the latent Gaussian space for a model with a 75% word keep rate. We find lower-probability samples by applying an approximately volume-preserving transformation to the Gaussian samples that stretches some eigenspaces by up to a factor of 4. This has the effect of creating samples that are not too improbable under the prior, but still reach into the tails of the distribution. We use a random linear transformation, with matrix elements drawn from a uniform distribution from

, with chosen to give the desired properties ( in our experiments). Here we see that the sentences are far less typical, but for the most part are grammatical and maintain a clear topic, indicating that the latent variable is capturing a rich variety of global features even for rare sentences.

6.2 Sampling from the posterior

In addition to generating unconditional samples, we can also examine the sentences decoded from the posterior vectors for various sentences . Because the model is regularized to produce distributions rather than deterministic codes, it does not exactly memorize and round-trip the input. Instead, we can see what the model considers to be similar sentences by examining the posterior samples in Table 7 . The codes appear to capture information about the number of tokens and parts of speech for each token, as well as topic information. As the sentences get longer, the fidelity of the round-tripped sentences decreases.

" i want to talk to you . "

"i want to be with you . "

"i do n't want to be with you . "

i do n't want to be with you .

she did n't want to be with him .

he was silent for a long moment .

he was silent for a moment .

it was quiet for a moment .

it was dark and cold .

there was a pause .

it was my turn .

Table 8: Paths between pairs of random points in vae space: Note that intermediate sentences are grammatical, and that topic and syntactic structure are usually locally consistent.

6.3 Homotopies

The use of a variational autoencoder allows us to generate sentences using greedy decoding on continuous samples from the space of codes. Additionally, the volume-filling and smooth nature of the code space allows us to examine for the first time a concept of homotopy (linear interpolation) between sentences. In this context, a homotopy between two codes and is the set of points on the line between them, inclusive, for . Similarly, the homotopy between two sentences decoded (greedily) from codes and is the set of sentences decoded from the codes on the line. Examining these homotopies allows us to get a sense of what neighborhoods in code space look like – how the autoencoder organizes information and what it regards as a continuous deformation between two sentences.

While a standard non-variational rnnlm does not have a way to perform these homotopies, a vanilla sequence autoencoder can do so. As mentioned earlier in the paper, if we examine the homotopies created by the sequence autoencoder in Table 1 , though, we can see that the transition between sentences is sharp, and results in ungrammatical intermediate sentences. This gives evidence for our intuition that the vae learns representations that are smooth and "fill up" the space.

In Table 8 (and in additional tables in the appendix) we can see that the codes mostly contain syntactic information, such as the number of words and the parts of speech of tokens, and that all intermediate sentences are grammatical. Some topic information also remains consistent in neighborhoods along the path. Additionally, sentences with similar syntax and topic but flipped sentiment valence, e.g. "the pain was unbearable" vs. "the thought made me smile", can have similar embeddings, a phenomenon which has been observed with single-word embeddings (for example the vectors for "bad" and "good" are often very similar due to their similar distributional characteristics).

7 Conclusion

This paper introduces the use of a variational autoencoder for natural language sentences. We present novel techniques that allow us to train our model successfully, and find that it can effectively impute missing words. We analyze the latent space learned by our model, and find that it is able to generate coherent and diverse sentences through purely continuous sampling and provides interpretable homotopies that smoothly interpolate between sentences.

We hope in future work to investigate factorization of the latent variable into separate style and content components, to generate sentences conditioned on extrinsic features, to learn sentence embeddings in a semi-supervised fashion for language understanding tasks like textual entailment, and to go beyond adversarial evaluation to a fully adversarial training objective.

References

• Bahdanau et al. (2015) Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Bengio. 2015. Neural machine translation by jointly learning to align and translate. In Proc. ICLR.
• Bayer and Osendorfer (2015) Justin Bayer and Christian Osendorfer. 2015. Learning stochastic recurrent networks. arXiv preprint arXiv:1411.7610 .
• Besag (1986) Julian Besag. 1986. On the statistical analysis of dirty pictures. Journal of the Royal Statistical Society Series B (Methodological) pages 48–259.
• Chung et al. (2015) Junyoung Chung, Kyle Kastner, Laurent Dinh, Kratarth Goel, Aaron Courville, and Yoshua Bengio. 2015. A recurrent latent variable model for sequential data. In Proc. NIPS.
• Dai and Le (2015) Andrew M. Dai and Quoc V. Le. 2015. Semi-supervised sequence learning. In Proc. NIPS.
• Denton et al. (2015) Emily Denton, Soumith Chintala, Arthur Szlam, and Rob Fergus. 2015. Deep generative image models using a laplacian pyramid of adversarial networks. In Proc. NIPS.
• Dolan et al. (2004) Bill Dolan, Chris Quirk, and Chris Brockett. 2004. Unsupervised construction of large paraphrase corpora: Exploiting massively parallel news sources. In Proceedings of the 20th international conference on Computational Linguistics. Association for Computational Linguistics, page 350.
• Donahue et al. (2015) Jeff Donahue, Lisa Anne Hendricks, Sergio Guadarrama, Marcus Rohrbach, Subhashini Venugopalan, Kate Saenko, and Trevor Darrell. 2015. Long-term recurrent convolutional networks for visual recognition and description. In Proc. CVPR.
• Fabius and van Amersfoort (2014) Otto Fabius and Joost R. van Amersfoort. 2014. Variational recurrent auto-encoders. arXiv preprint arXiv:1412.6581.
• Goodfellow et al. (2014) Ian Goodfellow, Jean Pouget-Abadie, Mehdi Mirza, Bing Xu, David Warde-Farley, Sherjil Ozair, Aaron Courville, and Yoshua Bengio. 2014. Generative adversarial nets. In Proc. NIPS.
• Gregor et al. (2015) Karol Gregor, Ivo Danihelka, Alex Graves, and Daan Wierstra. 2015. DRAW: A recurrent neural network for image generation. In Proc. ICML.
• Gretton et al. (2012) Arthur Gretton, Karsten M Borgwardt, Malte J Rasch, Bernhard Schölkopf, and Alexander Smola. 2012. A kernel two-sample test. JMLR 13(1):723–773.
• Hochreiter and Schmidhuber (1997) Sepp Hochreiter and Jürgen Schmidhuber. 1997. Long short-term memory. Neural computation 9(8).
• Iyyer et al. (2015) Mohit Iyyer, Varun Manjunatha, Jordan Boyd-Graber, and Hal Daumé III. 2015. Deep unordered composition rivals syntactic methods for text classification. In Proc. ACL.
• Kearns et al. (1998) Michael Kearns, Yishay Mansour, and Andrew Y Ng. 1998. An information-theoretic analysis of hard and soft assignment methods for clustering. In Learning in graphical models, Springer, pages 495–520.
• Kim (2014) Yoon Kim. 2014. Convolutional neural networks for sentence classification. EMNLP .
• Kingma and Welling (2015) Diederik P. Kingma and Max Welling. 2015. Auto-encoding variational bayes. In Proc. ICLR.
• Kiros et al. (2015) Ryan Kiros, Yukun Zhu, Ruslan Salakhutdinov, Richard S Zemel, Antonio Torralba, Raquel Urtasun, and Sanja Fidler. 2015. Skip-thought vectors. arXiv preprint arXiv:1506.06726.
• Kumar et al. (2015) Ankit Kumar, Ozan Irsoy, Jonathan Su, James Bradbury, Robert English, Brian Pierce, Peter Ondruska, Ishaan Gulrajani, and Richard Socher. 2015. Ask me anything: Dynamic memory networks for natural language processing. arXiv preprint arXiv:1506.07285.
• Le and Mikolov (2014) Quoc V. Le and Tomáš Mikolov. 2014. Distributed representations of sentences and documents. In Proc. ICML.
• Li et al. (2015a) Jiwei Li, Minh-Thang Luong, and Dan Jurafsky. 2015a. A hierarchical neural autoencoder for paragraphs and documents. In Proc. ACL.
• Li and Roth (2002) Xin Li and Dan Roth. 2002. Learning question classifiers. In Proceedings of the 19th international conference on Computational linguistics-Volume 1. Association for Computational Linguistics, pages 1–7.
• Li et al. (2015b) Yujia Li, Kevin Swersky, and Richard Zemel. 2015b. Generative moment matching networks. In Proc. ICML.
• Mao et al. (2015) Junhua Mao, Wei Xu, Yi Yang, Jiang Wang, Zhiheng Huang, and Alan Yuille. 2015. Deep captioning with multimodal recurrent neural networks (m-RNN). In Proc. ICLR.
• Marcus et al. (1993) Mitchell P Marcus, Mary Ann Marcinkiewicz, and Beatrice Santorini. 1993. Building a large annotated corpus of English: The Penn Treebank. Computational linguistics 19(2):313–330.
• Miao et al. (2015) Yishu Miao, Lei Yu, and Phil Blunsom. 2015. Neural variational inference for text processing. arXiv preprint arXiv:1511.06038 .
• Mikolov et al. (2011) Tomáš Mikolov, Stefan Kombrink, Lukáš Burget, Jan Honza Černockỳ, and Sanjeev Khudanpur. 2011. Extensions of recurrent neural network language model. In Proc. ICASSP.
• Raiko et al. (2015) Tapani Raiko, Mathias Berglund, Guillaume Alain, and Laurent Dinh. 2015. Techniques for learning binary stochastic feedforward neural networks. In Proc. ICLR.
• Rezende and Mohamed (2015) Danilo J. Rezende and Shakir Mohamed. 2015. Variational inference with normalizing flows. In Proc. ICML.
• Rezende et al. (2014) Danilo J. Rezende, Shakir Mohamed, and Daan Wierstra. 2014.

  Stochastic backpropagation and approximate inference in deep generative models.

  In Proc. ICML.
• Snoek et al. (2012) Jasper Snoek, Hugo Larochelle, and Ryan P. Adams. 2012.

  Practical Bayesian optimization of machine learning algorithms.

  In Proc. NIPS.
• Socher et al. (2011) Richard Socher, Eric H Huang, Jeffrey Pennin, Christopher D Manning, and Andrew Y Ng. 2011. Dynamic pooling and unfolding recursive autoencoders for paraphrase detection. In Advances in Neural Information Processing Systems. pages 801–809.
• Srivastava et al. (2014) Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. 2014. Dropout: A simple way to prevent neural networks from overfitting. JMLR 15(1):1929–1958.
• Srivastava et al. (2015) Rupesh Kumar Srivastava, Klaus Greff, and Jürgen Schmidhuber. 2015. Training very deep networks. In Proc. NIPS.
• Sutskever et al. (2014) Ilya Sutskever, Oriol Vinyals, and Quoc V. Le. 2014. Sequence to sequence learning with neural networks. In Proc. NIPS.
• Theis and Bethge (2015) Lucas Theis and Matthias Bethge. 2015. Generative image modeling using spatial LSTMs. In Proc. NIPS.
• Vinyals et al. (2015) Oriol Vinyals, Alexander Toshev, Samy Bengio, and Dumitru Erhan. 2015. Show and tell: A neural image caption generator. In Proc. CVPR.
• Zhao et al. (2015) Han Zhao, Zhengdong Lu, and Pascal Poupart. 2015. Self-adaptive hierarchical sentence model. IJCAI .

Text classification

Table 9: Results for the msr Paraphrase Corpus.

In order to further examine the the structure of the representations discovered by the vae, we conduct classification experiments on paraphrase detection and question type classification. We train a vae with a hidden state size of 1200 hidden units on the Books Corpus, and use the posterior mean of the model as the extracted sentence vector. We train classifiers on these means using the same experimental protocol as Kiros et al. (2015).

Paraphrase detection

For the task of paraphrase detection, we use the Microsoft Research Paraphrase Corpus (Dolan et al., 2004). We compute features from the sentence vectors of sentence pairs in the same way as Kiros et al. (2015), concatenating the elementwise products and the absolute value of the elementwise differences of the two vectors. We train an -regularized logistic regression classifier and tune the regularization strength using cross-validation.

We present results in Table 9 and compare to several previous models for this task. Feats is the lexicalized baseline from Socher et al. (2011). rae uses the recursive autoencoder from that work, and dp adds their dynamic pooling step to calculate pairwise features. st uses features from the unidirectional skip-thought model, bi-st uses bidirectional skip-thought, and combine-st uses the concatenation of those features. We also experimented with concatenating lexical features and the two types of distributed features.

We found that our features performed slightly worse than skip-thought features by themselves and slightly better than recursive autoencoder features, and were complementary and yielded strong performance when simply concatenated with the skip-thought features.

Question classification

We also conduct experiments on the TREC Question Classification dataset of Li and Roth (2002). Following Kiros et al. (2015), we train an

-regularized softmax classifier with 10-fold cross-validation to set the regularization. Note that using a linear classifier like this one may disadvantage our representations here, since the Gaussian distribution over hidden codes in a

vae is likely to discourage linear separability.

Table 10: Results for TREC Question Classification.

We present results in Table 10 . Here, ae is a plain sequence autoencoder. We compare with results from a bag of word vectors (cbow, Zhao et al., 2015) and skip-thought (st). We also compare with an rnn classifier (Zhao et al., 2015) and a cnn classifier (Kim, 2014) both of which, unlike our model, are optimized end-to-end. We were not able to make the vae codes perform better than cbow in this case, but they did outperform features from the sequence autoencoder. Skip-thought performed quite well, possibly because the skip-thought training objective of next sentence prediction is well aligned to this task: it essentially trains the model to generate sentences that address implicit open questions from the narrative of the book. Combining the two representations did not give any additional performance gain over the base skip-thought model.

Hyperparameter tuning

Table 11: Automatically selected hyperparameter values used for the models used in the Penn Treebank language modeling experiments.

We extensively tune the hyperparameters of each model using an automatic Bayesian hyperparameter tuning algorithm (based on Snoek et al., 2012) over development set data. We run the model with each set of hyperpameters for 10 hours, operating 12 experiments in parallel, and choose the best set of hyperparameters after 200 runs. Results for our language modeling experiments are reported in Table 11 on the next page.

valign=t amazing , is n't it ? so , what is it ? it hurts , isnt it ? why would you do that ? " you can do it . " i can do it . i ca n't do it . " i can do it . " do n't do it . " i can do it . i could n't do it . no . he said . " no , " he said . " no , " i said . " i know , " she said . " thank you , " she said . " come with me , " she said . " talk to me , " she said . " do n't worry about it , " she said . i dont like it , he said . i waited for what had happened . it was almost thirty years ago . it was over thirty years ago . that was six years ago . he had died two years ago . ten , thirty years ago . " it 's all right here . " everything is all right here . " it 's all right here . it 's all right here . we are all right here . come here in five minutes .   valign=t this was the only way . it was the only way . it was her turn to blink . it was hard to tell . it was time to move on . he had to do it again . they all looked at each other . they all turned to look back . they both turned to face him . they both turned and walked away . there is no one else in the world . there is no one else in sight . they were the only ones who mattered . they were the only ones left . he had to be with me . she had to be with him . i had to do this . i wanted to kill him . i started to cry . i turned to him . im fine . youre right . " all right . you 're right . okay , fine . " okay , fine . yes , right here . no , not right now . " no , not right now . " talk to me right now . please talk to me right now . i 'll talk to you right now . " i 'll talk to you right now . " you need to talk to me now . " but you need to talk to me now .

Table 12: Selected homotopies between pairs of random points in the latent vae space.

Additional homotopies

Table 12 , on the next page, shows additional homotopies from our model. We observe that intermediate sentences are almost always grammatical, and often contain consistent topic, vocabulary and syntactic information in local neighborhoods as they interpolate between the endpoint sentences. Because the model is trained on fiction, including romance novels, the topics are often rather dramatic.

gledhillbettle.blogspot.com

Source: https://deepai.org/publication/generating-sentences-from-a-continuous-space

Share this post