D ATA AUGMENTATION INSTEAD OF EXPLICIT REGULARIZATION
Anonymous authors
Paper under double-blind review
A BSTRACT
Modern deep artiﬁcial neural networks have achieved impressive results through models with very large capacity—compared to the number of training examples— that control overﬁtting with the help of different forms of regularization.
Regularization can be implicit, as is the case of stochastic gradient descent or parameter sharing in convolutional layers, or explicit.
Most common explicit regularization techniques, such as dropout and weight decay, reduce the effective capacity of the model and typically require the use of deeper and wider architectures to compensate for the reduced capacity.
Although these techniques have been proven successful in terms of results, they seem to waste capacity.
In contrast, data augmentation techniques reduce the generalization error by increasing the number of training examples and without reducing the effective capacity.
In this paper we systematically analyze the effect of data augmentation on some popular architectures and conclude that data augmentation alone—without any other explicit regularization techniques—can achieve the same performance or higher as regularized models, especially when training with fewer examples.
I NTRODUCTION
Regularization plays a central role in machine learning.
Loosely deﬁned, regularization is any modiﬁcation applied to a learning algorithm that helps prevent overﬁtting and improve generalization.
Whereas in simple machine learning algorithms the sources of regularization can be easily identiﬁed as explicit terms in the objective function, in modern deep neural networks the sources of regularization are multiple and some of them are not explicit, but implicit.
Although the terms explicit and implicit regularization have been used recently in the literature (Neyshabur et al., 2014; Zhang et al., 2016), their distinction is rather subjective.
We propose the following deﬁnitions:
• Explicit regularization techniques are those speciﬁcally and solely designed to constrain the effective capacity of a given model and therefore reduce overﬁtting.
Besides, explicit regularizers are not a structural or essential part of the network architecture, the data or the learning algorithm and can typically be added or removed easily.
• Implicit regularization is the reduction
of overﬁtting or generalization error provided by characteristics of the network architecture, the training data or the learning algorithm, which are not speciﬁcally designed to constrain the effective capacity of the given model.
Examples of explicit regularizers are weight decay (Hanson & Pratt, 1989), which penalizes large weights; dropout (Srivastava et al., 2014), which randomly removes a fraction of the neural connections during training; or stochastic depth (Huang et al., 2016), which drops whole layers instead.
Implicit regularization effects are provided by the popular stochastic gradient descent (SGD) algorithm, which tends to converge to solutions with small norm (Zhang et al., 2016); convolutional layers, which impose parameter sharing based on prior knowledge about the data; batch normalization (Ioffe & Szegedy, 2015), whose main goal is reducing the the internal covariate shift, but also implicitly regularizes the model due to the noise in the batch estimates for mean and variance.
Driven by the efﬁcient use and development of GPUs, much research efforts have been devoted to ﬁnding ways of training deeper and wider networks of larger capacity (Simonyan & Zisserman,
2014; He et al., 2016; Zagoruyko & Komodakis, 2016), Ironically, their effective capacity is eventually reduced in practice by the use of weight decay and dropout, among other explicit regularizers.
It is known, for instance, that the gain in generalization provided by dropout comes at the cost of using larger models and training for longer (Goodfellow et al., 2016).
Hence, it seems that with such an approach deep networks are wasting capacity (Dauphin & Bengio, 2013).
As a matter of fact, unlike traditional machine learning models, deep neural networks seem not to need explicit regularizers to generalize well, as recently suggested by Zhang et al.
One popular technique that improves generalization is data augmentation.
Importantly, it differs from explicit regularizers mainly in that it does not reduce the effective capacity of the model.
Data augmentation is a very old practice in machine learning (Simard et al., 1992) and it has been identiﬁed as a critical component of many models (Ciresan et al., 2010; Krizhevsky et al., 2012; LeCun et al., 2015).
However, although some authors have reported the impact of data augmentation on the performance of their models and, in some cases, a comparison of different amount of augmentation (Graham, 2014) the literature lacks, to our knowledge, a systematic analysis of the impact of data augmentation on different models compared to the most popular regularization techniques.
1. O UR CONTRIBUTIONS
In this paper, we systematically analyze the role of data augmentation in deep neural networks for object recognition, compare it to some popular explicit regularization techniques, discuss its relationship with model capacity and test its potential to enhance learning from less training data.
1.1. D ATA AUGMENTATION AND EXPLICIT REGULARIZATION
Zhang et al.
(2016) recently raised the thought-provoking idea that explicit regularization may improve generalization performance, but is neither necessary nor by itself sufﬁcient for controlling generalization error.
They came to this conclusion from the observation that turning off the explicit regularizers of a model does not prevent the model from generalizing, although the performance becomes degraded.
This contrasts with traditional machine learning involving convex optimization, where regularization is necessary to avoid overﬁtting.
However, in Zhang et al.
(2016) data augmentation is considered an explicit form of regularization similar to weight decay and dropout.
We instead believe that data augmentation deserves a different classiﬁcation because of some fundamental properties: Notably, data augmentation does not reduce the effective capacity of the model.
Explicit regularizers are often used to counteract overﬁtting, but as a side effect the architecture needs to be larger and the training process longer (Krizhevsky et al., 2012; Goodfellow et al., 2016).
In contrast, data augmentation increases the number of training examples—although not in an independently distributed way—and the robustness against input variability.
This has the welcome side-effect of implicitly regularizing the model and improving generalization.
Here, we build upon some of the ideas and procedures from Zhang et al.
and perform some experiments to assess the role of data augmentation in deep neural neural networks and in particular in contrast to explicit regularizers (weight decay and dropout).
In our experiments, we consider two levels of augmentation, light and heavier, as well as no augmentation at all.
Then, we test them on two popular successful network architectures: the relatively shallow all convolutional network net (Springenberg et al., 2014) and the deeper wide residual network (Zagoruyko & Komodakis, 2016), trained on CIFAR-10 and CIFAR-100 (Krizhevsky & Hinton, 2009).
Our central conclusion can be summarized as:
In a deep convolutional neural network trained with sufﬁcient level of data augmentation, optimized by SGD, explicit regularizers (weight decay and dropout) might not provide any additional generalization improvement.
1.1. D ATA AUGMENTATION AND TRAINING WITH FEWER EXAMPLES
Augmented data might be regarded as artiﬁcial and very similar to the source examples, therefore with limited contribution for making a network learn more useful representations.
However, it has proven to be very useful in extreme cases such as one-shot learning, where only one or few training
In order to provide a better insight of the usefulness of data augmentation, we train the networks with 80%, 50 % and 10 % of the available data and test the effect of data augmentation, again in contrast to explicit regularizers.
The summary of our ﬁndings in this regard can be summarized as:
When a deep neural network is trained with a subset of the training data, the heavier the data augmentation, the smaller the gap with respect to the baseline model, especially if no explicit regularization is used.
Thus, data augmentation seems to serve as true data to a great extent.
1.1. D ATA AUGMENTATION AND ADAPTABILITY
One of the disadvantages of explicit regularization is that the parameters highly depend on the architecture.
Therefore, if the architecture changes, one has to ﬁne tune the regularization parameters to achieve comparable results.
In order to analyze how data augmentation adapts to different architectures, we test several augmentation schemes on shallower and deeper versions of the network, with and without explicit regularization.
Our ﬁnding is the following:
Data augmentation easily adapts to different depths without tuning its parameters if no explicit regularization is used.
We observe that a shallower network achieves slightly worse results and a deeper architecture achieves better results.
1. R ELATED WORK
Regularization is a central research topic in machine learning as it is a key component for ensuring good generalization (Girosi et al., 1995; M¨uller, 2012).
In the case of deep learning, where networks tend to have several orders of magnitude more parameters than training examples, statistical learning theory (Vapnik & Chervonenkis, 1971) indicates that regularization becomes even more crucial.
Accordingly, a myriad of tools and techniques have been proposed as regularizers: early stopping (Plaut et al., 1986), weight decay (Hanson & Pratt, 1989) and other L p penalties, dropout (Srivastava et al., 2014) or stochastic depth (Huang et al., 2016), to name a few examples.
Besides, other successful techniques have been studied for their regularization effect, despite not being explicitly intended as such.
That is the case of unsupervised pre-training (Erhan et al., 2010), multi-task learning (Caruana, 1998), convolutional layers (LeCun et al., 1990), batch normalization (Ioffe &
Szegedy, 2015) or adversarial training (Szegedy et al., 2013).
Data augmentation is another almost ubiquitous technique in deep learning, especially in computer vision, which can be regarded as a regularizer because it improves regularization.
It was already used in the late 80’s and early 90’s for handwritten digit recognition (Simard et al., 1992) and it has been identiﬁed as a very important element of many modern successful models, like AlexNet (Krizhevsky et al., 2012), All-CNN (Springenberg et al., 2014) or ResNet (He et al., 2016), for instance.
In some cases, data augmentation has been applied heavily with successful results (Wu et al., 2015).
In domains other than computer vision, data augmentation has also been proven effective, for example in speech recognition (Jaitly & Hinton, 2013), music source separation (Uhlich et al., 2017) or text categorization (Lu et al., 2006).
Bengio et al.
(2011) focused on the importance of data augmentation for recognizing handwritten digits (MNIST) through greedy layer-wise unsupervised pre-training (Bengio et al., 2007).
The main conclusion of that work was that deeper architectures beneﬁt more from data augmentation than shallow networks.
Zhang et al.
(2016) included data augmentation in their analysis of the role of regularization in the generalization of deep networks, although it was considered an explicit regularizer similar to weight decay and dropout.
A few works have reported the performance of their models when trained with different types of data augmentation levels, as is the case of Graham (2014).
Recently, the deep learning community seems to have become more aware of the importance of data augmentation and new techniques, such as cutout (DeVries & Taylor, 2017a) or augmentation in the feature space (DeVries & Taylor, 2017b), have been proposed.
Very interestingly, models that automatically learn useful data transformations have also been published very recently (Hauberg et al., 2016;
Lemley et al., 2017; Ratner et al., 2017).
E XPERIMENTS AND RESULTS
This section describes the experimental setup for systematically analyzing the role of data augmentation in modern deep neural networks and presents the most relevant and interesting results.
2. S ETUP
All the experiments are performed on the neural networks API Keras (Chollet et al., 2015) on top of
TensorFlow (Abadi et al., 2015) and on a single GPU NVIDIA GeForce GTX 1080 Ti.
2.1. N ETWORK ACRCHITECTURES
We perform our experiments on two popular architectures that have achieved successful results in object recognition tasks: the all convolutional network, All-CNN (Springenberg et al., 2014) and the wide residual network, WRN (Zagoruyko & Komodakis, 2016).
We choose these networks not only because of their effectiveness, but also because they have simple architectures, which is convenient for drawing clearer conclusions.
All-CNN has a relatively small number of layers and parameters, whereas WRN is rather deep and has many more parameters.
All convolutional net.
All-CNN consists of only convolutional layers with ReLU activations (Glorot et al., 2011), it is relatively shallow (12 layers) and has about 1.3 M parameters.
The architecture can be described as follows:
[Equation]
where K C D ( S ) is a D × D convolutional layer with K channels and stride S , followed by batch normalization and a ReLU non-linearity.
N.Cl. is the number of classes and Gl.
Avg.
refers to global average pooling.
The network is identical to the All-CNN-C architecture in the original paper, except for the introduction of the batch normalization layers.
We set the same training parameters as in the original paper in the cases they are reported.
Speciﬁcally, in all experiments the All-CNN networks are trained using stochastic gradient descent with batch size of 128, during 350 epochs, with ﬁxed momentum 0.9 and learning rate of 0.01 multiplied by 0.1 at epochs 200, 250 and 300.
The kernel parameters are initialized according to the Xavier uniform initialization (Glorot & Bengio, 2010).
Wide Residual Network.
WRN is a modiﬁcation of ResNet (He et al., 2016) that achieves better performance with fewer layers, but more units per layer.
Although in the original paper several combinations of depth and width are tested, here we choose for our experiments the WRN-28version (28 layers and about 36.5 M parameters), which is reported to achieve the best results on
CIFAR.
It has the following architecture:
[Equation]
where K R is a residual block with residual function BN–ReLU– K C3(1)–BN–ReLU– K C3(1).
BN is batch normalization, Avg.(8) is spatial average pooling of size 8 and FC is a fully connected layer.
The stride of the ﬁrst convolution within the residual blocks is 1 except in the ﬁrst block of the series of 4, where it is 2 to subsample the feature maps.
As before, we try to replicate the training parameters of the original paper: we use SGD with batch size of 128, during 200 epochs, with ﬁxed
Nesterov momentum 0.9 and learning rate of 0.1 multiplied by 0.2 at epochs 60, 120 and 160.
The kernel parameters are initialized according to the He normal initialization (He et al., 2015).
2.1. D ATA
We perform the experiments on the two highly benchmarked data sets CIFAR-10 and CIFAR-
(Krizhevsky & Hinton, 2009), which are labeled according to 10 and 100 object classes respectively.
Both data sets consist of 60,000 32 x 32 color images split into 50,000 for training and 10, for testing.
In all our experiments, the input images are fed into the network with pixel values normalized to the range [0 , 1] and with ﬂoating precision of 32 bits.
So as to analyze the role of data augmentation, we test the network architectures presented above with two different augmentation schemes as well as with no data augmentation at all:
[Table]
Light augmentation.
This scheme is adopted from previous works, for example (Goodfellow et al., 2013; Springenberg et al., 2014)
[Table]
and performs only horizontal ﬂips and horizontal and vertical translations of 10% of the image size.
Heavier augmentation.
This scheme performs a larger range of afﬁne transformations, as well as contrast and brightness adjustment:
• Afﬁne transformations:
[Equation]
• Contrast adjustment: x (cid:48) =
[Equation]
−
[Equation]
+ x • Brightness adjustment: x (cid:48) =
[Equation]
+ δ
The description and range of values of the parameters are speciﬁed in Table 1 and some examples of transformed images with extreme values of the parameters are provided in Figure 1.
[Figure]
2. A SUBSTITUTE FOR EXPLICIT REGULARIZATION
In order to analyze the role of data augmentation and test the hypothesis that it might serve as a substitute for explicit regularization techniques we ﬁrst try to replicate the results of All-CNN and
WRN provided in the original papers, achieved with both weight decay and dropout.
Then, we train the models without weight decay and ﬁnally without neither weight decay nor dropout.
We test all these different models with the three data augmentation schemes presented above: light, heavier and no augmentation.
Additionally, in many cases we test the effect of removing the batch normalization.
As reported by previous works (Krizhevsky et al., 2012; Simonyan & Zisserman, 2014), when the models are trained with data augmentation, at test time slightly better results are obtained by augmenting the test set as well.
Therefore, the test accuracy reported here comes from the averaged softmax posteriors over 10 random light augmentations.
The main results of the different experiments are shown in Figure 2 (blue bars) and the full report of all experiments can be found in Table 2 of the appendix.
As expected, both explicit regularization —weight decay and dropout—and data augmentation are successful in reducing the generalization error.
However, some relevant observations can be made.
Most notably, it seems that data augmentation alone is able to regularize the model as much as in combination with weight decay and dropout and in some cases it clearly achieves better performance, as in the case of All-CNN.
Another observation is that without explicit regularization, heavier augmentation always provides better results than light augmentation, whereas with regularization this effect is counterintuitively not consistent.
2. F EWER AVAILABLE TRAINING EXAMPLES
We extend the analysis of the data augmentation role by training the same networks with fewer training examples.
Similarly, we also analyze the combination of data augmentation and explicit regularization in this case.
All models are trained with the same random subset of data and tested in the same test set as the previous experiments in order to enable fairer comparisons.
Figure 2 (green and red bars) shows the main results with 50 % and 10 % of the available data and the full report, as well as additional experiments with 80 % and 1 % of the data, is given in Table 3 of the Appendix A.
As expected, the performance decays with the number of available training examples.
However, as the level of data augmentation increases, the difference with respect to the baseline performance (by training with all examples) signiﬁcantly decreases.
This indicates that data augmentation serves, to a great extent, as true data.
Therefore, this conﬁrms the effectiveness of this technique when not many training examples are available.
Furthermore, in all the experiments with a reduced set of the available data, the observations presented above become even clearer.
It seems that if explicit regularization is removed, data augmentation alone better resists the lack of data.
This can probably be explained by the fact that explicit regularization reduces the effective capacity, preventing the model from taking advantage of the augmented data.
2. S HALLOWER AND DEEPER ARCHITECTURES
Finally, we perform the same experiments on shallower and deeper versions of All-CNN, so as to analyze how data augmentation and regularization are handled by architectures of different depth.
We test a shallower network with 9 layers instead of 12 and 374 K parameters instead of 1.3 M: 2 × 96C3(1)–96C3(2)–192C3(1)–192C1(1)– N.Cl .C1(1)–Gl.
Avg.–Softmax and a deeper network with 15 layers and 2.4 M parameters:
[Equation]
The results in Figure 2 (purple and brown bars) together with the detailed report of results in Tableof the appendix show that if the explicit regularization is removed and data augmentation applied, the shallower network achieves slightly worse results and the deeper network slightly better results than the original network.
This behavior can be explained by the reduced or increased depth and number of parameters.
However, with the explicit regularization active, the results dramatically decrease in both cases.
The most probable explanation is that the regularization parameters are not adjusted to the architecture, whereas in the original models the parameters where ﬁnely tuned by the authors to obtain state of the art results.
This highlights another important advantage of data augmentation: the adjustment of its parameters depends mostly on the training data, rather than on the particular architecture, which offers much more ﬂexibility compared to using explicit regularization.
In Appendix B we provide ananalysis of the norm of the weight matrices that helps shed some more light on how the different levels of regularization and data augmentation affect the learned models.
D ISCUSSION AND C ONCLUSION
In this work, we have presented a systematic analysis of the role of data augmentation in deep neural networks for object recognition, focusing on the comparison with popular techniques of explicit regularization.
We have built upon the work by Zhang et al.
(2016), in which the authors concluded that explicit regularization is not necessary, although it improves generalization performance.
Here, we have shown that it is not only unnecessary, but also that the generalization gain provided by explicit regularization can be achieved by data augmentation alone.
The importance of these results lies in the fact that explicit regularization is the standard tool to enable the generalization of most machine learning methods.
However, according to Zhang et al.
(2016), explicit regularization plays a different role in deep learning, not explained by statistical learning theory (Vapnik & Chervonenkis, 1971).
We argue instead that the theory still holds in deep learning, but one has to properly consider the very important role of implicit regularization.
Explicit regularization is no longer necessary because its contribution is already provided by the many elements that implicitly regularize deep neural networks: stochastic gradient descent, convolutional layers or data augmentation, among others.
Whereas explicit regularizers, such as weight decay and dropout, succeed in mitigating overﬁtting by blindly reducing the effective capacity of a model, implicit regularization operates more effectively at capturing important characteristics of the data (Neyshabur et al., 2014).
For instance, convolutional layers successfully reduce the capacity of a model by imposing a parameter sharing strategy that incorporates some essential prior domain knowledge, as well as data augmentation by transforming the training examples in a meaningful and plausible way.
In this regard it is worth highlighting some of the advantages of data augmentation, which is the main concern of this work.
Not only does data set augmentation not reduce the effective capacity of the model, but it increases the number of training examples, which, according to statistical learning theories, reduces the generalization error.
Furthermore, if the transformations are such that they reﬂect the variations of the real world, it increases the robustness of the model and it can be regarded as a data-dependent prior, similarly to unsupervised pre-training (Erhan et al., 2010).
Besides, unlike explicit regularization techniques, data augmentation does not increase the computational complexity because it can be performed in parallel to the gradient updates on the CPU, making it a computationally free operation.
Finally, in Section 2.4 we have shown how data augmentation adapts smoothly to architectures of different depth, whereas explicitly regularized models need manual adjustment of the regularization parameters.
Deep neural networks can especially beneﬁt from data augmentation because they do not rely on precomputed features and because the large number of parameters allows them to shatter the augmented training set.
Actually, if data augmentation is included for training, we might have to reconsider whether deep learning operates in an overparameterization regime, since the model capacity should take into account the amount of training data, which is exponentially increased by augmentation.
One may think that despite the advantages of data augmentation, it is a limited approach because it depends on some prior expert knowledge and it cannot be applied to all domains.
However, we argue instead that expert knowledge should not be disregarded but exploited.
Besides, some recent works show that it is possible to learn the data augmentation strategies (Lemley et al., 2017; Ratner et al., 2017) and future research will probably yield even better results.
Finally, it is important to note that, due to computational limitations, we have performed a systematic analysis only on CIFAR-10 and CIFAR-100, which consist of very small images.
These data sets do not allow performing more agressive data augmentation since the low resolution images can easily show distortions that hinder the recognition of the object.
However, some previous works (Graham, 2014; Springenberg et al., 2014) have shown impressive results by performing heavier data augmentation on higher resolution versions on CIFAR-10.
We plan to extend this analysis to higher resolution data sets such as ImageNet and one could expect even more beneﬁts from data augmentation compared to explicit regularization techniques.
A CKNOWLEDGMENTS
This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska grant
A E XTENDED AND DETAILED EXPERIMENTAL RESULTS
This appendix details the results of the main experiments shown in Figure 2 and provides the results of many other experiments.
For example, the results of the models trained with dropout, but without weight decay are only provided here.
Similarly, the results of training with 80 % and 1 % of the data are not shown in Figure 2 either due to space limitations.
Additionally, for most experiments we train a version of the network without batch normalization.
These results are provided within brackets in the tables.
Note that the original All-CNN results published by Springenberg et al.
(2014) did not include batch normalization.
In the case of WRN, we remove all batch normalization layers except the top-most one, before the spatial average pooling, since otherwise many models would not converge.
[Table]
An important observation from Table 2 is that the interaction of weight decay and dropout is not always consistent, since in some cases better results are obtained with both explicit regularizers active and in other cases, only dropout achieves better generalization.
However, the effect of data augmentation seems to be clearer: just some light augmentation achieves much better results than training only with the original data set and performing heavier augmentation almost always further improves the test accuracy, without the need for explicit regularization.
Not surprisingly, batch normalization also contributes to improve the generalization of All-CNN and it seems to combine well with data augmentation.
On the contrary, when combined with explicit regularization the results are surprisingly not consistent in the case of All-CNN: it seems to improve the generalization of the model trained with both weight decay and dropout, but it drastically reduces the performance with only dropout, in the case of CIFAR-10 and CIFAR-100 without augmentation.
A probable explanation is, again, that the regularization hyperparameteres would need to be readjusted with a change of the architecture.
Furthermore, it seems that the gap between the performance of the models trained with and without batch normalization is smaller when they are trained without explicit regularization and when they include heavier data augmentation.
This can be observed in both Table 2 and Table 3, which contains the results of the models trained with fewer examples.
It is important to note as well the beneﬁts of batch normalization for obtaining better results when training with fewer examples.
However, it is surprising that there is only a small drop in the performance of WRN—95.47 % to 94.95 % without regularization— from removing the batch normalization layers of the residual blocks, given that they were identiﬁed as key components for training deep residual networks (He et al., 2016;
Zagoruyko & Komodakis, 2016).
[Table] The results in Table 3 clearly support the conclusion presented in Section 2.3: data augmentation alone resists better the lack of training data compared to explicit regularizers.
Already with 80% and
[Table]
50% of the data better results are obtained in some cases, but the differences become much bigger when training with only 10% and 1% of the available data.
It seems that explicit regularization prevents the model from both ﬁtting the data and generalizing well, whereas data augmentation provides useful transformed examples.
Interestingly, with only 1% of the data, even without data augmentation the models without explicit regularization perform better.
The same effect can be observed in Table
[Table]
where both the shallower and deeper versions of AllCNN perform much worse when trained with explicit regularization, even when trained without data augmentation.
This is another piece of evidence that explicit regularization needs to be used very carefully, it requires a proper tuning of the hyperparameters and is not always beneﬁtial.
B N ORM OF THE WEIGHT MATRIX
[Table]
One of the simplest way of getting a rough idea of the complexity of the models learned is computing the norm of the weight matrix.
Table 5 shows the Frobenius norm of the weight matrices
[Table] of the models trained with different levels of explicit regularization and data augmentation. The clearest conclusion is that heavier data augmentation seems to yield solutions with bigger norm. This is always true except in some All-CNN models trained without batch normalization.
Another observation is that, as expected, weight decay constrains the norm of the learned function.
Besides, the models trained without batch normalization exhibit smaller differences between different levels of regularization and augmentation and, in the case of All-CNN, less consistency.
One of the relevant results presented in this paper is the poor performance of the regularized models on the shallower and deeper versions of All-CNN, compared to the models without explicit regularization (see Table 4).
One hypothesis is that the amount of regularization is not properly adjusted through the hyperparameters. This could be reﬂected in the norm of the learned weights, shown in Table 6. However, the norm alone does not seem to explain the large performance differences between the different models. Finding the exact reasons why the regularized models not able to generalize well might require a much thourough analysis and we leave it as future work.