Recurrent Variational Autoencoder has been widely used for language modeling and text generation tasks. These models often face a difficult optimization problem, also known as the Kullback-Leibler (KL) term vanishing issue, where the posterior easily collapses to the prior, and the model will ignore latent codes in generative tasks. To address this problem, we introduce an improved Wasserstein Variational Autoencoder (WAE) with Riemannian Normalizing Flow (RNF) for text modeling. The RNF transforms a latent variable into a space that respects the geometric characteristics of input space, which makes posterior impossible to collapse to the non-informative prior. The Wasserstein objective minimizes the distance between the marginal distribution and the prior directly, and therefore does not force the posterior to match the prior. Empirical experiments show that our model avoids KL vanishing over a range of datasets and has better performances in tasks such as language modeling, likelihood approximation, and text generation. Through a series of experiments and analysis over latent space, we show that our model learns latent distributions that respect latent space geometry and is able to generate sentences that are more diverse. 1 1 Introduction Variational Autocoder (VAE) (Kingma and Welling, 2013; Rezende and Mohamed, 2015) is a probabilistic generative model shown to be successful over a wide range of tasks such as image generation (Gregor et al., 2015; Yan et al., 2016), dialogue generation (Zhao et al., 2017b), transfer learning (Shen et al., 2017), and classification (Jang et al., 2017). The encoder-decoder architecture of VAE allows it to learn a 1 Code could be found at https://github.com/ kingofspace0wzz/wae-rnf-lm continuous space of latent representations from high-dimensional data input and makes sampling procedure from such latent space very straightforward. Recent studies also show that VAE learns meaningful representations that encode non-trivial information from input (Gao et al., 2018; Zhao et al., 2017a). Applications of VAE in tasks of Natural Language Processing (Bowman et al., 2015; Zhao et al., 2017b, 2018; Miao et al., 2016) is not as successful as those in Computer Vision. With long-short-term-memory network (LSTM) (Hochre-iter and Schmidhuber, 1997) used as encoder-decoder model, the recurrent variational autoencoder (Bowman et al., 2015) is the first approach that applies VAE to language modeling tasks. They observe that LSTM decoder in VAE often generates texts without making use of latent representations, rendering the learned codes as useless. This phenomenon is caused by an optimization problem called KL-divergence vanishing when training VAE for text data, where the KL-divergence term in VAE objective collapses to zero. This makes the learned representations meaningless as zero KL-divergence indicates that the latent codes are independent of input texts. Many recent studies are proposed to address this key issue. Yang et al. (2017); Semeniuta et al. (2017) use convolutional neural network as decoder architecture to limit the expressiveness of decoder model. Xu and Durrett (2018); Zhao et al. (2017a,b, 2018) seek to learn different latent space and modify the learning objective. And, even though not designed to tackle KL vanishing at the beginning, recent studies on Normalizing Flows (Rezende and Mohamed, 2015; van den Berg et al., 2018) learn meaningful latent space as it helps to transform an over-simplified latent distribution into more flexible distributions. called Riemannian Normalizing Flow (RNF), together with the recently developed Wasserstein objective (Tolstikhin et al., 2018; Arjovsky et al., 2017), to ensure VAE models more robust against the KL vanishing problem. As further explained in later sections, the Wasserstein objective helps to alleviate KL vanishing as it only minimizes the distance between latent marginal distribution and the prior. Moreover, we suspect that the problem also comes from the over-simplified prior as-sumption about latent space. In most cases, the prior is assumed to be a standard Gaussian, and the posterior is assumed to be a diagonal Gaussian for computational efficiency. These assumptions, however, are not suitable to encode intrinsic characteristics of input into latent codes as in reality the latent space is likely to be far more complex than a diagonal Gaussian. The RNF model we proposed in this paper thus helps the situation by encouraging the model to learn a latent space that encodes some geometric properties of input space with a well-defined geometric metric called Riemannian metric tensor. This renders the KL vanishing problem as impossible since a latent distribution that respects input space geometry would only collapse to a standard Gaussian when the input also follows a standard Gaussian, which is never the case for texts and sentences datasets. We then empirically evaluate our RNF Variational Wasserstein Autoencoder on standard language modeling datasets and show that our model has achieved state-of-the-art performances. Our major contributions can be summarized as the following:  We propose Riemannian Normalizing Flow, a new type of flow that uses the Riemannian metric to encourage latent codes to respect geometric characteristics of input space. We introduce a new Wasserstein objective for text modeling, which alleviates KL divergence term vanishing issue, and makes the computation of normalizing flow easier. Empirical studies show that our model produces state-of-the-art results in language modeling and is able to generate meaningful text sentences that are more diverse. Given a set of data x = ( x 1 , x 2 , ..., x n ) , a Variational Autoencoder (Kingma and Welling, 2013) aims at learning a continuous latent variable that maximizes the log-likelihood log p ( x ) = log (cid:82) p  ( x | z ) p ( z ) d z . Since this marginal is often intractable, a variational distribution q  ( z | x ) is used to approximate the true posterior distribution p  ( z | x ) . VAE tries to maximize the following lower bound of likelihood, L (  ;  ; x ) = E q ( x ) [ E q  ( z | x ) [log p  ( x | z )] (1)  KL ( q  ( z | x ) || p ( z ))] (2) where q ( x ) is the empirical distribution of input, and the prior p ( z ) is often assumed to be a standard Gaussian for simplicity. The first term in the objective is the reconstruction error, and the second one is KL divergence. For modeling text sentences, Bowman et al. (2015) parameterizes both the inference model q ( z | x ) and the generative model p ( x | z ) as LSTMs. The reparameterization trick proposed by Rezende and Mohamed (2015) is used to train these two models jointly. Since the generative model is often an LSTM that has strong expressiveness, the reconstruction term in the objective will dominate KL divergence term. In this case, the model is able to generate texts without making effective use of latent codes as the latent variable z becomes independent from input when KL divergence term collapses to zero. There are two main approaches to address this issue. One is to explore different choices of the decoder model to control the expressiveness of LSTM. Yang et al. (2017) and Semeniuta et al. (2017) use CNN as an alternative to LSTM. The dilation technique used by Yang et al. (2017) also helps to control the trade-off between decoder capacity and KL vanishing. The other approach is to change the form of latent distribution and to modify the training objective. Xu and Durrett (2018) proposes to use hyperspherical distribution and shows that the KL vanishing problem does not happen in hypersphere. The infoVAE (Zhao et al., 2017a) argues that VAE objective is anti-informatics which encourages KL divergence to be zero. They, therefore, add a mutual information term I ( z ; x ) explicitly to ensure that latent variable z encodes non-trivial information about x , in which case the KL would be greater than zero as z is no longer independent from x . In a similar manner, Xiao et al. (2018) introduces a Dirichlet latent variable to force latent codes to learn useful topic information given input documents. He et al. (2019) and Kim et al. (2018) achieve the current state-of-the-art in terms of sample perplexity. Moreover, the bag-of-words loss used by Zhao et al. (2017b) also dramatically alleviates KL vanishing while not sacrificing sample quality. In Section 3 and Section 4, we introduce RNF with Wasserstein objective. Our proposed model also lies in the direction which seeks to learn more flexible latent distribution, as the main advantage of RNF is to ensure a flexible latent space able to capture geometric characteristics of input space. In this section, we review the basic concepts of Riemannian geometry, normalizing flow, and Wasserstein Autoencoder. We then introduce our new Riemannian normalizing flow in Section 4. Consider an input space X  RD , a d-dimensional ( d < D ) manifold is a smooth surface of points embedded in X . Given a manifold M , a Riemannian manifold is a metric space ( M , G ) , where G is the Riemannian metric tensor that assigns an inner product to every point on the manifold. More formally, a Riemannian metric G : Z  R d  d is defined as a smooth function such that for any two vectors u, v in the tangent space T z M of each point z  M , it assigns the following inner product for u and v , < u, v > G = u TG ( z ) v (3) The Riemannian metric helps us to characterize many intrinsic properties of a manifold. Consider an arbitrary smooth curve  ( t ) : [ a, b ]  M on a given manifold M with a Riemannian metric tensor G , the length of this curve is given by L (  ) = (cid:90) b a ||  (cid:48) ( t ) || dt = (cid:90) b a (cid:112) <  (cid:48) t ,  (cid:48) t > G dt = (cid:90) b a (cid:113)  (cid:48) T t G (  t )  (cid:48) t dt (4) where  (cid:48) t is the curve velocity and lies in the tangent space T  t M at point  ( t ) . When the metric tensor G is equal to 1 everywhere on the curve, it becomes a metric tensor on Euclidean space, where the length of curve is defined as the integral of the velocity function, L (  ) = (cid:82) ba (cid:113)  (cid:48) Tt  (cid:48) t dt = (cid:82) ba  (cid:48) t dt . Given the definition of curve length, the geodesic path between any two points can be defined as the curve that minimizes the curve length  . Namely, if  t is the geodesic curve connecting  ( a ) and  ( b ) , then  t = argmin  L (  ) (5) Practically, a geodesic line is often found by optimizing the following energy function, E (  ) = 1 2 (cid:90) b a  (cid:48) Tt G (  t )  (cid:48) t dt  t = argmin  E (  ) (6) Note that the Euclidean metric is a special case of Riemannian metric. The more general metric tensor G gives us a sense of how much Riemannian geometry deviates from Euclidean geometry. The powerful inference model of VAE can approximate the true posterior distribution through variational inference. The choice of this approximated posterior is one of the major problems. For computational efficiency, a diagonal Gaussian distribution is often chosen as the form of the posterior. As the covariance matrix is always assumed to be diagonal, the posterior fails to capture dependencies among individual dimensions of latent codes. This poses a difficult problem in variational inference. As it is unlikely that the true posterior has a diagonal form, the approximated diagonal distribution is not flexible enough to match the true posterior even in asymptotic time. A normalizing flow, developed by (Rezende and Mohamed, 2015), is then introduced to transform a simple posterior to a more flexible distribution. Formally, a series of normalizing flows is a set of invertible, smooth transformations f t : R d  R d , for t = 1 , ..., T , such that given a random variable z 0 with distribution q ( z 0 ) , the resulting random variable z T = ( f T  f T  1  ...  f 1 )( z 0 ) has the following density function, q ( z T ) = q ( z 0 ) T (cid:89) t =1 | det f  1 t z t  1 | (7) Since each transformation f i for i = 1 , ..., T is invertible, its Jacobian determinant exists and can be computed. By optimizing the modified evidence lower bound objective, ln p ( x )  E q ( z 0 | x ) (cid:2) ln p ( x | z T ) + T (cid:88) t =1 ln | det f t z t  1 | (cid:3)  KL ( q ( z 0 | x ) || p ( z T )) (8) the resulting latent codes z T will have a more flexible distribution. Based on how the Jacobian-determinant is computed, there are two main families of normalizing flow (Tomczak and Welling, 2016; Berg et al., 2018): general normalizing flow and volume preserving flow . While they both search for flexible transformation that has easy-to-compute Jacobian-determinant, the volume-preserving flow aims at finding a specific flow whose Jacobian-determinant equals 1, which simplifies the optimization problem in equation (6). Since we want a normalizing flow that not only gives flexible posterior but also able to uncover the true geometric properties of latent space, we only consider general normalizing flow whose Jacobian-determinant is not a constant as we need it to model the Riemannian metric introduced earlier. Wasserstien distance has been brought to generative models and is shown to be successful in many image generation tasks (Tolstikhin et al., 2018; Arjovsky et al., 2017; Bousquet et al., 2017). Instead of maximizing the evidence lower bound as VAE does, the Wasserstein Autoencoder (Tol-stikhin et al., 2018) optimizes the optimal transport cost (Villani, 2008) between the true data distribution PX ( x ) and the generative distribution PG ( x ) . This leads to the Wasserstein objective, D ( PX , PG ) = inf Q ( Z | X ) Q EPXEQ ( Z | X ) [ c ( X, G ( Z ))] + D Z ( QZ , PZ ) (9) where c (  ) is the optimal transport cost, G : Z  X is any generative function, and the coefficient  controls the strength of regularization term DZ . Given a positive-definite reproducing kernel k : Z  Z  R , the regularization term DZ can be approximated by the Maximum Mean Discrepancy ( MMD ) (Gretton et al., 2012) between the prior PZ and the aggregate posterior QZ ( z ) = Figure 1: Parameterization of the input manifold by latent space and generative function f . In this section we propose our Riemannian Normalizing Flow ( RNF ). RNF is a new type of flow that makes use of the Riemannian metric tensor introduced earlier in Section 3. This metric enforces stochastic encoder to learn a richer class of approximated posterior distribution in order to follow the true geometry of latent space, which helps to avoid the local optimum in which posterior collapses to a standard prior. We then combine this with WAE and we will explain why and how WAE should be used to train with RNF. In the context of VAE, learning a latent space that is homeomorphic to input space is often very challenging. Consider a manifold M  RD , a generator model x = f ( z ) : Z  RD serves as a low-dimensional parameterization of manifold M with respect to z  Z . For most cases, latent space Z is unlikely to be homeomorphic to M , which means that there is no invertible mapping between M and Z . And, since the inference model h : M  Z is nonlinear, the learned latent space often gives a distorted view of input space. Consider the case in Figure 2, where the leftmost graph is the input manifold, and the rightmost graph is the corresponding latent space with curvature reflected by brightness. Let us take two arbitrary points on the manifold and search for the geodesic path connecting these two points. If we consider the distorted latent space as Euclidean, then the geodesic path in latent space does not reflect the true shortest distance between these two points on the manifold, as a straight line in the latent space would Figure 2: An example when latent space does not reflect input space. cross the whole manifold, while the true geodesic path should circumvent this hole. This distortion is caused by the non-constant curvature of latent space. Hence, the latent space should be considered as a curved space with curvature reflected by the Riemannian metric defined locally around each point. As indicated by the brightness, we see that the central area of latent space is highly curved, and thus has higher energy. The geodesic path connecting the two latent codes minimizes the energy function E (  ) = 12 (cid:82)  (cid:48) Tt G (  t )  (cid:48) t dt , indicating that it should avoid those regions with high curvature G . The question now becomes how to impose this intrinsic metric and curvature into latent space. In this paper, we propose a new form of normalizing flow to incorporate with this geometric characteristic. First, consider a normalizing flow f : Z  Z (cid:48) , we can compute length of a curve in the transformed latent space Z (cid:48) , L ( f (  t )) = (cid:90) b a || J  t  (cid:48) t || dt = (cid:90) b a (cid:113)  (cid:48) t J T t J  t  (cid:48) t dt = (cid:90) b a (cid:113)  (cid:48) t G (  t )  (cid:48) t dt (11) where  t : [ a, b ]  Z (cid:48) , a, b  Z J  t = f  z (cid:12)(cid:12) (cid:12) z =  t G (  t ) = J T t J  t = ( f  z ) T ( f  z ) (cid:12)(cid:12)(cid:12) z =  t (12) J  t is the Jacobian matrix defined at  t . In our case, the Riemannian metric tensor G is the inner product of Jacobian J  t and is therefore symmetric positive definite. It reflects input space curvature in low-dimensional parameterization Z (cid:48) . In a highly curved region, the metric tensor G = JTJ is larger than those in other areas, indicating that the latent representation of input manifold has lower curvature, or area of low energy, as any geodesic connecting each pair of points on the manifold favors lower energy path. This implies that those regions outside of data manifold should have high curvature reflected in their low-dimensional parameterization Z (cid:48) . In this paper, we introduce Riemannian normalizing flow ( RNF ) to model curvature. For simplicity, we build our model based on planar flow (Rezende and Mohamed, 2015). A planar flow is an invertible transformation that retracts and extends the support of original latent space with respect to a plane. Mathematically, a planar flow f : Z  Z (cid:48) has the form, f ( z ) = z + u h ( w T z + b ) (13) where h : R d  R d is any smooth non-linear function and is often chosen as tanh (  ) . The in-vertibiliy condition is satisfied as long as u T w   1 . Its Jacobian-determinant with respect to latent codes z is very each to compute, | detf z | = | 1 + u T  ( z ) w |  ( z ) = h (cid:48) ( w T z + b ) (14) With the Jacobian-determinant of planar flow, it is straightforward to compute the determinant of metric tensor G . To see that, note that since f z : R d  R d is a square matrix with full column rank due to invertibility of f , we have | det G | = (cid:12)(cid:12)(cid:12) f  z T (cid:12)(cid:12)(cid:12)(cid:12)(cid:12)(cid:12) f  z (cid:12)(cid:12)(cid:12) = (cid:12)(cid:12)(cid:12) f  z (cid:12)(cid:12)(cid:12) 2 (15) To ensure well-behaved geometry in a transformed latent space, we need the Jacobian-determinant | f z | to be large in region with high curvature | det G | . Hence, we propose to model the metric tensor with the inverse multiquadratics kernel function K used by (Tolstikhin et al., 2018) and a Gaussian kernel, that is, K m ( z , c k ) = C/ ( C + || z  c k || 22 ) k = argmin || z  c k || 22 K g ( z , c k ) = exp (   k || z  z k || 22 ) where c k , k = 1 , 2 , 3 , ..., K are clusters of latent codes, and  k is the bandwidth. We observe that the inverse multiquadratics kernel K m generally performs better. We use the above kernels as constraints over the Jacobian-determinant, so that, | detf (cid:48)  z | = | 1 + u T ( z )  ( z ) w |  K ( z , c k ) (16) As we explained earlier in this section, latent representation of region outside of input manifold should have high curvature in latent space. During training, we seek to maximize this regularized Jacobian | det f (cid:48)  z | rather than the original one. This ensures that those latent codes within latent clusters, and therefore very likely to be on or near input manifold in input space, have much smaller curvature | det G | = | f z | 2 than those outside of latent clusters, as those outside of manifold would seek larger Jacobian in order to counter-effect the regularization term K . The latent space Z (cid:48) transformed by normalizing flow f is thus curved with respect to input manifold. This type of normalizing flow thus learns a latent space to respect geometric characteristics of input space. The KL vanishing problem is then unlikely to happen with a curved latent space. This is because most high-dimensional data in real life forms a curved manifold which is unlikely sampled from a multivariate standard Gaussian. Then, if the latent space reflects curvature of a curved manifold, the support of latent codes certainly does not follow a standard Gaussian either. This helps to push the posterior q ( z | x ) away from the standard Gaussian and never collapse to a non-informative prior. Here we consider using the Wasserstein objective to model the latent marginal distribution of a curved latent space learned by an RNF. The Wasserstein objective with MMD is appealing in our case for two main reasons. First, instead of minimizing the KL-divergence KL ( q ( z | x ) || p ( z )) , it minimizes distance between q ( z ) = (cid:82) q ( z | x ) p ( x ) dx and p ( z ) , which encourages the marginal distribution of latent space to be as close as the prior while not affecting individual posterior distribution q ( z | x ) conditioned on each input. This makes the KL-divergence between posterior and prior, and equivalently the mutual information between latent codes and input sentences I ( z , x ) = KL ( q ( z , x ) || q ( z ) p ( x )) = E p ( x ) [ KL ( q ( z | x ) || p ( z ))]  KL ( q ( z ) || p ( z )) impossible to be vanished as the objective does not require it to be small. Since the learned latent codes and input sentences have non-zero mutual information, the generative model will not ignore latent codes when generating texts. Second, the MMD regularization in WAE makes it possible to optimize normalizing flow without computing the Jacobian-determinant explicitly. The use of MMD is necessary as getting a closed form KL divergence is no-longer possible after we apply RNF to the posterior. And, since the generative function G in the reconstruction term of Wasserstein objective can be any function or composition of functions (Tolstikhin et al., 2018), we can easily compose an RNF function into G such that the reconstructed texts are  X = G ( f ( Z )) = G ( Z (cid:48) ) , Z (cid:48)  Z (cid:48) . Now, given a series of RNFF = f K  ...  f 1 , and let ZK be the curved latent space after applying K flows over the original latent space Z , we optimize the following RNF-Wasserstein objective, D ( PX , PG ) = inf Q ( Z | X ) Q EPXEQ ( Z | X ) [ c ( X, G ( Z (cid:48) ))] + MMD ( QZ (cid:48) , PZ (cid:48) ) +  ( KL ( q ( z | x ) || p ( z ))  (cid:88) log | detf (cid:48)  z | ) (17) where Z  Z , Z (cid:48)  Z (cid:48) , and Z (cid:48) = F ( Z ) . We approximate MMD term with the Gaussian kernel k ( z , z (cid:48) ) = e || z  z (cid:48) || 2 , that is, MMD ( p, q ) = E p ( z ) ,p ( z (cid:48) ) [ k ( z , z (cid:48) )] + E q ( z ) ,q ( z (cid:48) ) [ k ( z , z (cid:48) )]  2 E p ( z ) ,q ( z (cid:48) ) [ k ( z , z (cid:48) )] . between the prior PZ and the marginal of non-curved latent space. This makes sampling procedure for generation tasks much easier, as it is easy to sample a latent code from a non-informative prior. We can get a sample z (cid:48) from Z (cid:48) indirectly by sampling: z  PZ ( z ) and z (cid:48)  F ( z ) . On the other hand, it would be much more difficult to sample from a curved latent space Z (cid:48) directly as the only prior knowledge we have about Z (cid:48) is the curvature reflected by RNF implicitly and hence we do not know the support of Q ( Z (cid:48) ) . In this section, we investigate WAE's performance with Riemannian Normalizing Flow over language and text modeling. We use Penn Treebank (Marcus et al., 1993), Yelp 13 reviews (Xu et al., 2016), as in (Xu and Durrett, 2018; Bowman et al., 2015), and Yahoo Answers used in (Xu and Durrett, 2018; Yang et al., 2017) to follow and compare with prior studies. We limit the maximum length of a sample from all datasets to 200 words. The datasets statistics is shown in Table 3. For each model, we set the maximum vocabulary size to 20K and the maximum length of input to 200 across all data sets. Following Bowman et al. (2015), we use one-layer undirectional Data Train Dev Test Vocab PTB 42068 3370 3761 10K Yelp13 62522 7773 8671 15K Yahoo 100K 10K 10K 20K Table 3: Datasets statistics; The numbers reflect size of each dataset. LSTM for both encoder-decoder models with hidden size 200. Latent codes dimension is set to 32 for all models. We share Word Embeddings of size 200. For stochastic encoders, both MLP  and MLP  are two layer fully-connected networks with hidden size 200 and a batch normalizing output layer (Ioffe and Szegedy, 2015). We use Adam (Kingma and Ba, 2015) with learning rate set to 10  3 to train all models. Dropout is used and is set to 0.2. We train all models for 48 epochs, each of which consists of 2K steps. For models other than WAE, KL-annealing is applied and is scheduled from 0 to 1 at the 21st epoch. For vmf-VAE (Xu and Durrett, 2018), we set the word embedding dimension to be 512 and the hidden units to 1024 for Yahoo, and set both of them to 200 for PTB and Yelp. The temperature  is set to 80 and is kept constant during training. For all WAE models, we add a small KL divergence term to control the posterior distribution. We found that if we only use RNF with MMD as the distance metric, then the posterior may diverge from the prior such that no reasonable samples can be generated from a standard Gaussian variable. Hence, for all data sets, we schedule the KL divergence weight  from 0 to 0.8, and the weight of the MMD term is set as  = 10   . k of RBF is set to 10 for all models. For RNF, we use pre-trained standard VAE models to gather the clusters c k , k = 1 , ..., K , of latent codes, where we set the number of clusters to be 20. We use three normalizing flow for all experiments. Hyperparameter of K m When using the inverse multiquadratics kernel K m ( z , c k ) = C/ ( C + || z  c k || 22 ) for RNF, we follow the choice of hyperparameter in (Tolstikhin et al., 2018). We set C = 2  d  s , where d is the dimensionality of latent codes z , and s is ranged in (0 . 1 , 0 . 2 , 0 . 5 , 1 , 2 , 5 , 10) . The final kernel is computed by K m ( z , c k ) = (cid:80) s 2 ds/ (2 ds + || z  c k || 22 ) . As explained by (Tolstikhin et al., 2018), this strategy allows us to explore a wider range of hyperparameter in one setting. We show the language modeling results for PTB, Yahoo and Yelp in Table 1. We compare negative log-likelihood (NLL), KL divergence, and perplexity (PPL) with all other existing methods. The negative log-likelihood is approximated by its lower bound. We use the negative of ELBO to approximate NLL for all VAE models. For those with normalizing flows, we use the modified ELBO, which is L = E q ( z (0) | x ) [log p ( x | z ( T ) )  log q ( z (0) | x ) + log p ( z ( T ) )] + E q ( z ( T ) ) [ (cid:80) Tt =1 log | f ( t )  z ( t  1) | ] . The numbers show that KL-annealing and dropout used by Bowman et al. (2015) are helpful for PTB, but for complex datasets such as Yahoo and Yelp, the KL divergence still drops to zero due to the over-expressiveness of LSTM. This phenomenon is not alleviated by applying normalizing flow to make the posterior more flexible, as shown in the third row. Part of the reason may be that a simple NF such as a planar flow is not flexible enough and is still dominated by a powerful LSTM decoder. We find that the KL vanishing is alleviated a lit-tle bit if using WAE, which should be the case as WAE objective does not require small KL. We also find that simply applying a planar flow over WAE does not improve the performance that much. On the other hand, using RNF to train WAE dramatically helps the situation which achieves the lowest text perplexity on most conditions except for Figure 3: PTB. YAHOO Answers, where (He et al., 2019; Yang et al., 2017; Kim et al., 2018) have the current state-of-the-art results. We want to emphasize that CNN-VAE (Yang et al., 2017) and SA-VAE (Kim et al., 2018) are not directly comparable with other current approaches. Here, we compare with models that use LSTM as encoder-decoder and have similar time complexity, while the use of CNN as decoder in CNN-VAE would dramatically change the model expressiveness, and it is known that SA-VAE's time complexity (Kim et al., 2018; He et al., 2019) is much higher than all other existing approaches. Mutual information between Z (cid:48) and X One important question is how useful are latent variables. Since no metrics are perfect (Wang et al., 2018), we should not just look at sample perplexity to judge how good a latent code is. Hence, we also investigate how much information can be encoded into latent codes. We believe that the mutual information term I ( z ; x ) is a better metric regarding the usefulness of latent codes than sample the company said it will be sold to the company 's promotional programs and UNK the company also said it will sell $ n million of soap eggs turning millions of dollars the company said it will be UNK by the company 's UNK division n the company said it would n't comment on the suit and its reorganization plan this is a reflection of socialism and capitalism the company also said it will sell its UNK division of the company 's UNK earlier this year the company said it will sell $ n billion of assets and UNK to the u.s last year he said the company 's earnings were n't disclosed one of my favorite places to eat at the biltmore . perplexity, as it tells us directly how much information we can infer from x by looking z . We use Monte Carlo method (Metropo-lis and Ulam, 1949) to get an approximation of I ( z , x ) = KL ( q ( z , x ) || q ( z ) p ( x )) = E p ( x ) [ KL ( q ( z | x ) || p ( z ))]  KL ( q ( z ) || p ( z )) . We compared mutual information between input x and latent codes z sampled from Euclidean latent space Z and Riemannian latent space Z (cid:48) respectively. We see that even though NF does not necessarily help WAE to achieve the lowest perplexity, it does make latent codes to preserve more information about the input. For WAE trained with RNF, sample perplexity and mutual information metric are both good. It is cleary that I ( z (cid:48) , x ) > I ( z , x ) , where z (cid:48) is sampled from the curved space, and z is the sample transformed by the normal planar flow. This further strengthens our confidence over the usefulness of the curved latent space Z (cid:48) . Generating Texts from latent spaces Another way to explore latent space is to look at the quality of generated texts. Here we compare sentences generated from methods that do not use Wasserstein objective and RNF with those generated from curved latent space Z (cid:48) learned by WAE. We observe that texts generated from flat Euclidean space are not as diverse as the ones generated from curved space learned by WAE-RNF. This is largely related to the nature of Wasserstein objective. In WAE, the KL-divergence KL ( q || p )) between the prior and the posterior q ( z | x ) conditioned on each input x does not need to be small to optimize the Wasserstein objective. This indicates that the marginal q ( z ) is able to match to the prior p ( z ) while allowing each posterior q ( z | x ) to have a much more diverse support than that of a standard Gaussian p ( z ) . Therefore, if we randomly generate samples from curved latent space Z (cid:48) many times, we are likely to get samples scattered in different support of distinct posterior conditioned on different input x . Hence, the reconstructed sentences will have a much more diverse meaning or structure. In this paper, we introduced Riemannian Normalizing Flow to train Wasserstein Autoencoder for text modeling. This new model encourages learned latent representation of texts to respect geometric characteristics of input sentences space. Our results show that RNF WAE does significantly improve the language modeling results by modeling the Riemannian geometric space via normalizing flow. We want to thank College of Creative Studies and Gene & Lucas Undergraduate Research Fund for providing scholarships and research opportunities for Prince Zizhuang Wang. We also want to thank Yanxin Feng from Wuhan University for helpful discussion about Riemannian Geometry, and Yunxian He (CMU), Wenhu Chen (UCSB), and Yijun Xiao (UCSB) for their comments which helped us improve our paper and experiments.
abstain abstain abstain abstain abstain result result other other abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain objective abstain result objective objective result other other other other other other other other other other other other other other other other other other other objective objective abstain objective other other method other other other other abstain other other other other other other other other other other other objective other other other other method abstain abstain method abstain abstain abstain abstain abstain method method abstain abstain abstain method abstain abstain method method method abstain abstain abstain method method abstain abstain abstain abstain method method method method method abstain abstain abstain abstain abstain abstain abstain method method other other abstain abstain method method method method abstain abstain method method abstain abstain abstain abstain method method abstain abstain method abstain method abstain method abstain method abstain method method method abstain method method method method abstain method result abstain abstain abstain other abstain abstain abstain abstain result abstain abstain abstain abstain abstain abstain abstain other abstain other abstain result abstain abstain abstain abstain abstain result abstain abstain abstain abstain abstain method abstain result other other