L EARNING G ENERAL P URPOSE D ISTRIBUTED S ENTENCE R EPRESENTATIONS VIA L ARGE S CALE M ULTITASK L EARNING
Anonymous authors
Paper under double-blind review
A BSTRACT
A lot of the recent success in natural language processing (NLP) has been driven by distributed vector representations of words trained on large amounts of text in an unsupervised manner.
These representations are typically used as general purpose features for words across a range of NLP problems.
However, extending this success to learning representations of sequences of words, such as sentences, remains an open problem.
Recent work has explored unsupervised as well as supervised learning techniques with different training objectives to learn general purpose ﬁxed-length sentence representations.
In this work, we present a simple, effective multi-task learning framework for sentence representations that combines the inductive biases of diverse training objectives in a single model.
We train this model on several data sources with multiple training objectives on over 100 million sentences.
Extensive experiments demonstrate that sharing a single recurrent sentence encoder across weakly related tasks leads to consistent improvements over previous methods.
We present substantial improvements in the context of transfer learning and low-resource settings using our learned general-purpose representations.
I NTRODUCTION
Transfer learning has driven a number of recent successes in computer vision and NLP.
Computer vision tasks like image captioning (Xu et al., 2015) and visual question answering typically use CNNs pretrained on ImageNet (Krizhevsky et al., 2012; Simonyan & Zisserman, 2014) to extract representations of the image, while several natural language tasks such as reading comprehension and sequence labeling (Lample et al., 2016) have beneﬁted from pretrained word embeddings (Mikolov et al., 2013; Pennington et al., 2014) that are either ﬁne-tuned for a speciﬁc task or held ﬁxed.
Many neural NLP systems are initialized with pretrained word embeddings but learn their representations of words in context from scratch, in a task-speciﬁc manner from supervised learning signals.
However, learning these representations reliably from scratch is not always feasible, especially in low-resource settings, where we believe that using general purpose sentence representations will be beneﬁcial.
Some recent work has addressed this by learning general-purpose sentence representations (Kiros et al., 2015; Wieting et al., 2015;
Hill et al., 2016; Conneau et al., 2017; McCann et al., 2017; Jernite et al., 2017; Nie et al., 2017; Pagliardini et al., 2017).
However, there exists no clear consensus yet on what training objective or methodology is best suited to this goal.
Understanding the inductive biases of distinct neural models is important for guiding progress in representation learning.
Shi et al.
and Belinkov et al.
(2017) demonstrate that neural machine translation (NMT) systems appear to capture morphology and some syntactic properties.
Shi et al.
(2016) also present evidence that sequence-to-sequence parsers (Vinyals et al., 2015) more strongly encode source language syntax.
Similarly, Adi et al.
(2016) probe representations extracted by sequence autoencoders, word embedding averages, and skip-thought vectors with a multi-layer perceptron (MLP) classiﬁer to study whether sentence characteristics such as length, word content and word order are encoded.
To generalize across a diverse set of tasks, it is important to build representations that encode several aspects of a sentence.
Neural approaches to tasks such as skip-thoughts, machine translation, natural language inference, and constituency parsing likely have different inductive biases.
Our work exploits this in the context of a simple one-to-many multi-task learning (MTL) framework, wherein a single recurrent sentence encoder is shared across multiple tasks.
We hypothesize that sentence representations learned by training on a reasonably large number of weakly related tasks will generalize better to novel tasks unseen during training, since this process encodes the inductive biases of multiple models.
This hypothesis is based on the theoretical work of Baxter et al.
While our work aims at learning ﬁxed-length distributed sentence representations, it is not always practical to assume that the entire “meaning” of a sentence can be encoded into a ﬁxed-length vector.
We merely hope to capture some of its characteristics that could be of use in a variety of tasks.
The primary contribution of our work is to combine the beneﬁts of diverse sentence-representation learning objectives into a single multi-task framework.
To the best of our knowledge, this is the ﬁrst large-scale reusable sentence representation model obtained by combining a set of training objectives with the level of diversity explored here, i.e. multi-lingual NMT, natural language inference, constituency parsing and skip-thought vectors.
We demonstrate through extensive experimentation that representations learned in this way lead to improved performance across a diverse set of novel tasks not used in the learning of our representations.
Such representations facilitate low-resource learning as exhibited by signiﬁcant improvements to model performance for new tasks in the low labelled data regime - achieving comparable performance to a few models trained from scratch using only 6% of the available training set on the Quora duplicate question dataset.
R ELATED W ORK
The problem of learning distributed representations of phrases and sentences dates back over a decade.
For example, Mitchell & Lapata (2008) present an additive and multiplicative linear composition function of the distributed representations of individual words.
Clark & Pulman (2007) combine symbolic and distributed representations of words using tensor products.
Advances in learning better distributed representations of words (Mikolov et al., 2013; Pennington et al., 2014) combined with deep learning have made it possible to learn complex non-linear composition functions of an arbitrary number of word embeddings using convolutional or recurrent neural networks (RNNs).
A network’s representation of the last element in a sequence, which is a non-linear composition of all inputs, is typically assumed to contain a squashed “summary” of the sentence.
Most work in supervised learning for NLP builds task-speciﬁc representations of sentences rather than general-purpose ones.
Notably, skip-thought vectors (Kiros et al., 2015), an extension of the skip-gram model for word embeddings (Mikolov et al., 2013) to sentences, learn re-usable sentence representations from weakly labeled data.
Unfortunately, these models take weeks or often months to train.
Hill et al.
(2016) address this by considering faster alternatives such as sequential denoising autoencoders and shallow log-linear models.
Arora et al.
(2016), however, demonstrate that simple word embedding averages are comparable to more complicated models like skip-thoughts.
More recently, Conneau et al.
(2017) show that a completely supervised approach to learning sentence representations from natural language inference data outperforms all previous approaches on transfer learning benchmarks.
Here we use the terms “transfer learning performance” on “transfer tasks” to mean the performance of sentence representations evaluated on tasks unseen during training.
McCann et al.
(2017) demonstrated that representations learned by state-of-the-art large-scale NMT systems also generalize well to other tasks.
However, their use of an attention mechanism prevents the learning of a single ﬁxedlength vector representation of a sentence.
As a result, they present a bi-attentive classiﬁcation network that composes information present in all of the model’s hidden states to achieve improvements over a corresponding model trained from scratch.
Jernite et al.
(2017) and Nie et al.
(2017) demonstrate that discourse-based objectives can also be leveraged to learn good sentence representations.
Our work is most similar to that of Luong et al.
(2015), who train a many-to-many sequenceto-sequence model on a diverse set of weakly related tasks that includes machine translation, constituency parsing, image captioning, sequence autoencoding, and intra-sentence skip-thoughts.
There are two key differences between that work and our own.
First, like McCann et al.
(2017), their use of an attention mechanism prevents learning a ﬁxed-length vector representation for a sentence.
Second, their work aims for improvements on the same tasks on which the model is trained, as opposed to learning re-usable sentence representations that transfer elsewhere.
We further present a ﬁne-grained analysis of how different tasks contribute to the encoding of different information signals in our representations following work by Shi et al.
(2016) and Adi et al.
Hashimoto et al.
(2016) similarly present a multi-task framework for textual entailment with task supervision at different levels of learning.
“Universal” multi-task models have also been successfully explored in the context of computer vision problems (Kokkinos, 2016; Eigen & Fergus, 2015).
S EQUENCE - TO -S EQUENCE L EARNING
Five out of the six tasks that we consider for multi-task learning are formulated as sequence-tosequence problems (Cho et al., 2014; Sutskever et al., 2014).
Brieﬂy, sequence-to-sequence models are a speciﬁc case of encoder-decoder models where the inputs and outputs are sequential.
They directly model the conditional distribution of outputs given inputs P ( y | x ) .
The input x and output y are sequences x 1 , x 2 , . .
, x m and y 1 , y 2 . . .
, y n .
The encoder produces a ﬁxed length vector representation h x of the input, which the decoder then conditions on to generate an output.
The decoder is auto-regressive and breaks down the joint probability of outputs into a product of conditional probabilities via the chain rule:
[Equation]
Cho et al.
(2014) and Sutskever et al.
(2014) use encoders and decoders parameterized as RNN variants such as Long Short-term Memory (LSTMs) (Hochreiter & Schmidhuber, 1997) or Gated
Recurrent Units (GRUs) (Chung et al., 2014).
The hidden representation h x is typically the last hidden state of the encoder RNN.
Bahdanau et al.
(2014) alleviate the gradient bottleneck between the encoder and the decoder by introducing an attention mechanism that allows the decoder to condition on every hidden state of the encoder RNN instead of only the last one.
In this work, as in Kiros et al. (2015); Hill et al.
(2016), we do not employ an attention mechanism.
This enables us to obtain a single, ﬁxed-length, distributed sentence representation.
To diminish the effects of vanishing gradient, we condition every decoding step on the encoder hidden representation h x .
We use a GRU for the encoder and decoder in the interest of computational speed.
The encoder is a bidirectional GRU while the decoder is a unidirectional conditional GRU whose parameterization is as follows:
[Equation]
The encoder representation h x is provided as conditioning information to the reset gate, update gate and hidden state computation in the GRU via the parameters C r , C z and C d to avoid attenuation of information from the encoder.
3. M ULTI - TASK S EQUENCE - TO - SEQUENCE L EARNING
Dong et al.
(2015) present a simple one-to-many multi-task sequence-to-sequence learning model for
NMT that uses a shared encoder for English and task-speciﬁc decoders for multiple target languages.
Luong et al.
(2015) extend this by also considering many-to-one (many encoders, one decoder) and many-to-many architectures.
In this work, we consider a one-to-many model since it lends itself naturally to the idea of combining inductive biases from different training objectives.
The same bidirectional GRU encodes the input sentences from different tasks into a compressed summary h x which is then used to condition a task-speciﬁc GRU to produce the output sentence.
T RAINING O BJECTIVES & E VALUATION
Our motivation for multi-task training stems from theoretical insights presented in Baxter et al.
We refer readers to that work for a detailed discussion of results, but the conclusions most relevant to this discussion are (i) that learning multiple related tasks jointly results in good generalization as measured by the number of training examples required per task; and (ii) that inductive biases learned on sufﬁciently many training tasks are likely to be good for learning novel tasks drawn from the same environment.
We select the following training objectives to learn general-purpose sentence embeddings.
Our desiderata for the task collection were: sufﬁcient diversity, existence of fairly large datasets for training, and success as standalone training objectives for sentence representations.
Skip-thought vectors Skip-thought vectors (Kiros et al., 2015) are an extension of skip-gram word embedding models to sentences.
The task typically requires a corpus of contiguous sentences, for which we use the BookCorpus (Zhu et al., 2015).
The learning objective is to simultaneously predict the next and previous sentences from the current sentence.
The encoder for the current sentence and the decoders for the previous (STP) and next sentence (STN) are typically parameterized as separate RNNs.
We also consider training skip-thoughts by predicting only the next sentence given the current, motivated by results in Tang et al.
(2017) where it is demonstrated that predicting the next sentence alone leads to comparable performance.
Neural Machine Translation Sutskever et al.
(2014) and Cho et al.
(2014) demonstrated that
NMT can be formulated as a sequence-to-sequence learning problem where the input is a sentence in the source language and the output is its corresponding translation in the target language.
We use a parallel corpus of around 4.5 million English-German (De) sentence pairs from WMT15 and 40 million English-French (Fr) sentence pairs from WMT14.
We train our representations using multiple target languages motivated by improvements demonstrated by Dong et al.
Constituency Parsing (linearized parse tree construction)
Vinyals et al.
(2015) demonstrated that a sequence-to-sequence approach to constituency parsing is viable.
The input to the encoder is the sentence itself and the decoder produces its linearized parse tree.
We train on 3 million weakly labeled parses obtained by parsing a random subset of the 1-billion word corpus with the Puck GPU parser 1 along with gold parses from sections 0-21 of the WSJ section of Penn Treebank.
Gold parses are duplicated 5 times and shufﬂed in with the weakly labeled parses to have a roughly 1:5 ratio of gold to noisy parses.
Natural Language Inference Natural language inference (NLI) is a 3-way classiﬁcation problem.
Given a premise and a hypothesis sentence, the objective is to classify their relationship as either entailment, contradiction, or neutral.
In contrast to the previous tasks, we do not formulate this as sequence-to-sequence learning.
We use the shared recurrent sentence encoder to encode both the premise and hypothesis into ﬁxed length vectors u and v , respectively.
We then feed the vector [ u ; v ; | u − v | ; u ∗ v ] , which is a concatenation of the premise and hypothesis vectors and their respective absolute difference and hadamard product, to an MLP that performs the 3-way classiﬁcation.
This is the same classiﬁcation strategy adopted by Conneau et al.
We train on a collection of about 1 million sentence pairs from the SNLI (Bowman et al., 2015) and MultiNLI
(Williams et al., 2017) corpora.
1 presents
4. M ULTI - TASK TRAINING SETUP
Multi-task training with different data sources for each task stills poses open questions.
For example:
When does one switch to training on a different task?
Should the switching be periodic?
Do we weight each task equally?
If not, what training ratios do we use?
Dong et al.
(2015) use periodic task alternations with equal training ratios for every task.
In contrast,
Luong et al.
(2015) alter the training ratios for each task based on the size of their respective training
[Table]
sets.
Speciﬁcally, the training ratio for a particular task, α i , is the fraction of the number of training examples in that task to the total number of training samples across all tasks.
The authors then perform α i ∗ N parameter updates on task i before selecting a new task at random proportional to the training ratios, where N is a predetermined constant.
We take a simpler approach and pick a new sequence-to-sequence task to train on after every parameter update sampled uniformly.
An NLI minibatch is interspersed after every ten parameter updates on sequence-to-sequence tasks (this was chosen so as to complete roughly 6 epochs of the dataset after 7 days of training).
Our approach is described formally in the Algorithm below.
Model details can be found in section 7 in the Appendix.
Require: A set of k tasks
[Table]
a common
[Table]
language
[Table]
a
[Table]
encoder
[Table]
across all
[Table]
and a set
[Table]
speciﬁc decoders
[Table] [Table]
k .
Let θ denote each model’s parameters, α a probability vector ( p 1 . . .
p
[Table]
denoting the probability of sampling a task such that Σ
[Table]
datasets for each task IP 1 . . .
IP k and a loss function L .
while θ has not converged do
1: Sample task i ∼ Cat ( k, α ) .
2: Sample input, output pairs x , y ∼ IP i .
3: Input representation h x ← E θ ( x ) .
Prediction ˜y ← D i θ ( h x ) 5: θ ← Adam ( ∇ θ L ( y , ˜y )) .
end details are presented in the Appendix.
E VALUATION S TRATEGIES , E XPERIMENTAL R ESULTS & D ISCUSSION
In this section, we describe our approach to evaluate the quality of our learned representations, present the results of our evaluation and discuss our ﬁndings.
5. E VALUATION S TRATEGY
We follow a similar evaluation protocol to those presented in Kiros et al.
; Hill et al.
Conneau et al.
(2017) which is to use our learned representations as features for a low complexity classiﬁer (typically linear) on a novel supervised task/domain unseen during training without updating the parameters of our sentence representation model .
We also consider such a transfer learning evaluation in an artiﬁcially constructed low-resource setting.
In addition, we also evaluate the quality of our learned individual word representations using standard benchmarks (Faruqui &
Dyer, 2014; Tsvetkov et al., 2015)
[Table]
The choice of transfer tasks and evaluation framework 2 are borrowed largely from Conneau et al.
We provide a condensed summary of the tasks in section 10 in the Appendix but refer readers to their paper for a more detailed description.
[Table]
[Table]
[Table]
al
[Table]
the next 4 are from Tomar et al. (2017), the next 5 from Shen et al. and The last 4 rows are our experiments using Infersent (Conneau et al., 2017) and our models.
5. E XPERIMENTAL R ESULTS & D ISCUSSION
Table 2 presents the results of training logistic regression on 10 different supervised transfer tasks using different ﬁxed-length sentence representation.
Supervised approaches trained from scratch on some of these tasks are also presented for comparison.
We present performance ablations when adding more tasks and increasing the number of hidden units in our GRU (+L).
Ablation speciﬁcs are presented in section 9 of the Appendix.
It is evident from Table 2 that adding more tasks improves the transfer performance of our model.
Increasing the capacity our sentence encoder with more hidden units (+L) as well as an additional
[Table]
layer (+2L) also lead to improved transfer performance.
We observe gains of 1.1-2.3% on the sentiment classiﬁcation tasks (MR, CR, SUBJ & MPQA) over Infersent and smaller improvement of 0.5% on SST.
We demonstrate substantial gains on TREC (6% over Infersent and roughly 2% over the CNN-LSTM), outperforming even a competitive supervised baseline.
We see similar gains (2.3%) on paraphrase identiﬁcation (MPRC), closing the gap on supervised approaches trained from scratch.
The addition of constituency parsing improves performance on sentence relatedness (SICKR) and entailment (SICK-E) consistent with observations made by Bowman et al.
In Table
[Table]
we show that simply training an MLP on top of our ﬁxed sentence representations outperforms several strong & complex supervised approaches that use attention mechanisms, even on this fairly large dataset.
For example, we observe a 0.2-0.5% improvement over the decomposable attention model (Parikh et al., 2016).
When using only a small fraction of the training data, indicated by the columns 1k-25k, we are able to outperform the Siamese and Multi-Perspective CNN using roughly 6% of the available training set.
We also outperform the Deconv LVM model proposed by
Shen et al.
(2017) in this low-resource setting.
Unlike Conneau et al.
(2017), who use pretrained GloVe word embeddings, we learn our word embeddings from scratch.
Somewhat surprisingly, in Table 3 we observe that the learned word embeddings are competitive with popular methods such as GloVe, word2vec, and fasttext (Bojanowski et al., 2016) on the benchmarks presented by Faruqui & Dyer (2014) and Tsvetkov et al.
In Table 5, we probe our sentence representations to determine if certain sentence characteristics and syntactic properties can be inferred following work by Adi et al.
(2016) and Shi et al.
We observe that syntactic properties are better encoded with the addition of multi-lingual NMT and parsing.
Representations learned solely from NLI do appear to encode syntax but incorporation into our multi-task framework does not amplify this signal.
Similarly, we observe that sentence characteristics such as length and word order are better encoded with the addition of parsing.
In Appendix Table 6, we note that our sentence representations outperform skip-thoughts and are on par with Infersent for image-caption retrieval.
We also observe that comparing sentences using cosine similarities correlates reasonably well with their relatedness on semantic textual similarity benchmarks (Appendix Table 7).
We also present qualitative analysis of our learned representations by visualizations using dimensionality reduction techniques (Figure 1) and nearest neighbor exploration (Appendix Table 8).
Figure 1 shows t-sne plots of our sentence representations on three different datasets - SUBJ, TREC and DBpedia.
DBpedia is a large corpus of sentences from Wikipedia labeled by category and used by Zhang et al.
Sentences appear to cluster reasonably well according to their labels.
The clustering also appears better than that demonstrated in Figure 2 of Kiros et al.
(2015) on TREC and SUBJ.
Appendix Table 8 contains sentences from the BookCorpus and their nearest neighbors.
Sentences with some lexical overlap and similar discourse structure appear to be clustered together.
C ONCLUSION & F UTURE W ORK
We present a multi-task framework for learning general-purpose ﬁxed-length sentence representations.
Our primary motivation is to encapsulate the inductive biases of several diverse training signals used to learn sentence representations into a single model.
Our multi-task framework includes a combination of sequence-to-sequence tasks such as multi-lingual NMT, constituency parsing and skip-thought vectors as well as a classiﬁcation task - natural language inference.
We demonstrate that the learned representations yield competitive or superior results to previous general-purpose sentence representation methods.
We also observe that this approach produces good word embeddings.
In future work, we would like understand and interpret the inductive biases that our model learns and observe how it changes with the addition of different tasks beyond just our simple analysis of sentence characteristics and syntax.
Having a rich, continuous sentence representation space could allow the application of state-of-the-art generative models of images such as that of Nguyen et al.
(2016) to language.
One could also consider controllable text generation by directly manipulating the sentence representations and realizing it by decoding with a conditional language model.
A PPENDIX M ODEL T RAINING
We present some architectural speciﬁcs and training details of our multi-task framework.
Our shared encoder uses a common word embedding lookup table and GRU.
We experiment with unidirectional, bidirectional and 2 layer bidirectional GRUs (details in Appendix section 9).
For each task, every decoder has its separate word embedding lookups, conditional GRUs and fully connected layers that project the GRU hidden states to the target vocabularies.
The last hidden state of the encoder is used as the initial hidden state of the decoder and is also presented as input to all the gates of the GRU at every time step.
For natural language inference, the same encoder is used to encode both the premise and hypothesis and a concatenation of their representations along with the absolute difference and hadamard product (as described in Conneau et al.
(2017)) are given to a single layer MLP with a dropout (Srivastava et al., 2014) rate of 0.3.
All models use word embeddings of 512 dimensions and GRUs with either 1500 or 2048 hidden units.
We used minibatches of 48 examples and the
Adam Kingma & Ba (2014) optimizer with a learning rate of 0.002.
Models were trained for 7 days on an Nvidia Tesla P100-SXM2-16GB GPU.
While Kiros et al.
(2015) report close to a month of training, we only train for 7 days, made possible by advancements in GPU hardware and software (cuDNN RNNs).
We did not tune any of the architectural details and hyperparameters owing to the fact that we were unable to identify any clear criterion on which to tune them.
Gains in performance on a speciﬁc task do not often translate to better transfer performance.
V OCABULARY E XPANSION & R EPRESENTATION P OOLING
In addition to performing 10-fold cross-validation to determine the L2 regularization penalty on the logistic regression models, we also tune the way in which our sentence representations are generated from the hidden states corresponding to words in a sentence.
For example, Kiros et al.
(2015) use the last hidden state while Conneau et al.
(2017) perform max-pooling across all of the hidden states.
We consider both of these approaches and pick the one with better performance on the validation set.
We note that max-pooling works best on sentiment tasks such as MR, CR, SUBJ and MPQA, while the last hidden state works better on all other tasks.
We also employ vocabulary expansion on all tasks as in Kiros et al.
by training a linear regression to map from the space of pre-trained word embeddings (GloVe) to our model’s word embeddings.
M ULTI - TASK MODEL DETAILS
This section describes the speciﬁcs our multi-task ablations in the experiments section.
These definitions hold for all tables except for 3 and 5.
We refer to skip-thought next as STN, French and
German NMT as Fr and De, natural language inference as NLI, skip-thought previous as STP and parsing as Par.
+STN +Fr +De
The sentence representation h x is the concatenation of the ﬁnal hidden vectors from a forward GRU with 1500-dimensional hidden vectors and a bidirectional GRU, also with 1500-dimensional hidden vectors.
+STN +Fr +De +NLI : The sentence representation h x is the concatenation of the ﬁnal hidden vectors from a bidirectional GRU with 1500-dimensional hidden vectors and another bidirectional
GRU with 1500-dimensional hidden vectors trained without NLI.
+STN +Fr +De +NLI +L : The sentence representation h x is the concatenation of the ﬁnal hidden vectors from a bidirectional GRU with 2048-dimensional hidden vectors and another bidirectional
GRU with 2048-dimensional hidden vectors trained without NLI.
+STN +Fr +De +NLI +L +STP :
The sentence representation h x is the concatenation of the ﬁnal hidden vectors from a bidirectional GRU with 2048-dimensional hidden vectors and another bidirectional GRU with 2048-dimensional hidden vectors trained without STP.
+STN +Fr +De +NLI
+2L +STP :
The sentence representation h x is the concatenation of the ﬁnal hidden vectors from a 2-layer bidirectional GRU with 2048-dimensional hidden vectors and a 1-layer bidirectional GRU with 2048-dimensional hidden vectors trained without STP.
+STN +Fr +De +NLI +L +STP +Par : The sentence representation h x is the concatenation of the ﬁnal hidden vectors from a bidirectional GRU with 2048-dimensional hidden vectors and another bidirectional GRU with 2048-dimensional hidden vectors trained without Par.
In tables 3 and 5 we do not concatenate the representations of multiple models.
D ESCRIPTION OF EVALUATION TASKS
Kiros et al.
and Conneau et al.
(2017) provide a detailed description of tasks that are typically used to evaluate sentence representations.
We provide a condensed summary and refer readers to their work for a more thorough description.
10. T EXT C LASSIFICATION
We evaluate on text classiﬁcation benchmarks - sentiment classiﬁcation on movie reviews (MR), product reviews (CR) and Stanford sentiment (SST), question type classiﬁcation (TREC), subjectivity/objectivity classiﬁcation (SUBJ) and opinion polarity (MPQA).
Representations are used to train a logistic regression classiﬁer with 10-fold cross validation to tune the L2 weight penalty.
The evaluation metric for all these tasks is classiﬁcation accuracy.
10. P ARAPHRASE I DENTIFICATION
We also evaluate on pairwise text classiﬁcation tasks such as paraphrase identiﬁcation on the Microsoft Research Paraphrase Corpus (MRPC) corpus.
This is a binary classiﬁcation problem to identify if two sentences are paraphrases of each other.
The evaluation metric is classiﬁcation accuracy and F1.
10. E NTAILMENT AND S EMANTIC R ELATEDNESS
To test if similar sentences share similar representations, we evaluate on the SICK relatedness (SICK-R) task where a linear model is trained to output a score from 1 to 5 indicating the relatedness of two sentences.
We also evaluate using the entailment labels in the same dataset (SICK-E) which is a binary classiﬁcation problem.
The evaluation metric for SICK-R is Pearson correlation and classiﬁcation accuracy for SICK-E.
10. S EMANTIC T EXTUAL S IMILARITY
In this evaluation, we measure the relatedness of two sentences using only the cosine similarity between their representations.
We use the similarity textual similarity (STS) benchmark tasks from 2012-2016 (STS12, STS13, STS14, STS15, STS16, STSB).
The STS dataset contains sentences from a diverse set of data sources.
The evaluation criteria is Pearson correlation.
10. I MAGE - CAPTION RETRIEVAL
Image-caption retrieval is typically formulated as a ranking task wherein images are retrieved and ranked based on a textual description and vice-versa.
We use 113k training images from MSCOCO with 5k images for validation and 5k for testing.
Image features are extracted using a pre-trained 110 layer ResNet.
The evaluation criterion is Recall@K and the median K across 5 different splits of the data.
10. Q UORA D UPLICATE Q UESTION C LASSIFICATION
In addition to the above tasks which were considered by Conneau et al. (2017), we also evaluate on the recently published Quora duplicate question dataset 5 since it is an order of magnitude larger than the others (approximately 400,000 question pairs).
The task is to correctly identify question pairs that are duplicates of one another, which we formulate as a binary classiﬁcation problem.
We use the same data splits as in Wang et al.
Given the size of this data, we consider a more expressive classiﬁer on top of the representations of both questions.
Speciﬁcally, we train a 4 layer
MLP with 1024 hidden units, with a dropout rate of 0.5 after every hidden layer.
The evaluation criterion is classiﬁcation accuracy.
We also artiﬁcially create a low-resource setting by reducing the number of training examples between 1,000 and 25,000 using the same splits as Shen et al.
10. S ENTENCE C HARACTERISTICS & S YNTAX
In an attempt to understand what information is encoded in by sentence representations, we consider six different classiﬁcation tasks where the objective is to predict sentence characteristics such as length, word content and word order (Adi et al., 2016) or syntactic properties such as active/passive, tense and the top syntactic sequence (TSS) from the parse tree of a sentence (Shi et al., 2016).
The sentence characteristic tasks are setup in the same way as described in Adi et al.
The length task is an 8-way classiﬁcation problem where sentence lengths are binned into 8 ranges.
The content task is formulated as a binary classiﬁcation problem that takes a concatenation of a sentence representation u ∈ R k and a word representation w ∈ R d to determine if the word is contained in the sentence.
The order task is an extension of the content task where a concatenation of the sentence representation and word representations of two words in sentence is used to determine if the ﬁrst word occurs before or after the second.
We use a random subset of the 1-billion-word dataset for these experiments that were not used to train our multi-task representations.
The syntactic properties tasks are setup in the same way as described in Shi et al.
(2016).The passive and tense tasks are characterized as binary classiﬁcation problems given a sentence’s representation.
The former’s objective is to determine if a sentence is written in active/passive voice while the latter’s objective is to determine if the sentence is in the past tense or not.
The top syntactic sequence (TSS) is a 20-way classiﬁcation problem with 19 most frequent top syntactic sequences and 1 miscellaneous class.
We use the same dataset as the authors but different training, validation and test splits.
[Table]
+STN +Fr +De +NLI +L +STP
[Table]
[Table]
NLI
[Table]
Query
[Table]
nearest sentence i ...
i want ... ”
she could n’t ﬁnish the sentence and she did n’t have to .
i ... ”
she had no idea what she had intended to say .
and ... ”
she could n’t ﬁnish .
i ... ”
he winced as if he could n’t bear whatever ﬂashed through his mind .
you were going to sleep with her just to ... ”
i could n’t even ﬁnish my sentence .
tyler was kind enough to wait two weeks before talking about their relationship again .
he ’d been more than honest in setting forth his feelings about their relationship .
she did n’t wait for him to ask what she was talking about .
damn , just thinking about it made him want to talk to her again .
i did n’t wait for my bestie to try and talk me out of it .
“ you can , my lady . ”
“ of course , my lady . ”
“ what can i do for you , my lady ? ”
“ watch yourself , my lady . ”
“ where to , my lady ? ”
they ’d kept silent about it , a terrifying secret between them that was n’t going away .
he ’d known they had secrets between them , things they were n’t ready to share .
she ’d kept his secret , even from her two closest conﬁdantes .
he ’d made her a promise and he was n’t about to break it .
she ’d brushed them off as shock-induced ramblings , but now riley was n’t so sure .
“ you deserve good things , ” marshal said , but he was still wearing that damn pitying smile .
“ i ’m really happy to see you , ladybug , ” he said softly , the smile never leaving his eyes .
“ you ’re a bad liar , ” he said , still smiling .
“ it ’s okay , ” i said , but he shook his head and sighed .
“ i ’ll answer that , ” he said , his eyes still lit with humor .
belatedly i turned to look up at max and exclaimed , “ hey ! ”
i started , hollering at his retreating form , “ thank you ! ”
he slowly turned and looked at me
[Table]