Title: SOFT TOKEN MATCHING FOR INTERPRETABLE LOW-RESOURCE CLASSIFICATION

Abstract: We propose a model to tackle classification tasks in the presence of very little training data. To this aim, we introduce a novel matching mechanism to focus on elements of the input, by using vectors that represent semantically meaningful concepts for the task at hand. By leveraging highlighted portions of the training data, a simple, yet effective, error boosting technique guides the learning process. In practice, it increases the error associated to relevant parts of the input by a given factor. Results on text classification tasks confirm the benefits of the proposed approach in both balanced and unbalanced cases, thus being of practical use when labeling new examples is expensive. In addition, the model is interpretable, as it allows for human inspection of the learned weights.

1. INTRODUCTION:

Gathering and labeling data is a task that can be expensive in terms of time, human effort and resources. When we cannot rely on already available datasets, training a model with acceptable performance on few data points annotated by few annotators, becomes critical in many practical applications. This is, indeed, especially important when the data is naturally imbalanced and the demands of gathering samples of the minority class are high. One important domain in which these issues arise is text classification, for example hate-speech (Waseem & Hovy, 2016) , web spam (Castillo et al., 2007) and abuse detection (Mishra et al., 2018) .

One effective approach to overcome the lack of training data is that of Zaidan et al. (2007) , which consists of augmenting the few data available with rationales, i.e., highlighted portions of the input. Rationales are usually coupled with feature-engineering to be effective in low resource scenarios. An alternative way to deal with data sparsity, especially in text classification tasks, is to use pretrained language models (LMs) that are fine-tuned on a target domain. While this approach has been tested on hundreds of training points (Devlin et al., 2018; Howard & Ruder, 2018) , it is not clear how it behaves in an even scarcer setting, as the vast parameter space of an LM might pose a problem. Moreover, fine-tuning a model may require a considerable amount of computing power, therefore restricting its applicability. On the other hand, some embedding-based models represent the input as a weighted average of words (Kalchbrenner et al., 2014; Sheikh et al., 2016) , where the weight is given by a parameter called "reference vector". However, these models cannot easily incorporate multiple reference vectors, and they are not interpretable since classification works on unreadable embedding features.

In this paper, we propose a novel and efficient representation learning model to address the above issues. The underlying idea is to focus on relevant words in the input while being able to generalise to semantically similar concepts; this is something akin to what a human would do in the presence of data scarcity. We therefore introduce two techniques that should coexist to reflect our intuition. First of all, the model to focuses on specific words by computing soft matching probabilities between each word and multiple vectors which represent semantic concepts. Secondly, we guide the learning process to learn important concepts thanks to an error boosting technique that exploits rationales. Basically, it encourages the model to reduce the overall error by improving the prediction associated with highlighted words. Additionally, by direct inspection of model weights it is possible to understand what words it focuses on; in short, the model is interpretable 1 . Results across a consistent number of baselines and three datasets also indicate a significant improvement in performance. Interestingly, we always outperform fine-tuned models when little training data is available. Our model can also assist users to train a classifier for a very specific task. As an example, consider training an abstract filtering system with rationales provided by the user itself. The model will then learn to filter out papers that are not matching the user's preferences.

The rest of the paper is structured as follows: Section 2 provides an overview of the existing literature, highlighting similar and different ideas; Section 3 formally introduces the problem as well as our model, providing intuition behind our architectural choices; Section 4 details our experiments and shows our findings, with a thorough ablation study that disentangles the contribution of each part of the model and a use case on interpretability; finally, Section 5 summarizes our work.

2. RELATED WORKS:

There are different ways in which rationales can be used. Some works generate rationales, while others exploit them to inform the learning process. The method proposed by Lei et al. (2016) tackles text classification by learning a distribution of rationales given the text and a distribution of the target class given the rationales. Interestingly, an additional regularization term is added to the loss to produce rationales that are short and coherent. The model makes use of high-capacity recurrent neural networks (Schuster & Paliwal, 1997) , thus it is tested on large amounts of training data to prevent overfitting. This work was later refined by Bastings et al. (2019) , who proposed a probabilistic version of a similar architecture, where a latent model is responsible for the generation of discrete rationales. The main advantage of predicting discrete rationales is that it is possible to constrain their maximum number per sample, thus effectively controlling sparsity. However, it usually requires a large amount of data points to be effective. The first to exploit rationales in a low resource scenario were Zaidan et al. (2007) and Zaidan & Eisner (2008) , by means of a rationale-constrained SVM (Cortes & Vapnik, 1995) and a probabilistic model. Moreover, the latter is realized as a log-linear classifier with heavy use of featureengineering. On the other hand, when rationales are defined on features rather than on samples, one can use the Generalized Expectation (GE) criteria (Druck et al., 2007; McCallum et al., 2007) to significantly improve the performance of classifiers. Rationales can also be incorporated in the loss function (Barrett et al., 2018) , where the attention module (Vaswani et al., 2017) on top of an LSTM (Hochreiter & Schmidhuber, 1997) is forced to attend relevant tokens in a document. This method was not tested on small datasets, possibly because of the aforementioned issues of high capacity models. A similar approach has been successfully applied by Bao et al. (2018) to the weak supervision problem. However, the model assumes one source domain, with supervised labels, to learn an attention generation module that is then applied to the target domain. In contrast, our method can be built on a given embedding space with minimum supervision. Apart from incorporating prior knowledge in the form of rationales, one can augment neural networks with: first-order logic (Li & Srikumar, 2019; Hu et al., 2016a) ; a corpora of regular expressions (Luo et al., 2018) ; or massive linguistic constraints (Hu et al., 2016b) . While generally powerful and effective, all these methods require domain-specific expertise to define the additional features and constraints that are then explicitly incorporated into the network. In a different manner, the SoPA architecture of Schwartz et al. (2018) learns to match surface patterns on text through a differentiable version of finite state machines. A weighted combination of these patterns is used to classify a document. Instead, BabbleLabble (BL) (Hancock et al., 2018) is a method for generating weak classifiers from natural language explanations when supervision is scarce. These are then fed to Data Programming (DP) (Ratner et al., 2016) , a probabilistic framework, that outputs a final score. On one hand, BL works well because it exploits a domain-specific grammar to parse explanations; on the other hand, this grammar must be carefully designed by domain experts. Finally, the Neural Bag Of Words (NBOW) model (Kalchbrenner et al., 2014) takes an average of token embeddings and applies a logistic regression to classify a document. Its extension, NBOW2 (Sheikh et al., 2016) , computes an importance score for each word by comparing it with a single reference vector that is learned. Despite the underlying idea being similar, we propose a different mechanism to focus on relevant words.

In the following, we describe the architecture whose only requirements are i) an embedding space of the input, and ii) additional rationales, though the latter is not strictly required. As we are shall discuss, the model has a strong inductive bias, which is effective when trained with very little data. Hereinafter, we refer to our new architecture with the name PARCUS, which stands for Pattern Representations on Continuous Spaces.

3. THE PARCUS MODEL:

Let us consider a classification task in which a very small labelled dataset D L = {(x 1 , r 1 , y 1 ), . . . , (x L , r L , y L )} is given, where x i is an input sample, r i represents the rationale information and y i is the discrete target label. For the purpose of this paper, an input is a set of tokens x i = {x 1 i , . . . , x Ti i } of arbitrary size T i . In addition, x j i ∈ R d , where d is the size of an embedding space obtained using a pretrained model. Finally, we assume that each token in the input has been marked as relevant or not by annotators, i.e., r i = {r 1 i , . . . , r Ti i } ∈ {0, 1} Ti .

Intuition When humans are asked to solve a text classification problem after seeing few examples, they tend to look for very simple patterns across the dataset, such as specific words. Nevertheless, humans are also able to generalise to semantically similar concepts; our goal is to design a model that reflects this ability. For example, assume that the word "excellent" is important for classifying a movie review as positive. If we were to work in the character space, a straightforward solution would be to match specific (sub-)strings in the input, an instance of the so-called pattern matching technique. Clearly, pattern matching cannot generalize to words that have similar meaning, e.g., "outstanding". In this work, we transfer the concept of pattern matching into the embedding space, where semantically similar words are assumed to have "close" representations. We achieve this via a mechanism that outputs a probability of soft matching between a token and a "reference vector", which is learned together with the classification task to capture discriminative "concepts". Differently from bag-of-word methods of Section 2, this model easily accommodates multiple reference vectors, hence it can focus on many different concepts that are critical for classification.

In order to guide the learning process using the given rationales, it seems sensible to magnify the error for those words that have been marked as relevant by annotators. Notwithstanding the simplicity of the idea, the underlying challenge is to effectively embed human knowledge into the reference vectors, which are responsible for the soft matching technique. In other words, the probabilities of soft matching should be highly correlated with the target class. Finally, we require that classification should be done in such a way that a user can explicitly understand which reference vectors are more important for positive or negative prediction. This last step is obtained by learning a linear combination of the soft matching probabilities.

The next sections describe the proposed model in depth. First, we show how to compute and combine soft token matching probabilities, and then we introduce the error boosting technique that incorporates rationales in the training process. It is worth mentioning that both techniques have been designed to coexist, even though the latter is not strictly necessary to train the model.

3.1. SOFT TOKEN MATCHING:

We now present the core mechanism that implements soft token matching. Let us define a set of parameters

P = {p 1 , . . . , p N }, p k ∈ R d called prototypes,

where N is an hyper-parameter of the model. A prototype plays a similar role as the reference vector in Sheikh et al. (2016) . Going back to our movie review example, one p i ∈ P should ideally adapt to be close to the embedding of the word "excellent".

To learn the N prototypes, we employ the cosine similarity metric. Cosine similarity can be seen as a way to measure semantic similarity; its co-domain ranges from -1, i.e., opposite in meaning, to 1, i.e., same meaning, with 0 indicating uncorrelation. Ideally, we would like our prototypes to have near-1 similarity with the relevant tokens in the input. To this aim, we further define a gate activation function g : [-1, 1] → [0, 1] that takes the distance between a token x j i and a prototype p k and outputs a probability of soft matching:

EQUATION

where a is an hyper-parameter. In practice, the closer to 1 the similarity is, the greater the output of this gated activation, and g(v) = 1 ⇔ v = 1. By choosing a high value of a we strongly penalize Figure 1 : The PARCUS architecture is applied to the i-th example of a dataset, i.e., "Alice is married to Bob", with "married" being highlighted. After an initial phase where rationales r i are extracted and words are mapped to embeddings x i , we extract features by computing the similarity between the token's embedding and the parameters of our model. Then, we combine these features with a linear layer which outputs per-token predictions. At training time only, predictions are multiplied by a boosting factor f (r j i ). Results are then summed to yield the sentence prediction y i .

tokens that are associated with low similarity scores. For completeness, Section A.1 depicts g(v)

for different values of a. Such a technique is important because it allows PARCUS to focus on N concepts that are semantically different while fostering interpretability. Notice that this method differs from NBOW2 (Sheikh et al., 2016) , as we use prototypes to compute per-token features rather than importance scores.

3.2. COMBINING PROTOTYPES:

Equation 1 computes the probability of soft matching between a token and a prototype. Likewise, because we have N prototypes, we treat all N probabilities as features associated with that token. We represent these features as φ k (x j i ) = g(d(x j i , p k )) ∀k ∈ 1, . . . , N . Now that we have a notion of multiple soft matching probabilities, we can combine them via AND/OR logical functions. An approximation of such functions can be straightforwardly implemented through the pseudodifferentiable version of min and max (Paszke et al., 2017) :

EQUATION

In Section A.2 we propose a fully differentiable version of the above equations, though min and max significantly speed up convergence (due to the absence of non-linearities).

3.3. INFERENCE:

Finally, we need to linearly combine all F features to output a token prediction y j i . Let us define an auxiliary function (omitting the argument x j i to make notation less cluttered):

EQUATION

where square brackets denote concatenation. Then, the token prediction is computed as

y j i = ∆(x j i )W + b (5)

where W ∈ R F ×C is a matrix of parameters (multi-class prediction with C classes') and b is the (optional) bias. It is worth noticing that these features are yet another strong inductive bias, and that the linear model is especially necessary to interpret the model, as detailed in Section 4.3. Figure 1 combines all steps of the proposed architecture for token classification.

Under review as a conference paper at ICLR 2020 Finally, the input prediction is just a sum of the individual y j i

EQUATION

where σ, from now on, represents the softmax activation.

3.4. RATIONALE-DRIVEN ERROR BOOSTING:

So far, we have not made use of rationales, which are of fundamental importance to guide the learning process. Intuitively, we would like the prototypes to softly match those tokens that are relevant for prediction. It follows that a boosting approach (Freund et al., 1999) is not feasible in this scenario, because we want to weight the importance of tokens rather than of whole samples.

Instead, the method we propose is simple and efficient, and it effectively exploits prior information.

The idea is to boost the error associated with specific tokens' predictions to encourage the model to focus on them. To be more precise, at training time only we modify Equation 6to take into account the prior information as follows

EQUATION

where f : [0, 1] → R is an arbitrary exponential function of our choice that boosts the error, e.g., f (x) = e x ; we leave the extension to an adaptive version of f for future works. In terms of learning, f (r j i ) boosts the gradient of highlighted tokens while leaving unchanged the rest (i.e., if r j i is 0, our f (r j i ) outputs a multiplicative factor of 1).

Discussion Regularization of the matrix W plays an important role for effective learning. We use L1 and L2 regularization terms on W, as done in (Zou & Hastie, 2005) , for two main purposes. First, the L1 term enforces sparsity, which allows us to more easily interpret the importance of different features. Secondly, L2 limits the magnitude of the weights, hence avoiding over-compensation of low cosine similarity scores. Consequently, in order to increase one of the soft-matching probability features, the model is encouraged to make changes to the prototypes rather than to the linear weights; in turn, this translates into a particular prototype being "close" to relevant embeddings. From a mathematical standpoint, we cannot achieve the same result as Equation 6 by means of an additional loss term as done in Lei et al. (2016) , because gradients would be summed and not multiplied. Moreover, in our experiments we choose to augment ∆(x j i ) with additional information, such as the probability of "opposite" matching: φ ¬k (x j i ) = g(-d(x j i , p k )) ∀k ∈ 1, . . . , N . Specifically, when φ ¬k (x j i ) ≈ 1 the token x j i and p k have cosine similarity equal to -1, hence they are opposite in meaning.

Implementation details PARCUS can be trained by full-gradient descent in an end-to-end fashion, from the prototypes to the linear weights. We rely on Pytorch (Paszke et al., 2017) to implement our model in few lines of code; this reflects the simplicity and strong inductive bias of our approach, which is necessary in the context we consider. The error boosting technique is applied by the automatic differentiation packages once we implement Equation 7.

We conclude with remarks on the model complexity. The total number of parameters is Θ(N d + F C), which is larger than those needed by simpler models such as logistic regression. Usually, a restricted number of parameters serves to counteract overfitting, by limiting the hypotheses space of the model (Vapnik, 1998) . However, this work tackles the problem from a different and novel perspective, as we prevent the prototype weights from freely changing. Specifically, prototype weights vary in a way that depends on the given embedding space, because they tend to be close to some token representation. If this had not been the case, we could have simply used an MLP in place of P, which does not perform as well as PARCUS in our experiments.

4. EXPERIMENTS:

This section reports the experimental setting as well as our experimental findings. We perform an in-depth analysis on our model through ablation studies, in order to clearly separate the contribution of prototypes from the error boosting technique. Then, we explain what a model can learn by direct inspection of its parameters. All code to reproduce experiments is publicly available2 .

4.1. EXPERIMENTAL SETTING:

Datasets We empirically validate our method on three different datasets. First, MovieReview (Zaidan et al., 2007) contains balanced positive and negative movie reviews with rationales. Secondly, we use the highly imbalanced Spouse dataset from Hancock et al. (2018) , where the task is to tell whether two entities in a given piece of news are married or not. This is a much harder task than standard classification, as the same document can appear multiple times with different given entities and background context greatly varies. Finally, we use the Hatespeech Twitter dataset of Waseem & Hovy (2016), which contains short and noisy tweets that can belong to the hate-speech or neutral class. Datasets' statistics are reported in the appendix for completeness. We manually provide rationales for 60 randomly chosen positive samples of both Spouse and Hatespeech (this process required approximately 1 hour).

Setup The experimental evaluation was carried out by measuring performances on the given test set while varying the number of data points used for training. We used balanced train and validation splits for all models, and the validation set is taken as big as the training one to simulate a real scenario. As for Spouse, we used the given validation set to fairly compare with the results of Hancock et al. (2018) . We chose the pre-trained base version of BERT (Devlin et al., 2018) to provide the embedding space to our method and to other neural baselines as well. We repeated each experiments 10 times with different random train/validation splits; however, different models have been trained and validated on the same data splits, and we report the hyperparameters table in the appendix. Moreover, to avoid bad initializations of the final re-training (for the selected configuration), we average test performances over 3 runs. The optimized measure is Accuracy for MovieReview and F1-score for Spouse and Hatespeech, as the former is perfectly balanced. We optimize the Cross Entropy loss using the Adam optimizer (Kingma & Ba, 2015) for all the baselines we implement.

Methods:

To have a fair evaluation with respect to the same embedding space, we train a linear model (Linear) and a single-layer MLP that work on token embeddings (MLP), as well as NBOW and NBOW2. Importantly, we also finetune BERT on Spouse and MovieReview. For Spouse, we propose a regular expression that associates specific sub-strings ("wife", "husb", "marr" and "knot") to the positive class; ideally, our model should be able to focus on such words while also generalizing. Traditional Supervision (TS) is a logistic regression trained on n-gram features, whereas BL-DM stands for the BabbleLabble pipeline tested on 30 random explanations; results for TS and BL-DM are taken from Hancock et al. (2018) . BL-DM can explicitly exploit the relational information of the Spouse dataset, hence it is a strong baseline. Moreover, we report results of an SVM (Zaidan et al., 2007) and a log-linear model on language features (Zaidan & Eisner, 2008) , both of which are specifically designed to exploit additional rationales. On Hatespeech, we compare against a Logistic Regression model based on character n-grams (LR-ngrams), as it was shown to reach state of the art performance (Park & Fung, 2017) . Finally, we perform a number of ablation studies to isolate the contribution of different techniques: i) an MLP with the error boosting technique; ii) our method without highlights; ii) our method with no logical features; iii) our method with φ k features only.

4.2. RESULTS & DISCUSSION:

Table 1 presents our empirical results for all three datasets, Results confirm that the choice of a strong inductive bias indeed benefits performances in a very low data regime. On Spouse, our model strongly outperforms other neural baselines and reaches the manually tuned regular expression with just 60 data points (only 30 of them are positive). Moreover, TS needs ≈50x more data to achieve similar performance, whereas 10 datapoints are sufficient to do better than almost all baselines with a training size of 300, a >30x improvement which does not depend on the chosen embedding space. We also found that TS performs much worse than our linear baseline (hence the need for a fair comparison on the embedding space). With 300 datapoints, our model without highlights has an average F1 score very close to that of BL-DM, which relies on a domain-specific grammar and parser. In addition, we note that the reported result (46.5) is not averaged over multiple runs; as a matter of fact, one of our random splits achieves a test score of 46.3, indicating the need for robust evaluation when it comes to experiments on few examples. Overall, we found that the proposed approach can be really helpful when data is greatly imbalanced, and outperforms models like BERT that are deemed quite performing when fine-tuned on relatively small datasets (Devlin et al., 2018; Howard & Ruder, 2018) . Similar arguments apply to MovieReview, where our model strongly improves over the baselines. Interestingly, our simple representation learning approach is able to beat the state of the art by a large margin when few data points are available. Here, NBOW and NBOW2 models proved to be strong baselines, as the mean representation of a document seems to work well.Generally speaking, the gap between performances is more evident as training size is very scarce, even when compared to other baselines that use rationales.

In light of these results, we performed ablation studies on both datasets to understand if the improvements are only due to prototypes, rationales or both. Overall, we observe that the strong inductive bias represented by prototypes provides a consistent improvement with respect to the other models, which is especially evident on the Spouse dataset. Interestingly, the MLP does not benefit from error boosting, which might be explained by the fact that its larger hypotheses space, i.e., unconstrained weights, makes it difficult to diminish the contributions of non-relevant tokens. Because rationales guide the learning process, their are more important in the extremely low resource scenario, but their effect slowly fades as the training size increases; contrarily to our expectations, PARCUS performed even better on larger amounts of training points without rationales. On Hatespeech PARCUS still performs fairly well on average, but with 200 traning examples it cannot keep up with the logistic regressor of Park & Fung (2017). We found two reasons for such behavior: (i) BERT's tokenizer is unable to accurately splitting tweets, due to their noisy nature, and (ii) character n-grams are strong discriminative features for this task (Nobata et al., 2016) , and BERT does not use them. To simultaneously solve both issues we switched to Fasttext embeddings (Bojanowski et al., 2017) which are also trained on character n-grams and do not need an additional tokenizer. Surprisingly, we observed a significant improvement on 200 data points, which reduces the gap in performance with the n-grams based model. Therefore, we conclude that choosing the "right" embedding space can make the difference, which does not necessarily mean using one of the latest and most powerful language models available.

4.3. PROVIDING EXPLANATIONS:

In this Section we show that PARCUS is interpretable. To this aim, we train a model using N =3 prototypes on 60 examples taken from the Spouse dataset. Then we run the model on unseen data and we inspect the outputs associated with each token. We then rank them to see what are the most important ones, and we observe that the tokens with highest rank correspond to semantic concepts that are relevant for the task. Indeed, the model learned to focus on words related to marriage, as well as syntactic variations associated with similar semantics. Moreover, some of the words were not given as part of rationales in the training set. The next step is to show that rationales have effectively been incorporated in the prototypes, and how the features of Eq. 4 have been weighted. We started by inspecting the magnitude of the linear weights W ∈ R 8×2 ; specifically, if the i-th feature is discriminative for a class c, then the i-th row of W will have the c-th element clearly larger than the others. In our example, we found that φ 1 was important for positive predictions, whereas the other features did not contribute to a particular class. Therefore, we performed top-10 cosine similarity ranking between tokens and the prototype p 1 . From the most similar to the least one, we obtained: husband; marriage; marrying; wife; married; marry; fiance; wedding; fiancee; and girlfriend. Interestingly, PARCUS has automatically learned to match concepts similar to those provided in natural language form by BabbleLabble Hancock et al. (2018) .

5. CONCLUSIONS:

We presented a new methodology to perform classification in the low data regime. We coupled soft token matching with error boosting to focus on concepts that are important for the task at hand. The model is able to outperform other competitors, including fine-tuned complex models. Moreover, we showed with a practical example how humans can interpret the predictions in terms of concepts matching. In conclusion, our model proved to be a useful in tasks where gathering data is challenging. Given the set {φ 1 , , φ N } ∈ [0, 1] N , interpreted as N independent "soft matching probabilities", we would like to compute their joint probability as well as the probability of a single matching out of all possible ones. In our experiments, we found a pseudo-differentiable implementation of min and max (Eq. 2 and Eq. 3) to speed up convergence. Alternatively, we tried a fully differentiable version of those two functions as well as the probability of mutually exclusive events, i.e., XOR. We present the equations for N = 2, although this can be easily generalized to arbitrary N :

φ Dif f AN D (φ 1 , φ 2 ) = φ 1 * φ 2 φ Dif f OR (φ 1 , φ 2 , s) = (φ 1 -2) -2s -2 -2s (1 -φ 1 ) + (φ 2 -2) -2s -2 -2s (1 -φ 2 ) -φ Dif f AN D (φ 1 , φ 2 ) φ Dif f XOR (φ 1 , φ 2 ) = φ Dif f OR (φ 1 , φ 2 ) -φ Dif f AN D (φ 1 , φ 2 )

where s controls how squashed is the curve is. Figure 5 depicts all three curves for s = 2.

A.3 DATASETS' STATISTICS:

In Table 2 we report the statistics of the datasets we used. When preprocessing the data with BERT, we used a maximum sentence length of 128 for token-based methods, and 512 when finetuning BERT. As mentioned in Section 4, each sample of the Spouse dataset contains a pair of entities as well as the sentence. Therefore, the MLP baseline, ablation studies and our method will make use of an input-mask (at test time only), which reflects the fact that we are not interested in those sentences where both our entities of interest do not appear. It is worth noticing that such relational information should be naturally exploited by methods like BabbleLabble, which rely on domain-specific grammars. While this method should help to improve precision, in practice it did not significantly affect performances.

A.4 HYPER-PARAMETERS:

Hyper-parameters are used to perform model selection, which returns the best configuration for a given validation split. We use such configuration to train a model on the whole training set and then evaluate its generalization performances on the unseen test set. When Data Programming is used, we simply combine model selection of our model with that of data programming. Since the experiment is repeated 10 times to avoid lucky/unlucky data splits, model selection is performed 10 times as well. Model assessment, i.e., the measure of performance of our family of models, is evaluated by averaging the 10 different performances on the test set. When fine-tuning BERT, we mainly follow the guidelines reported in Devlin et al. (2018) . We investigated how injecting random rationales (i.e., ones) in prior information affects the final performances. Clearly, having a 100% noise corresponds to not having rationales at all, therefore we run a simple experiment (with fixed hyper-parameters) 10 times on Spouse, with the goal to study robustness to noise. Figure 6 shows the result, where different curves stand for different training sizes; as one would expect, for few data points (blue and red curves) noise has bigger influence whereas for 150 (orange curve) and 300 (green curve) data points the effect is negligible. This confirms that there is a trade-off where the impact of rationales has little effect on the final performances.

:

See(Guidotti et al.,

2019) for the notion of interpretability we use throughout the paper.

Link to the code to reproduce the experiments is omitted at review time

Figures and Tables:

Figure 2: Top-10 most relevant tokens for positive prediction, averaged on unseen data.

Figure 5: From left to right: Cosine similarity with respect to the [1,1] vector and its gated activation.

Figure 6: Robustness to different degrees of rationale noise on the Spouse dataset. From bottom to top, the curves refer to different training sizes: 10, 30, 60, 150, 300. We fix f (r) = e r

Results for all three datasets. Standard deviation is shown in brackets. On Spouse and Hatespeech we report the F1 score, whereas we use accuracy to compare models on MovieReview.

Table content: <table><tr><td>SPOUSE</td></tr></table>

Zeerak Waseem and Dirk Hovy. Hateful symbols or hateful people? predictive features for hate speech detection on twitter. In Proceedings of the NAACL student research workshop, pp. 88-93, 2016. Omar Zaidan, Jason Eisner, and Christine Piatko. Using annotator rationales to improve machine learning for text categorization. In Human language technologies 2007: The conference of the North American chapter of the association for computational linguistics; proceedings of the main conference, pp. 260-267, 2007. Omar F Zaidan and Jason Eisner. Modeling annotators: A generative approach to learning from annotator rationales. In Proceedings of the Conference on Empirical Methods in Natural Language pp. 31-40. Association for Computational Linguistics, 2008. Hui Zou and Trevor Hastie. Regularization and variable selection via the elastic net. Journal of the royal statistical society: series B (statistical methodology), 67(2):301-320, 2005. A.2 DIFFERENTIABLE IMPLEMENTATION OF AND AND OR

Table content: <table/>

Datasets' statistics.

Table content: <table><tr><td/><td colspan="5">Train Size Validation Size Test Size % Pos. No. Rationales</td></tr><tr><td>Spouse</td><td>22195</td><td>2796</td><td>2697</td><td>8%</td><td>60 (Positive)</td></tr><tr><td colspan="2">MovieReview 1800</td><td>-</td><td>200</td><td>50%</td><td>1800</td></tr><tr><td>Hatespeech</td><td>3430</td><td>-</td><td>3430</td><td>14.7%</td><td>60 (Positive)</td></tr></table>

Hyper-parameters tried for model selection.

Table content: <table><tr><td/><td>LINEAR</td><td>MLP/NBOW(2)</td><td>BERT+FINETUNE</td><td>DP</td><td>OURS</td></tr><tr><td colspan="2">LEARNING RATE {0.01, 0.001, 0.0001}</td><td>{0.001, 0.0001}</td><td colspan="2">{0.00002, 0.00003, 0.00005} range(0.001, 0.0001)</td><td>{0.01}</td></tr><tr><td>L1</td><td>-</td><td>-</td><td>-</td><td/><td>-{0.01, 0.001}</td></tr><tr><td>L2</td><td>{0.1, 0.01, 0.0001}</td><td>{0.01, 0.0001}</td><td>-</td><td>-</td><td>{0.001, 0.0001}</td></tr><tr><td>EPOCHS</td><td>{50, 100, 150}</td><td>{100, 500}</td><td>{2, 4, 10}</td><td>{100, 500}</td><td>{500}</td></tr><tr><td>HIDDEN UNITS</td><td>-</td><td>{8, 16, 32}</td><td>-</td><td>-</td><td>-</td></tr><tr><td>BATCH SIZE</td><td>32</td><td>32</td><td>8</td><td>-</td><td>32</td></tr><tr><td>N</td><td>-</td><td>-</td><td>-</td><td>-</td><td>{5, 10}</td></tr><tr><td>f (r)</td><td>-</td><td>-</td><td>-</td><td>-</td><td>{e r , 5 r , 10 r }</td></tr><tr><td>a</td><td>-</td><td>-</td><td>-</td><td>-</td><td>{10, 100}</td></tr><tr><td>MAX SEARCH</td><td>-</td><td>-</td><td>-</td><td>10</td><td>-</td></tr></table>

Peer review (iclr2020):
This paper considers the problem of text classification, especially the settings in which the number of labeled sentences is very small. However, authors assume, annotations of rationales behind the label, i.e. highlighting tokens in a sentence which are important in deciding its label. As per my understanding, this is a big limitation. Second, the proposed model makes inference of class labels just based upon occurrence of words in a sentence, rather than making more sophisticated inferences relying upon sub-sequence patterns at least. The idea proposed in the paper is to learn prototype vectors which have high similarity w.r.t. tokens in sentences, especially the highlighted one. I didn*t understand the justification for learning such prototypes in the first place. This works build upon a workshop paper. The idea proposed in the paper, even in the specific problem context considered, are incremental. I don*t think that this kind of work aligns with the theme of learning representations. This paper may be suitable for publication in an NLP workshop as the baseline model.