user: text: Write a concise one-sentence TLDR summary of the scientific paper content below.

Title: CBOW Is Not All You Need: Combining CBOW with the Compositional Matrix Space Model

Paper content:
Continuous Bag of Words (CBOW) is a powerful text embedding method.
Due to its strong capabilities to encode word content, CBOW embeddings perform well on a wide range of downstream tasks while being efficient to compute.
However, CBOW is not capable of capturing the word order.
The reason is that the computation of CBOW's word embeddings is commutative, i.e., embeddings of XYZ and ZYX are the same.
In order to address this shortcoming, we propose a
learning algorithm for the Continuous Matrix Space Model, which we call Continual Multiplication of Words (CMOW).
Our algorithm is an adaptation of word2vec, so that it can be trained on large quantities of unlabeled text.
We empirically show that CMOW better captures linguistic properties, but it is inferior to CBOW in memorizing word content.
Motivated by these findings, we propose a hybrid model that combines the strengths of CBOW and CMOW.
Our results show that the hybrid CBOW-CMOW-model retains CBOW's strong ability to memorize word content while at the same time substantially improving its ability to encode other linguistic information by 8%.
As a result, the hybrid also performs better on 8 out of 11 supervised downstream tasks with an average improvement of 1.2%.
Word embeddings are perceived as one of the most impactful contributions from unsupervised representation learning to natural language processing from the past few years BID10 .
Word embeddings are learned once on a large-scale stream of words.
A key benefit is that these pre-computed vectors can be re-used almost universally in many different downstream applications.
Recently, there has been increasing interest in learning universal sentence embeddings.
BID24 have shown that the best encoding architectures are based on recurrent neural networks (RNNs) BID5 BID25 or the Transformer architecture BID2 .
These techniques are, however, substantially more expensive to train and apply than word embeddings BID14 BID2 .
Their usefulness is therefore limited when fast processing of large volumes of data is critical.More efficient encoding techniques are typically based on aggregated word embeddings such as Continuous Bag of Words (CBOW), which is a mere summation of the word vectors BID19 .
Despite CBOW's simplicity, it attains strong results on many downstream tasks.
Using sophisticated weighting schemes, the performance of aggregated word embeddings can be further increased BID0 , coming even close to strong LSTM baselines BID26 BID13 such as InferSent BID5 .
This raises the question how much benefit recurrent encoders actually provide over simple word embedding based methods BID32 .
In their analysis, BID13 suggest that the main difference may be the ability to encode word order.
In this paper, we propose an intuitive method to enhance aggregated word embeddings by word order awareness.The major drawback of these CBOW-like approaches is that they are solely based on addition.
However, addition is not all you need.
Since it is a commutative operation, the aforementioned methods are not able to capture any notion of word order.
However, word order information is crucial for some tasks, e.g., sentiment analysis BID13 .
For instance, the following two sentences yield the exact same embedding in an addition-based word embedding aggregation technique: "The movie was not awful, it was rather great." and "The movie was not great, it was rather awful."
A classifier based on the CBOW embedding of these sentences would inevitably fail to distinguish the two different meanings (Goldberg, 2017, p. 151) .To
alleviate this drawback, BID28 propose to model each word as a matrix rather than a vector, and compose multiple word embeddings via matrix multiplication rather than addition. This
so-called Compositional Matrix Space Model (CMSM) of language has powerful theoretical properties that subsume properties from vector-based models and symbolic approaches. The
most obvious advantage is the non-commutativity of matrix multiplication as opposed to addition, which results in order-aware encodings.In contrast to vector-based word embeddings, there is so far no solution to effectively train the parameters of word matrices on large-scale unlabeled data. Training
schemes from previous work were specifically designed for sentiment analysis BID34 BID1 . Those require
complex, multi-stage initialization, which indicates the difficulty of training CMSMs. We show that
CMSMs can be trained in a similar way as the well-known CBOW model of word2vec BID19 . We make two
simple yet critical changes to the initialization strategy and training objective of CBOW. Hence, we present
the first unsupervised training scheme for CMSMs, which we call Continual Multiplication Of Words (CMOW). We evaluate our model
's capability to capture linguistic properties in the encoded text. We find that CMOW and
CBOW have properties that are complementary. On the one hand, CBOW
yields much stronger results at the word content memorization task. CMOW, on the other hand
, offers an advantage in all other linguistic probing tasks, often by a wide margin. Thus, we propose a hybrid
model to jointly learn the word vectors of CBOW and the word matrices for CMOW.Our experimental results confirm the effectiveness of our hybrid CBOW-CMOW approach. At comparable embedding size
, CBOW-CMOW retains CBOW's ability to memorize word content while at the same time improves the performance on the linguistic probing tasks by 8%. CBOW-CMOW outperforms CBOW
at 8 out of 11 supervised downstream tasks scoring only 0.6% lower on the tasks where CBOW is slightly better. On average, the hybrid model
improves the performance over CBOW by 1.2% on supervised downstream tasks, and by 0.5% on the unsupervised tasks.In summary, our contributions are: (1) For the first time, we present an unsupervised, efficient training scheme for the Compositional Matrix Space Model. Key elements of our scheme are
an initialization strategy and training objective that are specifically designed for training CMSMs. (2) We quantitatively demonstrate
that the strengths of the resulting embedding model are complementary to classical CBOW embeddings. (3) We successfully combine both
approaches into a hybrid model that is superior to its individual parts.After giving a brief overview of the related work, we formally introduce CBOW, CMOW, and the hybrid model in Section 3. We describe our experimental
setup and present the results in Section 4. The results are discussed in
Section 5, before we conclude.
Our CMOW model produces sentence embeddings that are approximately at the level of fastSent BID14 .
Thus, CMOW is a reasonable choice as a sentence encoder.
Essential to the success of our training schema for the CMOW model are two changes to the original word2vec training.
First, our initialization strategy improved the downstream performance by 2.8% compared to Glorot initialization.
Secondly, by choosing the target word of the objective at random, the performance of CMOW on downstream tasks improved by 20.8% on average.
Hence, our novel training scheme is the first that provides an effective way to obtain parameters for the Compositional Matrix Space Model of language from unlabeled, large-scale datasets.
Regarding the probing tasks, we observe that CMOW embeddings better encode the linguistic properties of sentences than CBOW.
CMOW gets reasonably close to CBOW on some downstream tasks.
However, CMOW does not in general supersede CBOW embeddings.
This can be explained by the fact that CBOW is stronger at word content memorization, which is known to highly correlate with the performance on most downstream tasks ).
Yet, CMOW has an increased performance on the TREC question type classification task (88.0 compared to 85.6).
The rationale is that this particular TREC task belongs to a class of downstream tasks that require capturing other linguistic properties apart from Word Content .Due
to joint training, our hybrid model learns to pick up the best features from CBOW and CMOW simultaneously. It
enables both models to focus on their respective strengths. This
can best be seen by observing that H-CMOW almost completely loses its ability to memorize word content. In return
, H-CMOW has more capacity to learn other properties, as seen in the increase in performance at BShift and others. A complementary
behavior can be observed for H-CBOW, whose scores on Word Content are increased. Consequently, with
an 8% improvement on average, the hybrid model is substantially more linguistically informed than CBOW. This transfers to
an overall performance improvement by 1.2% on average over 11 supervised downstream tasks, with large improvements on sentiment analysis tasks (SST2, SST5), question classification (TREC), and the sentence representation benchmark (STS-B). The improvements
on these tasks is expected because they arguably depend on word order information. On the other tasks
, the differences are small. Again, this can be
explained by the fact that most tasks in the SentEval framework mainly depend on word content memorization , where the hybrid model does not improve upon CBOW.Please note, the models in our study do not represent the state-of-the-art for sentence embeddings. BID24 show that better
scores are achieved by LSTMs and Transformer models, but also by averaging word embedding from fastText BID21 . These embeddings were
trained on the CBOW objective, and are thus very similar to our models. However, they are trained
on large corpora (600B tokens vs 3B in our study), use large vocabularies (2M vs 30k in our study), and incorporate numerous tricks to further enhance the quality of their models: word subsampling, subword-information, phrase representation, n-gram representations, position-dependent weighting, and corpus de-duplication. In the present study, we
focus on comparing CBOW, CMOW, and the hybrid model in a scenario where we have full control over the independent variables. To single out the effect
of the independent variables better, we keep our models relatively simple. Our analysis yields interesting
insights on what our models learn when trained separately or jointly, which we consider more valuable in the long term for the research field of text representation learning.We offer an efficient order-aware extension to embedding algorithms from the bag-of-words family. Our 784-dimensional CMOW embeddings
can be computed at the same rate as CBOW embeddings. We empirically measured in our experiments
71k for CMOW vs. 61k for CBOW in terms of encoding sentences per second. This is because of the fast implementation
of matrix multiplication in GPUs. It allows us to encode sentences approximately
5 times faster than using a simple Elman RNN of the same size (12k per second). Our matrix embedding approach also offers valuable
theoretical advantages over RNNs and other autoregressive models. Matrix multiplication is associative such that only
log 2 n sequential steps are necessary to encode a sequence of size n. Besides parallelization, also dynamic programming techniques
can be employed to further reduce the number of matrix multiplication steps, e. g., by pre-computing frequent bigrams. We therefore expect our
matrix
embedding approach to be specifically
well-suited for large-scale, time-sensitive text encoding applications. Our hybrid model serves as a blueprint for using CMOW in conjunction
with other existing embedding techniques such as fastText BID21 .
We have presented the first efficient, unsupervised learning scheme for the word order aware Compositional Matrix Space Model.
We showed that the resulting sentence embeddings capture linguistic features that are complementary to CBOW embeddings.
We thereupon presented a hybrid model with CBOW that is able to combine the complementary strengths of both models to yield an improved downstream task performance, in particular on tasks that depend on word order information.
Thus, our model narrows the gap in terms of representational power between simple word embedding based sentence encoders and highly non-linear recurrent sentence encoders.We made the code for this paper available at https://github.com/florianmai/ word2mat.

assistant: text: We present a novel training scheme for efficiently obtaining order-aware sentence representations.