Introduction
Discourse relation characterizes the internal structure and logical relation of a coherent text. Automatically identifying these relations not only plays an important role in discourse comprehension and generation, but also obtains wide applications in many other relevant natural language processing tasks, such as text summarization BIBREF0 , conversation BIBREF1 , question answering BIBREF2 and information extraction BIBREF3 . Generally, discourse relations can be divided into two categories: explicit and implicit, which can be illustrated in the following example:
The company was disappointed by the ruling. because The obligation is totally unwarranted. (adapted from wsj_0294)
With the discourse connective because, these two sentences display an explicit discourse relation Contingency which can be inferred easily. Once this discourse connective is removed, however, the discourse relation becomes implicit and difficult to be recognized. This is because almost no surface information in these two sentences can signal this relation. For successful recognition of this relation, in the contrary, we need to understand the deep semantic correlation between disappointed and obligation in the two sentences above. Although explicit discourse relation recognition (DRR) has made great progress BIBREF4 , BIBREF5 , implicit DRR still remains a serious challenge due to the difficulty in semantic analysis.
Conventional approaches to implicit DRR often treat the relation recognition as a classification problem, where discourse arguments and relations are regarded as the inputs and outputs respectively. Generally, these methods first generate a representation for a discourse, denoted as $\mathbf {x}$ (e.g., manual features in SVM-based recognition BIBREF6 , BIBREF7 or sentence embeddings in neural networks-based recognition BIBREF8 , BIBREF9 ), and then directly model the conditional probability of the corresponding discourse relation $\mathbf {y}$ given $\mathbf {x}$ , i.e. $p(\mathbf {y}|\mathbf {x})$ . In spite of their success, these discriminative approaches rely heavily on the goodness of discourse representation $\mathbf {x}$ . Sophisticated and good representations of a discourse, however, may make models suffer from overfitting as we have no large-scale balanced data.
Instead, we assume that there is a latent continuous variable $\mathbf {z}$ from an underlying semantic space. It is this latent variable that generates both discourse arguments and the corresponding relation, i.e. $p(\mathbf {x},\mathbf {y}|\mathbf {z})$ . The latent variable enables us to jointly model discourse arguments and their relations, rather than conditionally model $\mathbf {y}$ on $\mathbf {x}$ . However, the incorporation of the latent variable makes the modeling difficult due to the intractable computation with respect to the posterior distribution.
Inspired by Kingma and Welling kingma2014autoencoding as well as Rezende et al. DBLP:conf/icml/RezendeMW14 who introduce a variational neural inference model to the intractable posterior via optimizing a reparameterized variational lower bound, we propose a variational neural discourse relation recognizer (VarNDRR) with a latent continuous variable for implicit DRR in this paper. The key idea behind VarNDRR is that although the posterior distribution is intractable, we can approximate it via a deep neural network. Figure 1 illustrates the graph structure of VarNDRR. Specifically, there are two essential components:
The main contributions of our work lie in two aspects. 1) We exploit a generative graphic model for implicit DRR. To the best of our knowledge, this has never been investigated before. 2) We develop a neural recognizer and two neural approximators specifically for implicit DRR, which enables both the recognition and inference to be efficient.
We conduct a series of experiments for English implicit DRR on the PDTB-style corpus to evaluate the effectiveness of our proposed VarNDRR model. Experiment results show that our variational model achieves comparable results against several strong baselines in term of F1 score. Extensive analysis on the variational lower bound further reveals that our model can indeed fit the data set with respect to discourse arguments and relations.
Background: Variational Autoencoder
The variational autoencoder (VAE) BIBREF10 , BIBREF11 , which forms the basis of our model, is a generative model that can be regarded as a regularized version of the standard autoencoder. With a latent random variable $\mathbf {z}$ , VAE significantly changes the autoencoder architecture to be able to capture the variations in the observed variable $\mathbf {x}$ . The joint distribution of $(\mathbf {x}, \mathbf {z})$ is formulated as follows:
$$p_\theta (\mathbf {x}, \mathbf {z}) = p_\theta (\mathbf {x}|\mathbf {z})p_\theta (\mathbf {z})$$   (Eq. 5)
where $p_\theta (\mathbf {z})$ is the prior over the latent variable, usually equipped with a simple Gaussian distribution. $p_\theta (\mathbf {x}|\mathbf {z})$ is the conditional distribution that models the probability of $\mathbf {x}$ given the latent variable $\mathbf {z}$ . Typically, VAE parameterizes $p_\theta (\mathbf {x}|\mathbf {z})$ with a highly non-linear but flexible function approximator such as a neural network.
The objective of VAE is to maximize a variational lower bound as follows:
$$\begin{split} \mathcal {L}_{VAE}(\theta ,\phi ;\mathbf {x}) = -&\text{KL}(q_\phi (\mathbf {z}|\mathbf {x})||p_\theta (\mathbf {z})) \\ + \mathbb {E}_{q_\phi (\mathbf {z}|\mathbf {x})}&[\log p_\theta (\mathbf {x}|\mathbf {z})] \le \log p_\theta (\mathbf {x}) \end{split}$$   (Eq. 6)
where $\text{KL}(Q||P)$ is Kullback-Leibler divergence between two distributions $Q$ and $P$ . $q_\phi (\mathbf {z}|\mathbf {x})$ is an approximation of the posterior $p(\mathbf {z}|\mathbf {x})$ and usually follows a diagonal Gaussian $\mathcal {N}(\mathbf {\mu }, \text{diag}(\mathbf {\sigma ^2}))$ whose mean $\mathbf {\mu }$ and variance $\mathbf {\sigma ^2}$ are parameterized by again, neural networks, conditioned on $\mathbf {x}$ .
To optimize Eq. ( 6 ) stochastically with respect to both $\theta $ and $\phi $ , VAE introduces a reparameterization trick that parameterizes the latent variable $\mathbf {z}$ with the Gaussian parameters $\mathbf {\mu }$ and $\mathbf {\sigma }$ in $q_\phi (\mathbf {z}|\mathbf {x})$ :
$$\tilde{{z}} = \mathbf {\mu } + \mathbf {\sigma }\odot \mathbf {\epsilon }$$   (Eq. 7)
where $\mathbf {\epsilon }$ is a standard Gaussian variable, and $\odot $ denotes an element-wise product. Intuitively, VAE learns the representation of the latent variable not as single points, but as soft ellipsoidal regions in latent space, forcing the representation to fill the space rather than memorizing the training data as isolated representations. With this trick, the VAE model can be trained through standard backpropagation technique with stochastic gradient ascent.
The VarNDRR Model
This section introduces our proposed VarNDRR model. Formally, in VarNDRR, there are two observed variables, $\mathbf {x}$ for a discourse and $\mathbf {y}$ for the corresponding relation, and one latent variable $\mathbf {z}$ . As illustrated in Figure 1 , the joint distribution of the three variables is formulated as follows:
$$  p_\theta (\mathbf {x}, \mathbf {y}, \mathbf {z}) = p_\theta (\mathbf {x}, \mathbf {y}|\mathbf {z})p(\mathbf {z})$$   (Eq. 8)
We begin with this distribution to elaborate the major components of VarNDRR.
Neural Discourse Recognizer
The conditional distribution $p(\mathbf {x}, \mathbf {y}|\mathbf {z})$ in Eq. ( 8 ) shows that both discourse arguments and the corresponding relation are generated from the latent variable. As shown in Figure 1 , $\mathbf {x}$ is d-separated from $\mathbf {y}$ by $\mathbf {z}$ . Therefore the discourse $\mathbf {x}$ and the corresponding relation $\mathbf {y}$ is independent given the latent variable $\mathbf {z}$ . The joint probability can be therefore formulated as follows:
$$  p_\theta (\mathbf {x}, \mathbf {y}, \mathbf {z}) = p_\theta (\mathbf {x}|\mathbf {z})p_\theta (\mathbf {y}|\mathbf {z})p(\mathbf {z})$$   (Eq. 10)
We use a neural model $q_\phi ^{\prime }(\mathbf {z}|\mathbf {x})$ to approximate the prior $p(\mathbf {z})$ conditioned on the discourse $\mathbf {x}$ (see the following section). With respect to the other two conditional distributions, we parameterize them via neural networks as shown in Figure 2 .
Before we describe these neural networks, it is necessary to briefly introduce how discourse relations are annotated in our training data. The PDTB corpus, used as our training data, annotates implicit discourse relations between two neighboring arguments, namely Arg1 and Arg2. In VarNDRR, we represent the two arguments with bag-of-word representations, and denote them as $\mathbf {x_1}$ and $\mathbf {x_2}$ .
To model $p_\theta (\mathbf {x}|\mathbf {z})$ (the bottom part in Figure 2 ), we project the representation of the latent variable $z\in \mathbb {R}^{d_z}$ onto a hidden layer:
$$\begin{split} h_{1}^{\prime } = f(W_{h_{1}^{\prime }} z + b_{h_{1}^{\prime }})\\ h_{2}^{\prime } = f(W_{h_{2}^{\prime }} z + b_{h_{1}^{\prime }}) \end{split}$$   (Eq. 12)
where $h_{1}^{\prime } \in \mathbb {R}^{d_{h_{1}^{\prime }}}, h_{2}^{\prime } \in \mathbb {R}^{d_{h_{2}^{\prime }}}$ , $W_{*}$ is the transformation matrix, $b_{*}$ is the bias term, $d_u$ denotes the dimensionality of vector representations of $u$ and $f(\cdot )$ is an element-wise activation function, such as $tanh(\cdot )$ , which is used throughout our model.
Upon this hidden layer, we further stack a Sigmoid layer to predict the probabilities of corresponding discourse arguments:
$$\begin{split} x_{1}^{\prime } = \text{Sigmoid}(W_{x_{1}^{\prime }} h_{1}^{\prime } + b_{x_{1}^{\prime }}) \\ x_{2}^{\prime } = \text{Sigmoid}(W_{x_{2}^{\prime }} h_{2}^{\prime } + b_{x_{2}^{\prime }}) \end{split}$$   (Eq. 13)
here, $x_{1}^{\prime } \in \mathbb {R}^{d_{x_{1}}}$ and $x_{2}^{\prime } \in \mathbb {R}^{d_{x_{2}}}$ are the real-valued representations of the reconstructed $x_1$ and $x_2$ respectively. We assume that $p_\theta (\mathbf {x}|\mathbf {z})$ is a multivariate Bernoulli distribution because of the bag-of-word representation. Therefore the logarithm of $p(x|z)$ is calculated as the sum of probabilities of words in discourse arguments as follows:
$$\begin{split} &\log ~p(x|z) \\ &=\sum _{i} x_{1,i}\log x_{1,i}^{\prime } + (1-x_{1,i})\log (1- x_{1,i}^{\prime }) \\ &+\sum _{j} x_{2,j}\log x_{2,j}^{\prime } + (1-x_{2,j})\log (1- x_{2,j}^{\prime }) \end{split}$$   (Eq. 15)
where $u_{i,j}$ is the $j$ th element in $u_{i}$ .
In order to estimate $p_\theta (\mathbf {y}|\mathbf {z})$ (the top part in Figure 2 ), we stack a softmax layer over the multilayer-perceptron-transformed representation of the latent variable $z$ :
$$y^{\prime } = \text{SoftMax}(W_{y^{\prime }} \text{MLP}(z) + b_{y^{\prime }})$$   (Eq. 16)
$y^{\prime } \in \mathbb {R}^{d_{y}}$ , and $d_{y}$ denotes the number of discourse relations. MLP projects the representation of latent variable $\mathbf {z}$ into a $d_m$ -dimensional space through four internal layers, each of which has dimension $d_m$ . Suppose that the true relation is $y \in \mathbb {R}^{d_y}$ , the logarithm of $p(y|z)$ is defined as:
$$\log ~p(y|z) = \sum _{i=1}^{d_y} y_i \log y_{i}^{\prime }$$   (Eq. 17)
In order to precisely estimate these conditional probabilities, our model will force the representation $z$ of the latent variable to encode semantic information for both the reconstructed discourse $x^\prime $ (Eq. ( 15 )) and predicted discourse relation $y^\prime $ (Eq. ( 17 )), which is exactly what we want.
Neural Latent Approximator
For the joint distribution in Eq. ( 10 ), we can define a variational lower bound that is similar to Eq. ( 6 ). The difference lies in two aspects: the approximate prior $q_\phi ^{\prime }(\mathbf {z}|\mathbf {x})$ and posterior $q_\phi (\mathbf {z}|\mathbf {x}, \mathbf {y})$ . We model both distributions as a multivariate Gaussian distribution with a diagonal covariance structure: $ \mathcal {N}(\mathbf {z};\mathbf {\mu }, \mathbf {\sigma }^2\mathbf {I}) $
The mean $\mathbf {\mu }$ and s.d. $\mathbf {\sigma }$ of the approximate distribution are the outputs of the neural network as shown in Figure 3 , where the prior and posterior have different conditions and independent parameters.
Approximate Posterior $q_\phi (\mathbf {z}|\mathbf {x}, \mathbf {y})$ is modeled to condition on both observed variables: the discourse arguments $\mathbf {x}$ and relations $\mathbf {y}$ . Similar to the calculation of $p_\theta (\mathbf {x}|\mathbf {z})$ , we first transform the input $\mathbf {x}$ and $\mathbf {y}$ into a hidden representation:
$$\begin{split} &h_1 = f(W_{h_1} x_1 + b_{h_1}) \\ &h_2 = f(W_{h_2} x_2 + b_{h_2}) \\ &h_y = f(W_{h_y} y + b_{h_y}) \end{split}$$   (Eq. 20)
where $h_1 \in \mathbb {R}^{d_{h_1}}, h_2 \in \mathbb {R}^{d_{h_2}}$ and $h_y \in \mathbb {R}^{d_{h_y}}$ .
We then obtain the Gaussian parameters of the posterior $\mathbf {\mu }$ and $\mathbf {\log \sigma }^2$ through linear regression:
$$\begin{split} \mu = W_{\mu _1} h_1 + W_{\mu _2} h_2 + W_{\mu _y} h_y + b_{\mu } \\ \log \sigma ^2 = W_{\sigma _1} h_1 + W_{\sigma _2} h_2 + W_{\sigma _y} h_y + b_{\sigma } \end{split}$$   (Eq. 22)
where $\mu ,\sigma \in \mathbb {R}^{d_z}$ . In this way, this posterior approximator can be efficiently computed.
Approximate Prior $q_\phi ^{\prime }(\mathbf {z}|\mathbf {x})$ is modeled to condition on discourse arguments $\mathbf {x}$ alone. This is based on the observation that discriminative models are able to obtain promising results using only $\mathbf {x}$ . Therefore, assuming the discourse arguments encode the prior information for discourse relation recognition is meaningful.
The neural model for prior $q_\phi ^{\prime }(\mathbf {z}|\mathbf {x})$ is the same as that (i.e. Eq ( 20 ) and ( 22 )) for posterior $q_\phi (\mathbf {z}|\mathbf {x}, \mathbf {y})$ (see Figure 3 ), except for the absence of discourse relation $\mathbf {y}$ . For clarity , we use $\mu ^{\prime }$ and $\sigma ^{\prime }$ to denote the mean and s.d. of the approximate prior.
With the parameters of Gaussian distribution, we can access the representation $z$ using different sampling strategies. However, traditional sampling approaches often breaks off the connection between recognizer and approximator, making the optimization difficult. Instead, we employ the reparameterization trick BIBREF10 , BIBREF11 as in Eq. ( 7 ). During training, we sample the latent variable using $\tilde{z}=\mu + \sigma \odot \epsilon $ ; during testing, however, we employ the expectation of $\mathbf {z}$ in the approximate prior distribution, i.e. set $\tilde{z}=\mu ^{\prime }$ to avoid uncertainty.
Parameter Learning
We employ the Monte Carlo method to estimate the expectation over the approximate posterior, that is $\mathbb {E}_{q_\phi (\mathbf {z}|\mathbf {x}, \mathbf {y})}[\log p_\theta (\mathbf {x},\mathbf {y}|\mathbf {z})]$ . Given a training instance $(x^{(t)}, y^{(t)})$ , the joint training objective is defined:
$$  \mathcal {L}(\theta , \phi ) \simeq -\text{KL}&(q_\phi (\mathbf {z}|x^{(t)}, y^{(t)})||q_\phi ^{\prime }(\mathbf {z}|x^{(t)})) \\ \qquad + \frac{1}{L}&\sum _{l=1}^L \log p_\theta (x^{(t)},y^{(t)}|\tilde{z}^{(t,l)}) \\ \text{where}~\tilde{z}^{(t,l)} = \mu ^{(t)}& + \sigma ^{(t)} \odot \epsilon ^{(l)}~\text{and}~\epsilon ^{(l)}\sim \mathcal {N}(0,\mathbf {I}) $$   (Eq. 24)
$L$ is the number of samples. The first term is the $\text{KL}$ divergence of two Gaussian distributions which can be computed and differentiated without estimation. Maximizing this objective will minimize the difference between the approximate posterior and prior, thus making the setting $\tilde{z}=\mu ^{\prime }$ during testing reasonable. The second term is the approximate expectation of $\mathbb {E}_{q_\phi (\mathbf {z}|\mathbf {x}, \mathbf {y})}[\log p_\theta (\mathbf {x},\mathbf {y}|\mathbf {z})]$ , which is also differentiable.
As the objective function in Eq. ( 24 ) is differentiable, we can optimize both the model parameters $\theta $ and variational parameters $\phi $ jointly using standard gradient ascent techniques. The training procedure for VarNDRR is summarized in Algorithm "Parameter Learning" .
[t] Parameter Learning Algorithm of VarNDRR. Inputs: $A$ , the maximum number of iterations; $M$ , the number of instances in one batch; $L$ , the number of samples; $\theta ,\phi $ $\leftarrow $ Initialize parameters $\mathcal {D}$ $\leftarrow $ getRandomMiniBatch(M) $\epsilon $ $\leftarrow $ getRandomNoiseFromStandardGaussian() $g$ $M$0 $M$1 $M$2 $M$3 parameterUpdater( $M$4 ) convergence of parameters $M$5 or reach the maximum iteration $M$6
Experiments
We conducted experiments on English implicit DRR task to validate the effectiveness of VarNDRR.
Dataset
We used the largest hand-annotated discourse corpus PDTB 2.0 BIBREF12 (PDTB hereafter). This corpus contains discourse annotations over 2,312 Wall Street Journal articles, and is organized in different sections. Following previous work BIBREF6 , BIBREF13 , BIBREF14 , BIBREF9 , we used sections 2-20 as our training set, sections 21-22 as the test set. Sections 0-1 were used as the development set for hyperparameter optimization.
In PDTB, discourse relations are annotated in a predicate-argument view. Each discourse connective is treated as a predicate that takes two text spans as its arguments. The discourse relation tags in PDTB are arranged in a three-level hierarchy, where the top level consists of four major semantic classes: Temporal (Tem), Contingency (Con), Expansion (Exp) and Comparison (Com). Because the top-level relations are general enough to be annotated with a high inter-annotator agreement and are common to most theories of discourse, in our experiments we only use this level of annotations.
We formulated the task as four separate one-against-all binary classification problems: each top level class vs. the other three discourse relation classes. We also balanced the training set by resampling training instances in each class until the number of positive and negative instances are equal. In contrast, all instances in the test and development set are kept in nature. The statistics of various data sets is listed in Table 1 .
Setup
We tokenized all datasets using Stanford NLP Toolkit. For optimization, we employed the Adam algorithm BIBREF15 to update parameters. With respect to the hyperparameters $M,L,A$ and the dimensionality of all vector representations, we set them according to previous work BIBREF10 , BIBREF11 and preliminary experiments on the development set. Finally, we set $M=16,A=1000,L=1,d_z=20,d_{x_1}=d_{x_2}=10001,d_{h_1}=d_{h_2}=d_{h_1^\prime }=d_{h_2^\prime }=d_m=d_{h_y}=400,d_y=2$ for all experiments.. All parameters of VarNDRR are initialized by a Gaussian distribution ( $\mu =0, \sigma =0.01$ ). For Adam, we set $\beta _1=0.9$ , $\beta _2=0.999$ with a learning rate $0.001$ . Additionally, we tied the following parameters in practice: $W_{h_1}$ and $W_{h_2}$ , $M=16,A=1000,L=1,d_z=20,d_{x_1}=d_{x_2}=10001,d_{h_1}=d_{h_2}=d_{h_1^\prime }=d_{h_2^\prime }=d_m=d_{h_y}=400,d_y=2$0 and $M=16,A=1000,L=1,d_z=20,d_{x_1}=d_{x_2}=10001,d_{h_1}=d_{h_2}=d_{h_1^\prime }=d_{h_2^\prime }=d_m=d_{h_y}=400,d_y=2$1 .
We compared VarNDRR against the following two different baseline methods:
SVM: a support vector machine (SVM) classifier trained with several manual features.
SCNN: a shallow convolutional neural network proposed by Zhang et al. biaozhang:2015:emnlp:drr.
We also provide results from two state-of-the-art systems:
Rutherford and Xue rutherford-xue:2015:NAACL-HLT convert explicit discourse relations into implicit instances.
Ji and Eisenstein TACL536 augment discourse representations via entity connections.
Features used in SVM are taken from the state-of-the-art implicit discourse relation recognition model, including Bag of Words, Cross-Argument Word Pairs, Polarity, First-Last, First3, Production Rules, Dependency Rules and Brown cluster pair BIBREF16 . In order to collect bag of words, production rules, dependency rules, and cross-argument word pairs, we used a frequency cutoff of 5 to remove rare features, following Lin et al. lin2009recognizing.
Classification Results
Because the development and test sets are imbalanced in terms of the ratio of positive and negative instances, we chose the widely-used F1 score as our major evaluation metric. In addition, we also provide the precision, recall and accuracy for further analysis. Table 2 summarizes the classification results.
From Table 2 , we observe that the proposed VarNDRR outperforms SVM on Com/Exp/Tem and SCNN on Exp/Com according to their F1 scores. Although it fails on Con, VarNDRR achieves the best result on EXP/Com among these three models. Overall, VarNDRR is competitive in comparison with these two baselines. With respect to the accuracy, our model does not yield substantial improvements over the two baselines. This may be because that we used the F1 score rather than the accuracy, as our selection criterion on the development set. With respect to the precision and recall, our model tends to produce relatively lower precisions but higher recalls. This suggests that the improvements of VarNDRR in terms of F1 scores mostly benefits from the recall values.
Comparing with the state-of-the-art results of previous work BIBREF8 , BIBREF17 , VarNDRR achieves comparable results in term of the F1 scores. Specifically, VarNDRR outperforms Rutherford and Xue rutherford-xue:2015:NAACL-HLT on EXP, and Ji and Eisenstein TACL536 on TEM. However, the accuracy of our model fails to surpass these models. We argue that this is because both baselines use many manual features designed with prior human knowledge, but our model is purely neural-based.
Additionally, we find that the performance of our model is proportional to the number of training instances. This suggests that collecting more training instances (in spite of the noises) may be beneficial to our model.
Variational Lower Bound Analysis
In addition to the classification performance, the efficiency in learning and inference is another concern for variational methods. Figure 4 shows the training procedure for four tasks in terms of the variational lower bound on the training set. We also provide F1 scores on the development set to investigate the relations between the variational lower bound and recognition performance.
We find that our model converges toward the variational lower bound considerably fast in all experiments (within 100 epochs), which resonates with the previous findings BIBREF10 , BIBREF11 . However, the change trend of the F1 score does not follow that of the lower bound which takes more time to converge. Particularly to the four discourse relations, we further observe that the change paths of the F1 score are completely different. This may suggest that the four discourse relations have different properties and distributions.
In particular, the number of epochs when the best F1 score reaches is also different for the four discourse relations. This indicates that dividing the implicit DRR into four different tasks according to the type of discourse relations is reasonable and better than performing DRR on the mixtures of the four relations.
Related Work
There are two lines of research related to our work: implicit discourse relation recognition and variational neural model, which we describe in succession.
Implicit Discourse Relation Recognition Due to the release of Penn Discourse Treebank BIBREF12 corpus, constantly increasing efforts are made for implicit DRR. Upon this corpus, Pilter et al. pitler-louis-nenkova:2009:ACLIJCNLP exploit several linguistically informed features, such as polarity tags, modality and lexical features. Lin et al. lin2009recognizing further incorporate context words, word pairs as well as discourse parse information into their classifier. Following this direction, several more powerful features have been exploited: entities BIBREF18 , word embeddings BIBREF19 , Brown cluster pairs and co-reference patterns BIBREF16 . With these features, Park and Cardie park2012implicit perform feature set optimization for better feature combination.
Different from feature engineering, predicting discourse connectives can indirectly help the relation classification BIBREF13 , BIBREF20 . In addition, selecting explicit discourse instances that are similar to the implicit ones can enrich the training corpus for implicit DRR and gains improvement BIBREF21 , BIBREF14 , BIBREF22 , BIBREF23 , BIBREF17 . Very recently, neural network models have been also used for implicit DRR due to its capability for representation learning BIBREF8 , BIBREF9 .
Despite their successes, most of them focus on the discriminative models, leaving the field of generative models for implicit DRR a relatively uninvestigated area. In this respect, the most related work to ours is the latent variable recurrent neural network recently proposed by Ji et al. ji-haffari-eisenstein:2016:N16-1. However, our work differs from theirs significantly, which can be summarized in the following three aspects: 1) they employ the recurrent neural network to represent the discourse arguments, while we use the simple feed-forward neural network; 2) they treat the discourse relations directly as latent variables, rather than the underlying semantic representation of discourses; 3) their model is optimized in terms of the data likelihood, since the discourse relations are observed during training. However, VarNDRR is optimized under the variational theory.
Variational Neural Model In the presence of continuous latent variables with intractable posterior distributions, efficient inference and learning in directed probabilistic models is required. Kingma and Welling kingma2014autoencoding as well as Rezende et al. DBLP:conf/icml/RezendeMW14 introduce variational neural networks that employ an approximate inference model for intractable posterior and reparameterized variational lower bound for stochastic gradient optimization. Kingma et al. DBLP:conf/nips/KingmaMRW14 revisit the approach to semi-supervised learning with generative models and further develop new models that allow effective generalization from a small labeled dataset to a large unlabeled dataset. Chung et al. DBLP:journals/corr/ChungKDGCB15 incorporate latent variables into the hidden state of a recurrent neural network, while Gregor et al. DBLP:journals/corr/GregorDGW15 combine a novel spatial attention mechanism that mimics the foveation of human eyes, with a sequential variational auto-encoding framework that allows the iterative construction of complex images.
We follow the spirit of these variational models, but focus on the adaptation and utilization of them onto implicit DRR, which, to the best of our knowledge, is the first attempt in this respect.
Conclusion and Future Work
In this paper, we have presented a variational neural discourse relation recognizer for implicit DRR. Different from conventional discriminative models that directly calculate the conditional probability of the relation $\mathbf {y}$ given discourse arguments $\mathbf {x}$ , our model assumes that it is a latent variable from an underlying semantic space that generates both $\mathbf {x}$ and $\mathbf {y}$ . In order to make the inference and learning efficient, we introduce a neural discourse recognizer and two neural latent approximators as our generative and inference model respectively. Using the reparameterization technique, we are able to optimize the whole model via standard stochastic gradient ascent algorithm. Experiment results in terms of classification and variational lower bound verify the effectiveness of our model.
In the future, we would like to exploit the utilization of discourse instances with explicit relations for implicit DRR. For this we can start from two directions: 1) converting explicit instances into pseudo implicit instances and retraining our model; 2) developing a semi-supervised model to leverage semantic information inside discourse arguments. Furthermore, we are also interested in adapting our model to other similar tasks, such as nature language inference.
Acknowledgments
The authors were supported by National Natural Science Foundation of China (Grant Nos 61303082, 61672440, 61402388, 61622209 and 61403269), Natural Science Foundation of Fujian Province (Grant No. 2016J05161), Natural Science Foundation of Jiangsu Province (Grant No. BK20140355), Research fund of the Provincial Key Laboratory for Computer Information Processing Technology in Soochow University (Grant No. KJS1520), and Research fund of the Key Laboratory for Intelligence Information Processing in the Institute of Computing Technology of the Chinese Academy of Sciences (Grant No. IIP2015-4). We also thank the anonymous reviewers for their insightful comments.

Question: What datasets are used?
Answer: PDTB 2.0

PDTB 2.0 

PDTB 2.0