http://wiki.math.uwaterloo.ca/statwiki/api.php?action=feedcontributions&user=Hybmirza&feedformat=atomstatwiki - User contributions [US]2022-08-17T20:02:04ZUser contributionsMediaWiki 1.28.3http://wiki.math.uwaterloo.ca/statwiki/index.php?title=stat441w18/Convolutional_Neural_Networks_for_Sentence_Classification&diff=32742stat441w18/Convolutional Neural Networks for Sentence Classification2018-03-06T16:48:32Z<p>Hybmirza: /* Introduction */</p>
<hr />
<div>= Presented by = <br />
1. Ben Schwarz<br />
<br />
2. Cameron Miller<br />
<br />
3. Hamza Mirza<br />
<br />
4. Pavle Mihajlovic<br />
<br />
5. Terry Shi<br />
<br />
6. Yitian Wu<br />
<br />
7. Zekai Shao<br />
<br />
= Introduction =<br />
Deep learning is being used widely in visual and speech recognition and Natural Language Processing (NLP) has already became an important topic of research in this field. Most of the work performed for this revolves around learning word embeddings and completing compositions over the learned material. <br />
<br />
The work for this paper obtained unsupervised word to vectors that were trained on the 100 billion publicly available words on google news. These words were then used to train a simple CNN with one layer of convolution. The simple model achieved excellent results and even with just little tuning of the hyper parameters. This suggests that pre-trained vectors can be effectively utilized for classification tasks. <br />
<br />
The simple model was tested on various datasets such as movie reviews, Stanford Sentiment Treebank and customer reviews. Despite its limitations, the results were competitive to more complex models that use pooling schemes.<br />
<br />
= Model =<br />
<br />
=== Theory of Convolutional Neural Networks ===<br />
<br />
Let <math> \boldsymbol{x}_{i:i+j} </math> represents the concatenation of words <math> \boldsymbol{x}_i, \boldsymbol{x}_{i+1}, \dots, \boldsymbol{x}_{i+j} </math> with concatenation operation <math> \oplus </math>, <math> \boldsymbol{x}_{i:i+j} = \boldsymbol{x}_i \oplus \boldsymbol{x}_{i+1} \oplus \dots \oplus \boldsymbol{x}_{i+j} </math>. Then, a sentence of length <math> n </math> is a concatenation of <math> n </math> words, denoted as <math> \boldsymbol{x}_{1:n} </math>, <math> \boldsymbol{x}_{1:n} = \boldsymbol{x}_1 \oplus \boldsymbol{x}_2 \oplus \dots \oplus \boldsymbol{x}_n </math>. Let <math> \boldsymbol{x}_i \in \mathbb{R}^k </math> denote the <math> i </math>-th word in the sentence, <math> i \in \{ 1, \dots, n \} </math>.<br />
<br />
A Convolutional Neural Network (CNN) is a nonlinear function <math> f: \mathbb{R}^{hk} \to \mathbb{R} </math> that computes a series of outputs <math> c_i </math> from windows of <math> h </math> words <math> \boldsymbol{x}_{i:i+h-1} </math> in the sentence. Hence, <math> c_i = f \left( \boldsymbol{w} \cdot \boldsymbol{x}_{i:i+h-1} + b \right) </math>, where <math> \boldsymbol{w} \in \mathbb{R}^{hk} </math> is call a ''filter'' and <math> b \in \mathbb{R} </math> is a bias term, <math> i \in \{ 1, \dots, n-h+1 \} </math>. The outputs form a <math> (n-h+1) </math>-dimensional vector <math> \boldsymbol{c} = \left[ c_1, c_2, \dots, c_{n-h+1} \right] </math>, called a ''feature map''.<br />
<br />
To capture the most important feature from a feature map, we take the maximum value <math> \hat{c} = max \{ \boldsymbol{c} \} </math>. Since each filter corresponds to one feature, we obtain several features from multiple filters the model uses which form a penultimate layer. The penultimate layer then gets passed into a fully connected softmax layer which produces the probability distribution over labels.<br />
<br />
Below is a slight variant of CNN with two "channels" of word vectors: static vectors and fine-tuned vectors via backpropagaton. We calculate <math> c_i </math> by applying each filter to both channels and then adding them together. The rest of the model is equivalent to a single channel CNN architecture as described above.<br />
<br />
[[File:CNN_for_Sentence_Classification_1.jpg|600px|thumb|center|Model Architecture with Two Channels (Kim, Y., 2014)]]<br />
<br />
=== Model Regularization ===<br />
<br />
To prevent co-adaptation and overfitting, we randomly drop out some hidden units on penultimate layer by setting them to zero during forward propagation and restrict the <math> l_2 </math>-norm of the weight vectors.<br />
<br />
For example, consider a penultimate layer <math> \boldsymbol{p} </math> obtained from <math> m </math> filters, <math> \boldsymbol{p} = \left[ \hat{c}_1, \dots, \hat{c}_m \right] </math>. Let <math> \boldsymbol{u} \in \mathbb{R}^m </math> be a weight vector, <math> \boldsymbol{r} \in \mathbb{R}^m </math> be a "dropout" vector of Bernoulli random variables with a proportion of <math> p </math> being 1, and <math> \circ </math> be an element-wise multiplication operator. In forward propagation, instead of using <math> y = \boldsymbol{u} \cdot \boldsymbol{p} + b </math>, we use <math> y = \boldsymbol{u} \cdot \left( \boldsymbol{p} \circ \boldsymbol{r} \right) + b </math> to obtain the output <math> y </math>. Gradients are only backpropagated through "remaining" units. Then at testing, we scale the learned weight vector by <math> p </math> such that <math> \hat{\boldsymbol{u}} = p\boldsymbol{u} </math>. We use <math> \hat{\boldsymbol{u}} </math> to score dropout sentences. Additionally, at each gradient descent step, we restrict <math> \| \boldsymbol{u} \|_2 = s </math> if <math> \| \boldsymbol{u} \|_2 > s </math>.<br />
<br />
=== Datasets and Experimental Setup ===<br />
<br />
<br />
[[File:table1.png|300px|thumb|center]]<br />
<br />
<br />
There are various benchmark for classification, for example:<br />
<br />
MR: <br />
<br />
<blockquote><br />
Movie reviews with one sentence per review. <br />
<br />
Class: positive/negative (Pang and Lee, 2005).<br />
</blockquote><br />
<br />
SST-1:<br />
<br />
<blockquote><br />
Standford Sentiment Treebank (An extension of MR) with train/dev*/test splits.<br />
<br />
Classes: very positive, positive, neutral, negative, very negative. <br />
<br />
dev set *: The set used for selecting the best performing model.<br />
(re-labeled by Socher er al. 2013)<br />
</blockquote><br />
<br />
SST-2: <br />
<br />
<blockquote><br />
Same as SST-1 but with neutral reviews removed and binary labels. <br />
<br />
Class: positive/negative<br />
</blockquote><br />
<br />
Subj: <br />
<br />
<blockquote><br />
To classify a sentence as subjective or objective.<br />
<br />
Class: subjective/objective (Pang and Lee, 2004)<br />
</blockquote><br />
<br />
TREC: <br />
<br />
<blockquote><br />
TREC question dataset, classifying a question into 6 question types<br />
<br />
Class: question about person, location, numeric information. etc<br />
(Li and Roth, 2002).<br />
</blockquote><br />
<br />
CR:<br />
<br />
<blockquote><br />
Customer review towards various products (i.e. cameras, MP3 etc.). <br />
<br />
Class: positive/negative reviews.<br />
(Hu and Liiu, 2004)<br />
</blockquote><br />
<br />
MPQA:<br />
<br />
<blockquote><br />
Opinion polarity detetion subtask of the MPQA dataset.<br />
<br />
(Wiebe et al., 2005).<br />
</blockquote><br />
<br />
<br />
<br />
===== Hyperparameters and Training =====<br />
<br />
If no dev set is specified, then randomly pick 10 percent of training set as the dev set. <br />
<br />
Using grid search, we find out the best combination of hyperparameters. On dev set of SST-2 dev set, we set all the hyperparameters: rectified linear units, filter windows(h) of 3, 4, 5 with 100 feature maps each, dropout rate (p) of 0.5, l2 constraint (s) of 3, and mini-batch size of 50. <br />
<br />
Training is done through stochastic gradient descent over mini-batches with the Adadelta update rule(Zeiler, 2012)<br />
<br />
===== Pre-trained Word Vectors =====<br />
<br />
It is a popular method to initialize word vector through an unsupervised neural language model, which improves perfomance in the absense of a large supervised training set (Collobert et al ., 2011; Socher et al., 2011; lyyer et al,. 2014). <br />
<br />
We use 'word2vec' vectors that were trained on 100 billion words from Google News. The vectors have dimensionality of 300 and were trained using bag-of-words architecture*( Mikolov et al., 2013). For words not present in the set of pre-trained words, we initialized them randomly.<br />
<br />
===== Model Variations =====<br />
CNN-rand:<br />
<blockquote><br />
baseline model where all words are randomly initialized and then modified during training<br />
</blockquote><br />
<br />
CNN-static:<br />
<blockquote><br />
model with pre-trained vectors from 'word2vec'(publicly available).<br />
<br />
All words are randomly initialized and are kept static and the other parameters of the model are learned<br />
</blockquote><br />
<br />
CNN-non-static:<br />
<blockquote><br />
same as above but the pre-trained vectors are fine-tuned for each task<br />
</blockquote><br />
<br />
CNN-multichannel:<br />
<blockquote><br />
A model with two sets of word vectors. <br />
<br />
Each set is a 'channel' and each filter is applied on both channels.<br />
One channel is fine-tuned via back-propagation, and the other is static(unchanged).<br />
<br />
Both channels are initialized from 'word2vec'.<br />
</blockquote><br />
<br />
We keep other sources of randomness uniform within each datasets(such as CV-fold assignment, initialization of unknown word vectors, initialization of CNN parameters) to eliminate the effect of the above variations versus other random factors.<br />
<br />
= Training and Results =<br />
===== Scoring Method =====<br />
<br />
The results of the CNN models against other methods can be seen in Table A. The accuracy of the four model variations of the CNN described above are compared with the accuracy (on a scale of 0 to 100) of various other methods.<br />
[[File:CCNresults.png|800px|thumb|center|Table A: Results of the CNN model against other methods]]<br />
<br />
===== Results =====<br />
<br />
The baseline model (CNN-rand) with all randomly initialized words does not perform well compared to the other models as expected. In many cases, the baseline model performs the worst or close to the worst.<br />
Much to the surprise of the authors, the model with static vectors (CNN-static) performed exceptionally well, even against more sophisticated models from other research studies which have used static representations. As we will talk about, this suggests that pre-trained vectors are a useful ‘universal’ feature, that can be used against various datasets to improve accuracy.<br />
<br />
===== The Effect of the Multichannel Model =====<br />
<br />
One of the primary goals of the multichannel model was to prevent the issue of overfitting, and as a consequence, provide better results than the single channel. The idea was limit the deviation of learned vectors from the original values. The results of the experiments, however, did not show any significant evidence that the multichannel model performed better than the single channel models. In fact, there were some experiments in which single channel models scored better than the multichannel model, and some where the multichannel model scored better than the single channel models.<br />
<br />
===== The Effects of Static vs. Non-Static Models =====<br />
<br />
One of the key differences observed between the static and non-static models is that the fine-tuning of vectors in the non-static model allowed it to make meaningful associations, based on expressions of sentiment and uses of various punctuation. On the other hand, the static channel made stronger association based on syntax. Based on the results, the non-static model generally performed better than the static channel.<br />
<br />
===== Further Observations =====<br />
<br />
The multiple filter widths and feature maps of the CNN results in much greater performance than other models with similar architecture. Another feature of the CNN that improved performance was dropout, on average adding between 2-4% accuracy. When initializing words not in the word2vec vectors, performance was improved by sampling each dimension from [-a,a], where a is a value chosen to ensure the randomly initialized vectors and the ore-trained vectors have the same variance.<br />
<br />
= Criticisms =<br />
The author has acknowledged that at the time of his original experiments he did not have access to a GPU and thus could not run many differing experiments. Therefore the paper is missing things like ablation studies, which refers to removing/adding some feature of the model/algorithm and seeing how that can affect performance of the CNN (e.g. dropout rate). When a model is assessed it would be vital for the author to replicate the k-fold cross validation procedure and include ranges and variances of the performance. The author only reported the mean of the CV results but this overlooks the randomness of the stochastic processes which were used. This paper did not report variances despite using stochastic gradient descent, random dropout and random weight parameter initialization, which are all highly stochastic learning procedures. For more on an exhaustive analysis of model variants on CNNs Ye Zhang and Byron C. Wallace did a sensitivity analysis of CNNs for sentence classification (https://arxiv.org/pdf/1510.03820.pdf). <br />
<br />
[[File:density.png|600px|thumb|center|Density curve of accuracy using static and non-static word2vec-CNN <br />
(Zhang, Y. Wallace, B. 2016)]]<br />
<br />
= More Formulations/New Concepts =<br />
<br />
Adadelta update rule:<br />
<br />
<br />
<br />
continuous bag-of-words architecture:<br />
<br />
<br />
<br />
<br />
unsupervised/supervised learning:<br />
<br />
= Conclusion =<br />
Yoon Kim described a series of experiments with CNNs using word2vec for differing types of sentence classifications. With minimal hyperparameter tuning and a simple CNN with 1 layer of convolution the models performed in some cases better than the other established benchmarks. The author was able to beat the provided benchmarks in 4/7 datasets effectively demonstrating the power of CNNs for sentence classification.<br />
<br />
= Source =</div>Hybmirzahttp://wiki.math.uwaterloo.ca/statwiki/index.php?title=stat441w18/Convolutional_Neural_Networks_for_Sentence_Classification&diff=32741stat441w18/Convolutional Neural Networks for Sentence Classification2018-03-06T16:48:16Z<p>Hybmirza: /* Introduction */</p>
<hr />
<div>= Presented by = <br />
1. Ben Schwarz<br />
<br />
2. Cameron Miller<br />
<br />
3. Hamza Mirza<br />
<br />
4. Pavle Mihajlovic<br />
<br />
5. Terry Shi<br />
<br />
6. Yitian Wu<br />
<br />
7. Zekai Shao<br />
<br />
= Introduction =<br />
Deep learning is being used widely in visual and speech recognition and Natural Language Processing (NLP) has already became an important topic of research in this field. Most of the work performed for this revolves around learning word embeddings and completing compositions over the learned material. <br />
The work for this paper obtained unsupervised word to vectors that were trained on the 100 billion publicly available words on google news. These words were then used to train a simple CNN with one layer of convolution. The simple model achieved excellent results and even with just little tuning of the hyper parameters. This suggests that pre-trained vectors can be effectively utilized for classification tasks. <br />
The simple model was tested on various datasets such as movie reviews, Stanford Sentiment Treebank and customer reviews. Despite its limitations, the results were competitive to more complex models that use pooling schemes.<br />
<br />
= Model =<br />
<br />
=== Theory of Convolutional Neural Networks ===<br />
<br />
Let <math> \boldsymbol{x}_{i:i+j} </math> represents the concatenation of words <math> \boldsymbol{x}_i, \boldsymbol{x}_{i+1}, \dots, \boldsymbol{x}_{i+j} </math> with concatenation operation <math> \oplus </math>, <math> \boldsymbol{x}_{i:i+j} = \boldsymbol{x}_i \oplus \boldsymbol{x}_{i+1} \oplus \dots \oplus \boldsymbol{x}_{i+j} </math>. Then, a sentence of length <math> n </math> is a concatenation of <math> n </math> words, denoted as <math> \boldsymbol{x}_{1:n} </math>, <math> \boldsymbol{x}_{1:n} = \boldsymbol{x}_1 \oplus \boldsymbol{x}_2 \oplus \dots \oplus \boldsymbol{x}_n </math>. Let <math> \boldsymbol{x}_i \in \mathbb{R}^k </math> denote the <math> i </math>-th word in the sentence, <math> i \in \{ 1, \dots, n \} </math>.<br />
<br />
A Convolutional Neural Network (CNN) is a nonlinear function <math> f: \mathbb{R}^{hk} \to \mathbb{R} </math> that computes a series of outputs <math> c_i </math> from windows of <math> h </math> words <math> \boldsymbol{x}_{i:i+h-1} </math> in the sentence. Hence, <math> c_i = f \left( \boldsymbol{w} \cdot \boldsymbol{x}_{i:i+h-1} + b \right) </math>, where <math> \boldsymbol{w} \in \mathbb{R}^{hk} </math> is call a ''filter'' and <math> b \in \mathbb{R} </math> is a bias term, <math> i \in \{ 1, \dots, n-h+1 \} </math>. The outputs form a <math> (n-h+1) </math>-dimensional vector <math> \boldsymbol{c} = \left[ c_1, c_2, \dots, c_{n-h+1} \right] </math>, called a ''feature map''.<br />
<br />
To capture the most important feature from a feature map, we take the maximum value <math> \hat{c} = max \{ \boldsymbol{c} \} </math>. Since each filter corresponds to one feature, we obtain several features from multiple filters the model uses which form a penultimate layer. The penultimate layer then gets passed into a fully connected softmax layer which produces the probability distribution over labels.<br />
<br />
Below is a slight variant of CNN with two "channels" of word vectors: static vectors and fine-tuned vectors via backpropagaton. We calculate <math> c_i </math> by applying each filter to both channels and then adding them together. The rest of the model is equivalent to a single channel CNN architecture as described above.<br />
<br />
[[File:CNN_for_Sentence_Classification_1.jpg|600px|thumb|center|Model Architecture with Two Channels (Kim, Y., 2014)]]<br />
<br />
=== Model Regularization ===<br />
<br />
To prevent co-adaptation and overfitting, we randomly drop out some hidden units on penultimate layer by setting them to zero during forward propagation and restrict the <math> l_2 </math>-norm of the weight vectors.<br />
<br />
For example, consider a penultimate layer <math> \boldsymbol{p} </math> obtained from <math> m </math> filters, <math> \boldsymbol{p} = \left[ \hat{c}_1, \dots, \hat{c}_m \right] </math>. Let <math> \boldsymbol{u} \in \mathbb{R}^m </math> be a weight vector, <math> \boldsymbol{r} \in \mathbb{R}^m </math> be a "dropout" vector of Bernoulli random variables with a proportion of <math> p </math> being 1, and <math> \circ </math> be an element-wise multiplication operator. In forward propagation, instead of using <math> y = \boldsymbol{u} \cdot \boldsymbol{p} + b </math>, we use <math> y = \boldsymbol{u} \cdot \left( \boldsymbol{p} \circ \boldsymbol{r} \right) + b </math> to obtain the output <math> y </math>. Gradients are only backpropagated through "remaining" units. Then at testing, we scale the learned weight vector by <math> p </math> such that <math> \hat{\boldsymbol{u}} = p\boldsymbol{u} </math>. We use <math> \hat{\boldsymbol{u}} </math> to score dropout sentences. Additionally, at each gradient descent step, we restrict <math> \| \boldsymbol{u} \|_2 = s </math> if <math> \| \boldsymbol{u} \|_2 > s </math>.<br />
<br />
=== Datasets and Experimental Setup ===<br />
<br />
<br />
[[File:table1.png|300px|thumb|center]]<br />
<br />
<br />
There are various benchmark for classification, for example:<br />
<br />
MR: <br />
<br />
<blockquote><br />
Movie reviews with one sentence per review. <br />
<br />
Class: positive/negative (Pang and Lee, 2005).<br />
</blockquote><br />
<br />
SST-1:<br />
<br />
<blockquote><br />
Standford Sentiment Treebank (An extension of MR) with train/dev*/test splits.<br />
<br />
Classes: very positive, positive, neutral, negative, very negative. <br />
<br />
dev set *: The set used for selecting the best performing model.<br />
(re-labeled by Socher er al. 2013)<br />
</blockquote><br />
<br />
SST-2: <br />
<br />
<blockquote><br />
Same as SST-1 but with neutral reviews removed and binary labels. <br />
<br />
Class: positive/negative<br />
</blockquote><br />
<br />
Subj: <br />
<br />
<blockquote><br />
To classify a sentence as subjective or objective.<br />
<br />
Class: subjective/objective (Pang and Lee, 2004)<br />
</blockquote><br />
<br />
TREC: <br />
<br />
<blockquote><br />
TREC question dataset, classifying a question into 6 question types<br />
<br />
Class: question about person, location, numeric information. etc<br />
(Li and Roth, 2002).<br />
</blockquote><br />
<br />
CR:<br />
<br />
<blockquote><br />
Customer review towards various products (i.e. cameras, MP3 etc.). <br />
<br />
Class: positive/negative reviews.<br />
(Hu and Liiu, 2004)<br />
</blockquote><br />
<br />
MPQA:<br />
<br />
<blockquote><br />
Opinion polarity detetion subtask of the MPQA dataset.<br />
<br />
(Wiebe et al., 2005).<br />
</blockquote><br />
<br />
<br />
<br />
===== Hyperparameters and Training =====<br />
<br />
If no dev set is specified, then randomly pick 10 percent of training set as the dev set. <br />
<br />
Using grid search, we find out the best combination of hyperparameters. On dev set of SST-2 dev set, we set all the hyperparameters: rectified linear units, filter windows(h) of 3, 4, 5 with 100 feature maps each, dropout rate (p) of 0.5, l2 constraint (s) of 3, and mini-batch size of 50. <br />
<br />
Training is done through stochastic gradient descent over mini-batches with the Adadelta update rule(Zeiler, 2012)<br />
<br />
===== Pre-trained Word Vectors =====<br />
<br />
It is a popular method to initialize word vector through an unsupervised neural language model, which improves perfomance in the absense of a large supervised training set (Collobert et al ., 2011; Socher et al., 2011; lyyer et al,. 2014). <br />
<br />
We use 'word2vec' vectors that were trained on 100 billion words from Google News. The vectors have dimensionality of 300 and were trained using bag-of-words architecture*( Mikolov et al., 2013). For words not present in the set of pre-trained words, we initialized them randomly.<br />
<br />
===== Model Variations =====<br />
CNN-rand:<br />
<blockquote><br />
baseline model where all words are randomly initialized and then modified during training<br />
</blockquote><br />
<br />
CNN-static:<br />
<blockquote><br />
model with pre-trained vectors from 'word2vec'(publicly available).<br />
<br />
All words are randomly initialized and are kept static and the other parameters of the model are learned<br />
</blockquote><br />
<br />
CNN-non-static:<br />
<blockquote><br />
same as above but the pre-trained vectors are fine-tuned for each task<br />
</blockquote><br />
<br />
CNN-multichannel:<br />
<blockquote><br />
A model with two sets of word vectors. <br />
<br />
Each set is a 'channel' and each filter is applied on both channels.<br />
One channel is fine-tuned via back-propagation, and the other is static(unchanged).<br />
<br />
Both channels are initialized from 'word2vec'.<br />
</blockquote><br />
<br />
We keep other sources of randomness uniform within each datasets(such as CV-fold assignment, initialization of unknown word vectors, initialization of CNN parameters) to eliminate the effect of the above variations versus other random factors.<br />
<br />
= Training and Results =<br />
===== Scoring Method =====<br />
<br />
The results of the CNN models against other methods can be seen in Table A. The accuracy of the four model variations of the CNN described above are compared with the accuracy (on a scale of 0 to 100) of various other methods.<br />
[[File:CCNresults.png|800px|thumb|center|Table A: Results of the CNN model against other methods]]<br />
<br />
===== Results =====<br />
<br />
The baseline model (CNN-rand) with all randomly initialized words does not perform well compared to the other models as expected. In many cases, the baseline model performs the worst or close to the worst.<br />
Much to the surprise of the authors, the model with static vectors (CNN-static) performed exceptionally well, even against more sophisticated models from other research studies which have used static representations. As we will talk about, this suggests that pre-trained vectors are a useful ‘universal’ feature, that can be used against various datasets to improve accuracy.<br />
<br />
===== The Effect of the Multichannel Model =====<br />
<br />
One of the primary goals of the multichannel model was to prevent the issue of overfitting, and as a consequence, provide better results than the single channel. The idea was limit the deviation of learned vectors from the original values. The results of the experiments, however, did not show any significant evidence that the multichannel model performed better than the single channel models. In fact, there were some experiments in which single channel models scored better than the multichannel model, and some where the multichannel model scored better than the single channel models.<br />
<br />
===== The Effects of Static vs. Non-Static Models =====<br />
<br />
One of the key differences observed between the static and non-static models is that the fine-tuning of vectors in the non-static model allowed it to make meaningful associations, based on expressions of sentiment and uses of various punctuation. On the other hand, the static channel made stronger association based on syntax. Based on the results, the non-static model generally performed better than the static channel.<br />
<br />
===== Further Observations =====<br />
<br />
The multiple filter widths and feature maps of the CNN results in much greater performance than other models with similar architecture. Another feature of the CNN that improved performance was dropout, on average adding between 2-4% accuracy. When initializing words not in the word2vec vectors, performance was improved by sampling each dimension from [-a,a], where a is a value chosen to ensure the randomly initialized vectors and the ore-trained vectors have the same variance.<br />
<br />
= Criticisms =<br />
The author has acknowledged that at the time of his original experiments he did not have access to a GPU and thus could not run many differing experiments. Therefore the paper is missing things like ablation studies, which refers to removing/adding some feature of the model/algorithm and seeing how that can affect performance of the CNN (e.g. dropout rate). When a model is assessed it would be vital for the author to replicate the k-fold cross validation procedure and include ranges and variances of the performance. The author only reported the mean of the CV results but this overlooks the randomness of the stochastic processes which were used. This paper did not report variances despite using stochastic gradient descent, random dropout and random weight parameter initialization, which are all highly stochastic learning procedures. For more on an exhaustive analysis of model variants on CNNs Ye Zhang and Byron C. Wallace did a sensitivity analysis of CNNs for sentence classification (https://arxiv.org/pdf/1510.03820.pdf). <br />
<br />
[[File:density.png|600px|thumb|center|Density curve of accuracy using static and non-static word2vec-CNN <br />
(Zhang, Y. Wallace, B. 2016)]]<br />
<br />
= More Formulations/New Concepts =<br />
<br />
Adadelta update rule:<br />
<br />
<br />
<br />
continuous bag-of-words architecture:<br />
<br />
<br />
<br />
<br />
unsupervised/supervised learning:<br />
<br />
= Conclusion =<br />
Yoon Kim described a series of experiments with CNNs using word2vec for differing types of sentence classifications. With minimal hyperparameter tuning and a simple CNN with 1 layer of convolution the models performed in some cases better than the other established benchmarks. The author was able to beat the provided benchmarks in 4/7 datasets effectively demonstrating the power of CNNs for sentence classification.<br />
<br />
= Source =</div>Hybmirza