Noise Stability Regularization for Improving BERT Fine-tuning Hang Hua 1 *  , Xingjian Li 2 , 3 * , Dejing Dou 2 (cid:66) , Chengzhong Xu 3 , Jiebo Luo 1 1 University of Rochester, Rochester, NY, USA { hhua2, jluo } @cs.rochester.edu 2 Big Data Lab, Baidu Research, Beijing, China { lixingjian, doudejing } @baidu.com 3 Department of Computer Science, University of Macau, Macau, China czxu@um.edu.mo Abstract Fine-tuning pre-trained language models such as BERT has become a common practice dominating leaderboards across various NLP tasks. Despite its recent success and wide adoption, this process is unstable when there are only a small number of training samples available. The brittleness of this process is often reflected by the sensitivity to random seeds. In this paper, we propose to tackle this problem based on the noise stability property of deep nets, which is investigated in recent literature (Arora et al., 2018; Sanyal et al., 2020). Specifically, we introduce a novel and effective regularization method to improve fine-tuning on NLP tasks, referred to as L ayer-wise N oise S tability R egularization ( LNSR ). We extend the theories about adding noise to the input and prove that our method gives a stabler regularization effect. We provide supportive evidence by experimentally confirming that well-performing models show a low sensitivity to noise and fine-tuning with LNSR exhibits clearly higher generalizability and stability. Furthermore, our method also demonstrates advantages over other state-of-the-art algorithms including L 2 SP (Li et al., 2018), Mixout (Lee et al., 2020) and SMART (Jiang et al., 2020). Large-scale pre-trained language models such as BERT (Devlin et al., 2019) have been widely used in natural language processing tasks (Guu et al., 2020; Liu, 2019; Wadden et al., 2019; Zhu et al., 2020b). A typical process of training a supervised downstream dataset is to fine-tune a pre-trained model for a few epochs. In this process, most of the model's parameters are reused, while a random initialized task-specific layer is added to adapt the model to the new task. Fine-tuning BERT has significantly boosted the state of the art performance on natural lanContribution during internship at Baidu Research. guage understanding (NLU) benchmarks such as GLUE (Wang et al., 2018) and SuperGLUE (Wang et al., 2019). However, despite the impressive empirical results, this process remains unstable due to the randomness involved by data shuffling and the initialization of the task-specific layer. The observed instability in fine-tuning BERT was first discovered by Devlin et al. (2019); Dodge et al. (2020), and several approaches have been proposed to solve this problem (Lee et al., 2020; Zhang et al., 2020; Mosbach et al., 2020). In this study, we consider the fine-tuning stability of BERT from the perspective of the sensitivity to input perturbation. This is motivated by Arora et al. (2018) and Sanyal et al. (2020) who show that noise injected at the lower layers has very lit-tle effect on the higher layers for neural networks with good generalizability. However, for a well pre-trained BERT, we find that the higher layers are still very sensitive to the lower layer's perturbation (as shown in Figure 1), implying that the high level representations of the pre-trained BERT may not generalize well on downstreaming tasks and consequently lead to instability. This phenomenon coincides with the observation that transferring the top pre-trained layers of BERT slows down learning and hurts performance (Zhang et al., 2020). In addition, Yosinski et al. (2014) also point out that in transfer learning models for object recognition, the lower pre-trained layers learn more general features while the higher layers closer to the output specialize more to the pre-training tasks. We argue that this result also applies to BERT. Intuitively, if a trained model is insensitive to the perturbation of the lower layers' output, then the model is con-fident about the output, and vice versa. Based on the above theoretical and empirical results, we propose a simple and effective regularization method to reduce the noise sensitivity of BERT and thus improve the stability and performance of fine-tuned BERT. To verify our approach, we conduct extensive experiments on different few-sample (fewer than 10k training samples) NLP tasks, including CoLA (Warstadt et al., 2019), MRPC (Dolan and Brock-ett, 2005), RTE (Wang et al., 2018; Dagan et al., 2005; Bar-Haim et al., 2006; Giampiccolo et al., 2007), and STS-B (Cer et al., 2017). With the layer-wise noise stability regularization, we obtain strong empirical performance. Compared with other state-of-the-art models, our approach not only improves the fine-tuning stability (with a smaller standard deviation) but also consistently improve the overall performance (with a larger mean, median and maximum). In summary, our main contributions are:  We propose a lightweight and effective regularization method, referred to as Layer-wise Noise Stability Regularization (LNSR) to improve the local Lipschitz continuity of each BERT layer and thus ensure the smoothness of the whole model. The empirical results show that the fine-tuned BERT models regularized with LNSR obtain significantly more accurate and stable results. LNSR also outperforms other state-of-the-art methods aiming at stabilizing fine-tuning such as L 2 -SP (Li et al., 2018), Mixout (Lee et al., 2020) and SMART (Jiang et al., 2020). We are the first to study the effect of noise stability in NLP tasks. We extend classic theories of adding noise to explicitly constraining the output consistency when adding noise to the input. We theoretically prove that our proposed layer-wise noise stability regularizer is equivalent to a special case of the Tikhonov regularizer, which serves as a stabler regularizer than simply adding noise to the input (Ri-fai et al., 2011). We investigate the relation of the noise stability property to the generalizability of BERT. We find that in general, models with good generalizability tend to be insensitive to noise perturbation; the lower layers of BERT show a better error resilience property but the higher layers of BERT remain sensitive to the lower layers' perturbation (as is depicted in Figure 1). Pre-training has been well studied in machine learning and natural language processing (Erhan et al., 2009, 2010). Mikolov et al. (2013) and Pennington et al. (2014) proposed to use distributional representations (i.e., word embeddings) for individual words. Dai and Le (2015) proposed to train a language model or an auto-encoder with unlabeled data and then leveraged the obtained model to finetune downstream tasks. Recently, pretrained language models, like ELMo (Peters et al., 2018), GPT/GPT-2 (Radford, 2018; Radford et al., 2019), BERT (Devlin et al., 2019), cross-lingual language model (briefly, XLM) (Lample and Con-neau, 2019), XLNet (Yang et al., 2019), RoBERTa (Liu et al., 2019) and ALBERT(Lan et al., 2020) have attracted more and more attention in natural language processing communities. The models are first pre-trained on large amount of unlabeled data to capture rich representations of the input, and then applied to the downstream tasks by either providing context-aware embeddings of an input sequence (Peters et al., 2018), or initializing the parameters of the downstream model (Devlin et al., 2019) for fine-tuning. Such pre-training approaches deliver decent performance on natural language understanding tasks. Fine-tuning instability of BERT has been reported in various previous works. Devlin et al. (2019) report instabilities when fine-tuning BERT on small datasets and resort to performing multiple restarts of fine-tuning and selecting the model that performs best on the development set. Dodge et al. (2020) performs a large-scale empirical investigation of the fine-tuning instability of BERT. They found dramatic variations in fine-tuning accuracy across multiple restarts and argue how it might be related to the choice of random seed and the dataset size. Lee et al. (2020) propose a new regularization method named Mixout to improve the stability and performance of fine-tuning BERT. Zhang et al. (2020) evaluate the importance of debiasing step empirically by fine-tuning BERT with both BERTAdam and standard Adam optimizer (Kingma and Ba, 2015) and propose a re-initialization method to get a better initialization point for fine-tuning optimization. Mosbach et al. (2020) analyses the cause of fine-tuning instability and propose a simple but strong baseline (small learning rate combined with bias correction). There has been several regularization approaches to stabilizing the performance of models. Loshchilov and Hutter (2019) propose a decoupled weight decay regularizer integrated in Adam (Kingma and Ba, 2015) optimizer to prevent neural networks from being too complicate. Gunel et al. (2020) use contrastive learning method to augment training set to improve the generalization performance. In addition, spectral norm (Yoshida and Miyato, 2017; Roth et al., 2019) serves as a general method can also be used to constrain the Lipschitz continuous of matrix, which can increase the stability of generalized neural networks. There are also several noise-based methods have been proposed to improve the generalizability of pre-trained language models, including SMART (Jiang et al., 2020), FreeLB (Zhu et al., 2020a) and R3F (Aghajanyan et al., 2020). They achieves state of the art performance on GLUE, SNLI (Bowman et al., 2015), SciTail (Khot et al., 2018), and ANLI (Nie et al., 2020) NLU benchmarks. Most of these algorithms employ adversarial training method to improve the robustness of language model fine-tuing. SMART uses an adversarial methodology to encourage models to be smooth within a neighborhoods of all the inputs; FreeLB optimizes a direct adversarial loss through iterative gradient ascent steps; R3F removes the adversarial nature of SMART and optimize the smoothness of the whole model directly. Different from these methods, our proposed method does not adopt the adversarial training strategy, we optimize the smoothness of each layer of BERT directly and thus improve the stability of whole model. One of the central issues in neural network training is to determine the optimal degree of complexity for the model. A model which is too limited will not sufficiently capture the structure in the data, while one which is too complex will model the noise on the data (the phenomenon of over-fitting). In either case, the performance on new data, that is the ability of the network to generalize, will be poor. The problem can be regarded as one of find-ing the optimal trade-off between the high bias of a model which is too inflexible and the high variance of a model with too much freedom (Geman et al., 1992; Bishop, 1995; Novak et al., 2018; Bishop, 1991). To control the trade-off of bias against variance of BERT models, we impose an explicit noise regularization method. Denoting the training set as D , we give the general form of optimization objective for a BERT model f (  ;  ) with L layers, as following: = arg min  E ( x,y )  D [ L ( f ( x ;  ) , y )+  R (  )] . (1) To represent  R (  ) , we first define the injection position as the input of layer b which is denoted as x b . Denoting the regularization weight corresponding to each f b,r as  b,r , given a sample ( x, y )  D , the regularization term is represented by the following formulas:  R (  ) = L (cid:88) r = b  b,r || f b,r ( x b +  )  f b,r ( x b ) || 2 . If the regularization is operated at the output of layer r , we can further denote the function between layer b and r as f b,r , satisfying that 1 < = b < = r < = L . To implement the noise stability regularization, we inject a Gaussian-like noise vector  to x b and get a neighborhood x b +  . Specifically, each element  i is independently randomly sampled from a Gaussian distribution with the mean of zero and the standard deviation of  as  i  N (0 ,  2 ) . The probability density function of the noise distribution can be written as p (  i ) = 1  2  e   2 i 2  2 . Our goal is to minimize the discrepancy between their outputs over f b,r defined as || f b,r ( x b +  )  f b,r ( x b ) || 2 . In our framework, we use a fixed position b as the position of noise injection and constrain the output distance on all layers following layer b . Regularzation is a kind of commonly used techniques to reduce the function complexity and, as a result, to make the learned model generalize well on unseen examples. In this part, we theoretically prove that the proposed LNSR algorithm has the effects of encouraging the local Lipschitz continuity and imposing a Tikhonov regularizer under different assumptions. For simplicity, we omit the notations about the layer number in this part, denoting f as the target function and x as the input of f parameterized by  . Given a sample ( x, y )  D , we discuss the general form of the noise stability defined as following: R (  ) = E  {(cid:107) f ( x +  )  f ( x ) (cid:107) 2 } . Lipschitz continuity . The Lipschitz property reflects the degree of smoothness for a function. Recent theoretical studies on deep learning has revealed the close connection between Lipschitz property and generalization (Bartlett et al., 2017; Neyshabur et al., 2017). (cid:107) f ( x +  )  f ( x ) (cid:107) 2 (cid:107) x +   x (cid:107) 2 . Thus the noise stability regularization can be regarded as minimizing the Lipschitz constant in a local region around the input x . Tikhonov regularizer . The Tikhonov regularizer (Willoughby, 1979) involves constraints on the derivatives of the objective function with respect to different orders. For the simplest first-order case, it can be regarded as imposing robustness and shaping a flatter loss surface at input, which makes the learned function smoother. Assuming that the magnitude of  is small, we can expand the first term as a Taylor approximation as: f ( x +  ) = f ( x )+   J f ( x )+12  T  H f ( x )   + O (  3 ) , (5) where J f ( x ) and H f ( x ) refer to the Jacobian and Hessian of f with respect to the input x respectively. Ignoring the higher order term O (  3 ) and denoting f k as the k-th output of the function f , we can rewrite the regularizer by substituting Eq. 5 in Eq. 3 as: R (  )= E  {(cid:107)   J f ( x ) + 1 2  T  H f ( x )   (cid:107) 2 } = (cid:90) (cid:107)   J f ( x ) + 1 2  T  H f ( x )   (cid:107) 2 p (  ) d = (cid:88) k (cid:90) (cid:107)   J f k ( x )+ 1 2  T  H f k ( x )   (cid:107) 2 p (  ) d. (6) We define the input vector x as ( x 1 , x 2 , ......, x d 1 ) and noise vector  as  = (  1 ,  2 , ......,  d 1 ) . Assuming that distributions of the noise and the input are irrelevant, and the derivative of f with respect to different elements of the input vector is independent with each other, we expand the second order term corresponding to the Jacobian as:  J ( f k ) = (cid:90) (cid:107)   J f k ( x ) (cid:107) 2 p (  ) d = (cid:90) (cid:88) i (  i f k x i ) 2 p (  ) d = (cid:88) i ( f k x i ) 2 (cid:90)  2 i p (  ) d =  2 (cid:107) J f k ( x ) (cid:107) 2 . (7) According to the characteristics of the Gaussian distribution, we also have (cid:90)  i  j p (  ) d = 0 for any i (cid:54) = j. Thus, we can rewrite the second order term corresponding to the Hessian in Eq. 6 as:  H ( f k ) = (cid:90) (cid:107) 1 2  T  H f k ( x )   (cid:107) 2 p (  ) d = (cid:90) 1 4 (cid:88) i (  2 i  2 f k x 2 i ) 2 p (  ) d = 1 4 (cid:88) i (  2 f k x 2 i ) 2 (cid:90)  4 i p (  ) d = C (cid:107) Tr( H f k ( x ) TH f k ( x )) (cid:107) 2 , (9) Where C is a constant independent of the input x . The third term generated from the expansion of Eq. 6 is zero as we have (cid:82)  3 p (  ) d = 0 . Thus we get R (  ) = (cid:88) k {  J ( f k ) +  H ( f k ) } . Considering that the input and output of the function f are both scalar variable, the Tikhonov regularization (Willoughby, 1979) takes the general form as: RT (  ) = (cid:88) r (cid:90) h r ( x )(  r f x r ) 2 dx. Eq. 10 shows that our proposed regularizer ensuring the noise stability is equivalent to a special case of the Tikhonov regularizer, where we involve the first and second order derivatives of the objective function f . An alternative for improving the robustness is to directly add noise to the input, without explicitly constraining the output stability. (Rifai et al., 2011) has derived that adding noise to the input has the effect of penalizing both the L 2 -norm of the Jacobian (cid:107) J f ( x ) (cid:107) 2 and the trace of the Hessian Tr( H f ( x )) , whereas the Hessian term is not constrained to be positive. While the regularizer brought by our proposed LNSR is guaranteed to be positive by involving the sum of squares of the first and second order derivatives. Moreover, our work relaxes the assumption of MSE regression loss required by (Rifai et al., 2011). By imposing the explicit constraint of noise stability on middle layer representations, we extend the theoretical understanding of noise stability into deep learning algorithms. Algorithm 1 Layer-wise Noise Stability Regularization (LNSR) Input: Training set D , perturbation bound  , learning rate  , number of layers L , number of training epochs N , function f and its corresponding parameters  , the position of noise injection b , and regularization weights for each layer {  b , ...,  L } . 1: Initialize  2: for epoch= 1 , 2 , ..., N do 3: for minibatch B  D do 4:  R  0 5: for each x  B do 6:   N (0 ,  2 ) 7:  x  x +  8: forward pass given x and  x as inputs 9: for r = b, b + 1 , ..., L do 10:  R   R +  b,r || f b,r ( x )  f b,r ( x ) || 2 11: end for 12: end for 13: g  1 | B | (cid:80) ( x,y )  [ L ( f ( x ;  ) , y ) +  R ] 14:     g 15: end for 16: end for Output:  4 Experiments In this section, we experimentally demostrate the effectiveness of LNSR method on text classification tasks over other regularization methods, and confirm that the insensitivity to noise promotes the generalizability and stability of BERT. We conduct experiments on four few-sample (less than 10k training samples) text classification tasks Corpus of Linguistic Acceptability (CoLA (Warstadt et al., 2019)) consists of English acceptability judgments drawn from books and journal articles on linguistic theory. Each example is a sequence of words annotated with whether it is a grammatical English sentence. This is a binary classification task and Matthews correlation coeffi-cient (MCC) (Matthews, 1975) is used to evaluate the performance. Microsoft Research Paraphrase Corpus (MRPC (Dolan and Brockett, 2005)) is a corpus of sentence pairs with human annotations for whether the sentences in the pair are semantically equivalent. The evaluation metrics is the average of F1 and Accuracy. Recognizing Textual Entailment (RTE (Wang et al., 2018)) (Dagan et al., 2005) (Bar-Haim et al., 2006) (Giampiccolo et al., 2007) is a corpus of textual entailment, and each example is a sentence pair annotated whether the first entails the second. The evaluation metrics is Accuracy. Semantic Textual Similarity Benchmark (STS-B (Cer et al., 2017))is a regression task. Each example is a sentence pair and is human-annotated with a similarity score from 1 to 5; the task is to predict these scores. The evaluation metrics is the average of Pearson and Spearman correlation coef-1 https://gluebenchmark.com/ ficients. We use BERT (Devlin et al., 2019), a large-scale bidirectional pre-trained language model as the base model in all experiments. We adopt pytorch edition implemented by Wolf et al. (2019). Fine-tuning . We use the standard BERT fine-tuning method described in Devlin et al. (2019). L 2 -SP (Li et al., 2018) is a regularization scheme that explicitly promotes the similarity of the final solution with the initial model. It is usually used for preventing pre-trained models from catastrophic forgetting. We adopt the form of ( w ) =  2 || w s  w 0 s || +  2 || w  s || . Mixout (Lee et al., 2020) is a stochastic regularization technique motivated by Dropout (Srivastava et al., 2014) and DropConnect (Wan et al., 2013). At each training iteration, each model parameter is replaced with its pre-trained value with probability p . The goal is to improve the generalizability of pre-trained language models. SMART (Jiang et al., 2020) imposes an smoothness regularizer inducing an adversarial manner to control the model complexity at the fine-tuning stage. It also employs a class of Bregman proximal point optimization methods to prevent the model from aggressively updating during fine-tuning. Our model is implemented using Pytorch based on Transformers framework 2 . Specifically, we use the learning setup and hyperparameters recommended by (Devlin et al., 2019). We use Hugging-face edition Adam (Kingma and Ba, 2015) optimizer (without bias correction) with learning rate of 2  10  5 ,  1 = 0 . 9 ,  2 = 0 . 999 , and warmup over the first 10% steps of the total steps. We finetune the entire model (340 million parameters), of which the vast majority start as pre-trained weights (BERT-Large-Uncased) and the classification layer (2048 parameters). Weights of the classification layer are initialized with N (0 , 0 . 02 2 ) . We train with a batch size of 32 for 3 epochs. More details of our experimental setup are described in Appendix A. 4.4 Overall Performance Table 1 shows the results of all the models on selected GLUE datasets. We train each dataset over 25 random seeds. To implement our LNSR, we uniformly inject noise at the first layer on BERT-large for the comparison with baseline models. As we can see from the table, our model outperforms all the baseline models in mean and max values, which indicates the stronger generalizability of our model against other baseline models. The p-values between the accuracy distributions of standard BERT fine-tuning and our model are calculated to verify whether the improvements are significant. We obtain very small p-values in all tasks: RTE: 9 . 7  10  7 , MRPC: 2 . 3  10  4 , CoLA: 4 . 7  10  8 , STS-2: 3 . 3  10  8 . Standard deviation is an indicator of the stability of models' performance and higher std means more sensitive to random seeds. Our model shows a lower standard deviation on each task, which means our model is less sensitive to random seeds than other models. Figure 2 presents a clearer illustration. To sum up, our proposed method can effectively improve the performance and stability of fine-tuning BERT. To verify the effectiveness of our proposed LNSR model, we conduct several ablation experiments including fine-tuning with more training epochs and 2 https://huggingface.co/transformers/index.html noise perturbation without regularization (we inject noise directly to the output of a specific layer, and then use the perturbed representation to conduct propagation and then calculate loss, this process is similar to a vector-space represent augmentation). The results are shown in Table 2. We observe that benefit obtained by longer training is limited. Similarly, fine-tuning with noise perturbation only achieves slightly better results on two of these tasks, showing that simply adding noise without an explicit restriction on outputs may not be sufficient to obtain good generalizability. While BERT models with LNSR perform better on each task. This veri-fies our claim that LNSR can promote the stability of BERT fine-tuning and meanwhile improve the generalizability of the BERT model. We verify the effects of our proposed method on the generalizability of BERT models in two ways  generalization gap and models' performance on fewer training samples. Due to the limited data and the extremely high complexity of BERT model, bad fine-tuning start point makes the adapted model overfit the training data and does not generalize well to unseen data. Generalizability of models can be intuitively reflected by generalization gap and models' performance on fewer training samples. Table 3 shows the mean training Acc, mean evaluation Acc and generalization gap of different models on each task. As we can see from the table, fine-tuning with LNSR can effectively narrow the RTE MRPC CoLA STS-B mean std max mean std max mean std max mean std max FT 70 . 13 1 . 84 72 . 56 87 . 57 0 . 92 89 . 16 61 . 56 1 . 34 64 . 10 89 . 38 0 . 53 90 . 23 FT (4 Epochs) 70 . 69 1 . 97 73 . 65 88 . 15 0 . 65 89 . 21 60 . 69 1 . 24 62 . 09 89 . 29 0 . 56 90 . 12 FT+Noise 70 . 62 1 . 56 72 . 93 87 . 95 0 . 83 89 . 33 60 . 18 1 . 58 62 . 59 89 . 34 0 . 51 90 . 11 LNSR (ours) 73 . 31 1 . 55 76 . 17 88 . 50 0 . 56 90 . 02 63 . 35 1 . 05 65 . 99 90 . 23 0 . 31 90 . 97 Table 2: Ablation study of LNSR on each task, we report the mean evaluation scores and standard deviation and max value across 25 random seeds. generalization gap, and achieve higher evaluation score. The effect of narrowing generalization gap is also reflected in Figure 3 where we can see the higher evaluation accuracy and lower evaluation loss. We sample subsets from the two relatively larger datasets CoLA (8.5k training samples) and STS-B (7k training samples) with the sampling ratio of 0.15, 0.3 and 0.5. As is shown in Figure 4, fine-tuning with LNSR shows clear advantage on fewer training samples, suggesting LNSR can effectively promote the model's generalizability. We briefly discuss about the sensitivity to the position of noise injection as it is a pre-determined hyperparameter of our method. As is shown in Figure 5 in Appendix A, we observe that the performance of LNSR does not fluctuate much as the position of noise injection changes. All injection positions bring significant improvements over vanilla fine-tuning. Note that, with LNSR, noise injection to the lower layers usually leads to relatively higher accuracy and stability, implying that LNSR may be more effective when it affects both the lower and higher layers of the network. Our method is related to SMART (Jiang et al., 2020), FreeLB (Zhu et al., 2020a) and R3F (Agha-Figure (Agha-Figure 4: Mean evaluation score comparison of fine-tuning BERT with and w/o LNSR on fewer training samples of the CoLA and STS-B tasks. The mean values are calculated over 20 random seeds. janyan et al., 2020). As is mentioned before, most of these approaches employ adversarial training strategies to improve the robustness of BERT fine-tuing. SMART solves supremum by using an adversarial methodology to achieve the largest KL divergence with an (cid:15) -ball, FreeLB optimizes a direct adversarial loss L FreeLB (  ) = sup   : |   | (cid:15) L (  +   ) through iterative gradient ascent steps, while R3F removes the adversarial nature of SMART and optimize the smoothness of the whole model directly. Compared with this sort of adversarial based algorithms, our method is easier to implement and provides a relatively rigorous theoretical guarantee. The design of layer-wise regularization is sensible that it exploits the characteristics of hierarchical representations in modern deep neural networks. Studies in knowledge distillation have shown similar experience that imitating through middle layer representations (Adriana et al., 2015; Zagoruyko and Komodakis, 2016) performs better than aligning the final outputs (Hinton et al., 2015). Moreover, LNSR allows us to use different regularization weights for different layers (we use fixed weight 1 on all layers in this paper). We will leave the exploitation in future work. In this paper, we propose the Layer-wise Noise Stability Regularization (LNSR) as a lightweight and effective method to improve the generalizability and stability when fine-tuning BERT on few training samples. Our proposed LNSR method is a general technique that improves model output stability while maintaining or improving the original performance. Furthermore, we provide a theoretically analysis of the relationship of our model to the Lipschitz continuity and Tikhonov regularizer. Extensive empirical results show that our proposed method can effectively improve the generalizability and stability of the BERT model. Hang Hua would like to thank Jeffries for supporting his research.
other abstain abstain abstain objective objective result abstain abstain abstain abstain abstain abstain abstain abstain method abstain result abstain abstain result abstain objective result result result objective objective objective objective objective abstain objective result other other other other other other other other other other other other other other other other other other other other other objective abstain abstain abstain abstain method objective abstain objective abstain method method abstain abstain objective method abstain abstain method method abstain abstain abstain abstain abstain abstain abstain abstain other abstain abstain other method method abstain abstain other abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain method method abstain abstain abstain abstain abstain abstain abstain abstain abstain other method method abstain method abstain abstain method abstain abstain abstain abstain abstain method method method abstain abstain method abstain method method method method method method method abstain abstain abstain abstain abstain method abstain method abstain other method abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain method abstain abstain abstain abstain abstain method abstain abstain abstain abstain method abstain abstain method method objective objective method objective other