<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Combining Ensembles of Multi-Input Multi-Output Subnetworks and Data Augmentation Does not Harm Your Calibration</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Cagr Demir</string-name>
          <email>cagri.a.demir@mytudublin.ie</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Simon Caton</string-name>
          <email>simon.caton@ucd.ie</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pierpaolo Dondio</string-name>
          <email>pierpaolo.dondio@tudublin.ie</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>School of Computer Science, Technological University Dublin</institution>
          ,
          <country country="IE">Ireland</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>School of Computer Science, University College Dublin</institution>
          ,
          <country country="IE">Ireland</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Ensembling neural network models is a common practice to increase model calibration and robustness. Likewise, data augmentation is a set of techniques used to enhance model calibration and robustness by introducing invariant feature transformations. However, the total effect of combining two methods is not well researched. There are contradicting results presented in the literature showing that combining some ensembling methods and data augmentation can result miss-calibrated models. In this paper, we aim to show that data augmentation does not degrade model calibration for ensembles of multi-input-multi-output subnetworks. We nd that combining ensembles of multi-input multi-output subnetworks with data augmentation increases accuracy without harming model calibration. Moreover, combining subnetwork ensembles with data augmentation also helps to achieve better uncertainty estimates. We designed and performed a factorial experiment consisting of 3 factors; data sets (Cifar-10, Cifar-100, Tiny ImageNet), ensembling frameworks (MIMO, Linear-MixMo, and Cut-MixMo), and data augmentation methods (MixUp and CutMix).</p>
      </abstract>
      <kwd-group>
        <kwd>Ensembles</kwd>
        <kwd>Uncertainty Estimates</kwd>
        <kwd>Calibration</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Deep learning models are starting to be used widely in safety-critical tasks such
as autonomous driving [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] and medical applications. However, the data that
models are trained and tested on can be di erent to the data used when these
models are deployed in real-world scenarios. In such situations, these models
need to be well-calibrated [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. Both ensembling and data augmentation
techniques have been shown to improve calibration, robustness, and model
performance [
        <xref ref-type="bibr" rid="ref13 ref17 ref9">9,13,17</xref>
        ]. However, we still do not fully understand the e ects (positive
or negative) of combining ensembles with data augmentation methods.
      </p>
      <p>
        Even simple averaging of the predictions can help reduce individual model
misclassi cations and other errors. There are di erent methods for ensembling
Copyright 2021 for this paper by its authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0)
models which have been shown to be e ective in improving accuracy and
robustness while not changing the total number of parameters signi cantly. Among
others, Ensembles of multi-input multi-output subnetworks (Subnetwork
Ensembles), BatchEnsemble [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] and its variants, and MC-dropout [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] are examples of
such e cient ensembling methods [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]. The idea behind training subnetworks
comes from sparsity. Recent deep learning models have millions of parameters.
      </p>
      <p>
        The overparametrization of deep learning models leads to the lottery ticket
hypothesis [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] and model pruning methods [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Instead of pruning a model to get a
subnetwork, Subnetwork Ensembles models take advantage of available neurons
and overparametrizaton with little structural changes turning a single network
into an ensemble of subnetworks. This method enables the generation of
ensembles while increasing the total number of parameters by less than 1%. However,
training such a model and ensuring independent subnetworks while sharing the
main network's parameters with no explicit structural di erence is a challenge.
      </p>
      <p>
        Data augmentation methods encompass a diverse set of methods from basic
geometric transformations of images to utilization of GANs [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. These
techniques try to emulate the distribution mismatch between the training and test
data by increasing diversity among training images. Increasing the quality and
quantity of image datasets helps to reduce neural networks' errors stemming from
overcon dence. Consequently, models using data augmentation are less prone to
over- tting and have better generalization capability [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Almost all state-of-art
vision models use one or a few data augmentation approaches.
      </p>
      <p>
        In theory, data augmentation is orthogonal to ensembling [
        <xref ref-type="bibr" rid="ref18 ref9">9,18</xref>
        ]. Both
ensembling and data augmentation increase accuracy, generalizability, and calibration.
      </p>
      <p>
        However, one can not directly combine ensembling and data augmentation
without further analysis. The ndings analyzing the interaction between ensembling
and data augmentation are mixed in the literature. [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] shows how combining
three ensembling methods (BatchEnsemble, MC-Dropout, and Deep Ensembles)
with two Data Augmentation methods (Mixup and Augmix) without structural
change on the said methods can harm the calibration of the model. However, [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]
states that their ndings do not con rm the pathology between ensembling and
data augmentation, but that combining the two methods increases calibration.
      </p>
      <p>In this paper, we try to clarify this con ict in the literature combining MIMO
and MixMo neural networks (Subnetwork Ensembles) with data augmentation,
and illustrate this combination does not harm model calibration while increasing
accuracy. Moreover, ensemble and data augmentation combination also helps to
achieve better uncertainty estimates. We con rmed this behavior across 3
different Subnetwork Ensembles frameworks and two data augmentation methods
on three datasets. We also test all models on corrupted Cifar-10 and Cifar-100
datasets and nd consistent results in the presence of corrupted data.
2
2.1</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <sec id="sec-2-1">
        <title>Ensembles</title>
        <p>
          Ensembling is a technique that takes advantage of diversity among di erent
models to improve their combined performance [
          <xref ref-type="bibr" rid="ref4">4</xref>
          ]. Even simple ensembling
(averaging predictions of randomly initialized neural networks) outperforms more
complicated models. [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ] show that deep ensembles trained independently
improve both accuracy and calibration. However, there are many approaches for
\ensembling" with BatchEnsemble, MC-Dropout, and Deep Subnetworks
suggested in the literature. In this paper, we focus on Subnetwork Ensembles models.
        </p>
        <p>Subnetwork Ensembles: Subnetwork Ensembles frameworks are based on
the idea of sparsity. Recent neural network models are overparametrized. This
leads to distilling and pruning methods to get a smaller network (\subnetwork")
of the original network without sacri cing performance. Subnetwork Ensembles
take advantage of these \free" subnetworks and utilizes them as an ensemble
of networks to improve model performances. Recently several Subnetwork
Ensembles frameworks have been proposed in the literature. MIMO and MixMo
frameworks are based on this idea: training subnetworks that independently
learn the task while utilizing a single model's capacity. The most distinctive
feature of Subnetwork Ensembles is that these models take multiple inputs and
predict them simultaneously. This structure allows them to exibly exploit the
base model's capacity stemming from overparametrization. However, how to
train models under Subnetwork Ensembles frameworks and combine the inputs
into a shared representation are still active areas of research.</p>
        <p>MIMO: In MIMO (Figure 1), the network takes M inputs and outputs M
outputs (predictions) where M is the number of desired subnetworks. MIMO
requires only two changes: input layer takes M images which are simply stacked
and output layer has M prediction vectors instead of a single one. In this sense,
MIMO uses channel-wise concatenation in pixels for the inputs. These inputs are
independently sampled from the training set and require no preprocessing. The
base network is trained to predict matching images simultaneously. Each
subnetwork learns to disregard features from other images. This ensures independence
of subnetworks. The loss is calculated according to corresponding labels. During
testing, the same input is repeated M times, and the outputs are averaged to get
the nal prediction. Clearly, MIMO does not need the neural network to have
large structural changes. In terms of network structure, it is enough to change
the rst convolutional and last dense layers.</p>
        <p>
          MixMo: MixMo (Figure 2) has a similar setting to MIMO but instead of
channel-wise concatenation of images in pixels, it rst encodes each image and
then employs a mixing block to combine inputs [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]. Inspired by mixing data
augmentation methods, MixMo uses a generalized multi-input mixing block to
combine inputs. In this regard, MixMo can be seen as a generalized form of
MIMO. Using identity encoding layers and choosing channel-wise concatenation
turns the MixMo framework into MIMO. However, the mixing block is not
limited to any speci c augmentation method; changing the mixing block results in
a di erent framework. Following [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ], we use MixUp and CutMix (see Figure 3)
to mix input images, which we refer to as Linear-MixMo and Cut-MixMo.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2 Data Augmentation</title>
        <p>Data Augmentation (DA) increases the training data by introducing small
perturbations or transformations (Figure 3). So models can be trained on more data.
DA helps capture invariant feature transformations and is also used to simulate
out-of-distribution data. Therefore, models utilizing DA tend to have better
calibration and accuracy resulting in a large uptake of DA in the literature.</p>
        <p>
          MixUp: MixUp is a simple data augmentation method which linearly
interpolates pixels while manipulating the labels at the same time. The idea behind
MixUp is that linear interpolations of feature vectors should lead to linear
interpolations of target labels [
          <xref ref-type="bibr" rid="ref22">22</xref>
          ]. By doing so, MixUp extends training distribution.
Given two random samples from training data (xi, yi) and (xj , yj ), when Mixup
is applied, we get (x~, y~) by:
x~ = λxi + (1 − λ)xj (1)
y~ = λyi + (1 − λ)yj
where λ is sampled from uniform distribution ∈ [
          <xref ref-type="bibr" rid="ref1">0, 1</xref>
          ].
        </p>
        <p>
          CutMix: CutMix creates new images by cutting patches from images and
pasting them among training images. CutMix also mixes the true labels
proportional to the area of the patches while patching. So a new training sample (x~, y~)
is generated by combining two training samples ((xa), (xb)) and ((xb), (yb)). The
combining operations are [
          <xref ref-type="bibr" rid="ref20">20</xref>
          ]:
x~ = M xa + (1 − M) xb (2)
y~ = λya + (1 − λ)yb
where M denotes a binary mask indicating where to drop out and ll in
from two images, 1 is a binary mask lled with ones, and is element-wise
multiplication. Like MixUp, λ is sampled from the uniform distribution (0, 1).
E ects of ensembling and data augmentations on image classi cation tasks are
well studied in the literature. However, we observe limited knowledge and
guidance on what would be the total e ect when these two seemingly orthogonal
methods are combined. Being one of the recent ensembling strategies,
Subnetwork Ensembles achieve ensembling by tting diverse subnetworks inside a single
base network. In this paper, we seek to provide some clarity on the e ects of
combining Subnetwork Ensembles with data augmentation methods and whether
this improves model accuracy without harming model calibration.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Methodology</title>
      <sec id="sec-3-1">
        <title>Experimental Design</title>
        <p>
          This paper seeks to understand the impact of combining Subnetwork Ensembles
with data augmentation. Ensembling and data augmentation are thought to
be independent of each other [
          <xref ref-type="bibr" rid="ref18 ref9">9,18</xref>
          ] while both methods are used to enhance
model performance. We try to verify [
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]'s hypothesis on ensembling and data
augmentation pathology. To do this, we perform a structured 3 x 3 x 2 factorial
experimental design consisting of 3 factors; data sets (3), Subnetwork Ensembles
frameworks (3), and data augmentation methods (2).
        </p>
        <p>
          We trained all models on the Cifar-10, Cifar-100, and Tiny ImageNet datasets.
Cifar-10 and Cifar-100 datasets both have 60k images (50k training and 10k test
images) and 10 and 100 classes respectively. To further push the models we use
Tiny ImageNet. Tiny ImageNet [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] is a downsampled variant of ImageNet as an
alternative to the Cifar datasets with 64x64 pixels and with 100k total images
and 200 classes (500 training, 50 validation, and 50 test images per class).
        </p>
        <p>
          As Subnetwork Ensembles frameworks, we utilized Multi-input Multi-output
(MIMO) [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] and two variants of MixMo [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] (Linear-MixMo and Cut-MixMo)
as explained in section 2. [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] introduces input repetition and batch repetition
during training. Input repetition helps subnetworks share the same features but
degrades diversity among subnetworks. Following the MixMo paper ([
          <xref ref-type="bibr" rid="ref16">16</xref>
          ]), we
don't utilize input repetition. Batch repetition has a regularization e ect on
the network training. MIMO nds batch repetition value b = 4 is optimal, and
MixMo also uses b = 4. Hence we do the same. One of the core components
of the subnetwork frameworks is the number of subnetworks. Since the original
network's capacity is limited, as the number of total subnetworks increases, after
an optimal number of subnetworks, the performance of the network decreases.
Both MIMO and MixMo nd that the optimal number of subnetworks is between
2 and 4 for the base models and datasets we utilized. Moreover, the number of
subnetworks also increases the training time. We choose the number of
subnetworks (M = 2) for all models. We follow the original papers for learning rate,
optimization algorithm, and batch size.
        </p>
        <p>To combine with Subnetwork Ensembles frameworks, we chose two common
data augmentation methods: MixUp and CutMix. We go beyond simple data
augmentations like ipping, rotation, pixel padding and use stronger
augmentations. Indeed, our data augmentation methods fall into Mixed Sample Data
Augmentation notion which basically manipulates both images and targets and
creates virtual samples ((xnew), (ynew)) given two pairs of input images ((xi), (yi))
and ((xj ), (yj )) (see: section 2). Data augmentations are performed during
training with the probability of 0.5 that a new training sample is generated.</p>
        <p>
          Setting aside e ects on performance, MIMO and MixMo frameworks can
utilize almost all neural network models as base models, with the ResNet family as
one of the most commonly used. Wide ResNets are known to have more sparsity
than the original ResNets, and this helps Subnetwork Ensembles frameworks to
better exploit its capacity. Following the original papers [
          <xref ref-type="bibr" rid="ref16 ref9">9,16</xref>
          ], all our models are
based on a ResNet model, as they are su ciently parameterized to enable good
performance for subnetwork models. For Cifar-10 and Cifar-100, the base model
is a WideResNet 28-10 (36.6 million parameters) [
          <xref ref-type="bibr" rid="ref21">21</xref>
          ] and for TinyImageNet the
base model is PreActResNet-18 (11.2 million parameters) [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ].
        </p>
        <p>
          Neural networks encounter a dramatic decrease in their performance when
they are tested against out-of-distribution data. After training all models with
the matching framework, in addition to IID test sets, we tested all models on
corrupted Cifar-10 and Cifar-100 test sets [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]. Images in this dataset are
perturbed with 19 di erent common corruption types (e.g. added blur,
compression artifacts, frost e ects etc.) at 5 di erent severity levels. Thus, the Cifar-10
or Cifar-100 test set has 19x5=95 di erent unseen variations emulating
out-ofdistribution data. A model which improves performance on this should indicate
general robustness gain and better calibration [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ].
3.2
        </p>
      </sec>
      <sec id="sec-3-2">
        <title>Performance Metrics: Calibration and Uncertainty Estimates</title>
        <p>
          Calibration is a notion which measures how a model's predictions match the
empirical frequency of the true probabilities [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. We say that a model is well
calibrated when a prediction of a class with con dence p is correct p% of the time.
A model can have high accuracy yet be a miss-calibrated one. That is calibration
and accuracy are two distinct phenomena. Measuring the predictive uncertainty
estimates and how well a model is calibrated is a challenging task since the
ground truth is not known. Therefore, we utilize two di erent metrics to measure
the calibration: Expected Calibration Error (ECE) and Negative Log-Likelihood
(NLL). We also use corrupted Cifar test sets to represent out-of-distribution
examples to evaluate model calibration from a domain shift perspective.
        </p>
        <p>
          By binning the predictions to M equally-spaced intervals and taking a
weightedaverage of each bins' accuracy, Expected Calibration Error (ECE) [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] measures
the absolute di erence between accuracy and predictive con dence, is widely
used in the literature, and de ned as follows:
        </p>
        <p>M
ECE = X |Bnm| |acc(Bm) − conf(Bm)| (3)</p>
        <p>m=1
where acc(Bm) is the average probability of the predicted and true class for
the bin m and conf (Bm) is the average con dence within (Bm).</p>
        <p>
          Negative log-likelihood (NLL) is a proper scoring rule [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. Scoring rules
measure the quality of predictive uncertainty and rewards better calibrated
predictions [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. So maximizing likelihood (minimizing NLL) increases calibration.
Given a probabilistic model π and n samples, NLL is de ned as:
L = −
n
X log(π^(yi|xi))
i=1
(4)
4
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Evaluation</title>
      <p>After setting the experimental design and training all models, we tested all
models on the respective test sets. We grouped our results for the metrics we
track according to datasets. Moreover, we tested all models on corrupted
Cifar10 and Cifar-100. We report the accuracy metrics as well as the ECE and NLL
metrics as discussed in section 3, which are averaged over 3 independent runs.
4.1</p>
      <sec id="sec-4-1">
        <title>Results on Cifar-10/100 and TinyImageNet</title>
        <p>Table 1 reports all model results tested on Cifar-10. Subnetwork Ensembles
frameworks show a performance boost in terms of accuracy compared to the base
models. They also improve calibration (lower ECE) and have better uncertainty
estimates (lower NLL). When MIMO and MixMo are trained with MixUp and
CutMix, model performance across all three metrics also increases. That is when
ensemble models are combined with data augmentation, they better estimate
uncertainty (lower NLL) and are better calibrated (lower ECE).</p>
        <p>Table 2 reports results for models trained and tested on Cifar-100.
Improvement in the metrics for Cifar-100 is similar to Cifar-10. Combining MixUp or
CutMix with one of MIMO or MixMo makes all models more performant (higher
accuracy) and better calibrated (lower NLL). Combining ensemble models with
data augmentation methods results in performance gains across all metrics.</p>
        <p>Table 3 reports results for models trained and tested on Tiny ImageNet. We
see that results still have the general tendency to be improved when ensembling</p>
        <sec id="sec-4-1-1">
          <title>Model</title>
        </sec>
        <sec id="sec-4-1-2">
          <title>Base Model</title>
        </sec>
        <sec id="sec-4-1-3">
          <title>Base Model</title>
        </sec>
        <sec id="sec-4-1-4">
          <title>Base Model MIMO MIMO MIMO</title>
        </sec>
        <sec id="sec-4-1-5">
          <title>Linear-MixMo</title>
        </sec>
        <sec id="sec-4-1-6">
          <title>Linear-MixMo</title>
        </sec>
        <sec id="sec-4-1-7">
          <title>Linear-MixMo</title>
        </sec>
        <sec id="sec-4-1-8">
          <title>Cut-MixMo</title>
        </sec>
        <sec id="sec-4-1-9">
          <title>Cut-MixMo</title>
        </sec>
        <sec id="sec-4-1-10">
          <title>Cut-MixMo</title>
        </sec>
        <sec id="sec-4-1-11">
          <title>Model</title>
        </sec>
        <sec id="sec-4-1-12">
          <title>Base Model</title>
        </sec>
        <sec id="sec-4-1-13">
          <title>Base Model</title>
        </sec>
        <sec id="sec-4-1-14">
          <title>Base Model MIMO MIMO MIMO</title>
        </sec>
        <sec id="sec-4-1-15">
          <title>Linear-MixMo</title>
        </sec>
        <sec id="sec-4-1-16">
          <title>Linear-MixMo</title>
        </sec>
        <sec id="sec-4-1-17">
          <title>Linear-MixMo</title>
        </sec>
        <sec id="sec-4-1-18">
          <title>Cut-MixMo</title>
        </sec>
        <sec id="sec-4-1-19">
          <title>Cut-MixMo</title>
        </sec>
        <sec id="sec-4-1-20">
          <title>Cut-MixMo</title>
          <p>is combined with data augmentation(s). Both MIMO and MixMo models have
higher accuracy and lower calibration error when one of the data augmentations
of MixUp and CutMix is added to the training. However, none of these combined
models can outperform the base model combined with only CutMix in terms of
accuracy. On the other hand, combining the base model with CutMix or MixUp
outputs the worst calibrated models. This stands as an interesting case for data
augmentation e ects on model accuracy and calibration.</p>
          <p>The test metrics on all three datasets imply that combining Subnetwork
Ensembles with data augmentation improves accuracy, lowers NLL, and lowers
ECE, i.e. combining them results in better performance and more calibrated
models. This behavior is consistent across all combinations of Subnetwork
Ensembles and data augmentations. Furthermore, combining Cut-MixMo and
CutMix tends to result in the highest performance and most robust model.</p>
        </sec>
        <sec id="sec-4-1-21">
          <title>Data Augmentation Accuracy(↑) NLL(↓) ECE(↓)</title>
          <p>Table 4 and Table 5 report results when all models are tested against corrupted
Cifar datasets. Clearly, compared to IID test sets (uncorrupted), performances of
all models on three metrics degrade. However, still, ensemble models with data
augmentations are more calibrated than models without data augmentations.</p>
          <p>When compared to the base model, Subnetwork Ensembles improve model
performance. Linear-MixMo, on the other hand, outperforms Cut-MixMo and
MIMO for all three metrics, in contrast to uncorrupted test sets. Using a data
augmentation method on a corrupted Cifar-10 test set improves performance
and calibration. All models combined with a data augmentation have higher
accuracy and lower NLL and ECE. Applying MixUp improves performance metrics
for all models more so than applying CutMix. Using only ensemble models or
data augmentation on a corrupted Cifar-100 test set yields higher accuracy and
lower NLL and ECE. Combining one of the MIMO or MixMo variants further
improves performance. Unlike corrupted Cifar-10, CutMix performs marginally
better than MixUp when used on top of the base model or in combination with
one of the Subnetwork Ensembles.</p>
          <p>To summarize, as in the case for uncorrupted test sets, utilizing Subnetwork
Ensembles or data augmentations alone still enhances accuracy and decreases
NLL and ECE. The best \combination" of Subnetwork Ensembles and data
augmentation for \any" dataset is not clear but combining Subnetwork Ensembles
with MixUp or CutMix almost always helps models further improve both model
accuracy and calibration (lower ECE). This implies combining Subnetwork
Ensembles with data augmentations will help model performance and calibration
in the presence of out-of-distribution data. The main takeaway of the
experiments with corrupted Cifar datasets is that combining Subnetwork Ensembles
with data augmentation improves calibration in line with accuracy and vice
versa. Finally, Figure 4 shows how ECE changes across each model family for all
datasets. Clearly, adding an ensemble framework or data augmentation method
improves model calibration. Moreover, combining Subnetwork Ensembles with
data augmentation further improves model calibration measured via ECE.</p>
        </sec>
        <sec id="sec-4-1-22">
          <title>Data Augmentation Accuracy(↑) NLL(↓) ECE(↓) Table 4. Performance results for WRN-28-10/CIFAR10-corrupted. Data Augmentation Accuracy(↑) NLL(↓) ECE(↓) Model</title>
        </sec>
        <sec id="sec-4-1-23">
          <title>Linear-MixMo</title>
        </sec>
        <sec id="sec-4-1-24">
          <title>Linear-MixMo</title>
        </sec>
        <sec id="sec-4-1-25">
          <title>Linear-MixMo</title>
        </sec>
        <sec id="sec-4-1-26">
          <title>Cut-MixMo</title>
        </sec>
        <sec id="sec-4-1-27">
          <title>Cut-MixMo</title>
        </sec>
        <sec id="sec-4-1-28">
          <title>Cut-MixMo</title>
        </sec>
        <sec id="sec-4-1-29">
          <title>Model</title>
        </sec>
        <sec id="sec-4-1-30">
          <title>Base Model</title>
        </sec>
        <sec id="sec-4-1-31">
          <title>Base Model</title>
        </sec>
        <sec id="sec-4-1-32">
          <title>Base Model MIMO MIMO MIMO</title>
        </sec>
        <sec id="sec-4-1-33">
          <title>Linear-MixMo</title>
        </sec>
        <sec id="sec-4-1-34">
          <title>Linear-MixMo</title>
        </sec>
        <sec id="sec-4-1-35">
          <title>Linear-MixMo</title>
        </sec>
        <sec id="sec-4-1-36">
          <title>Cut-MixMo</title>
        </sec>
        <sec id="sec-4-1-37">
          <title>Cut-MixMo</title>
        </sec>
        <sec id="sec-4-1-38">
          <title>Cut-MixMo</title>
          <p>Our experiments have illustrated that using Subnetwork Ensembles for data
augmentation alone improves model calibration and robustness. More importantly,
we nd that combining Subnetwork Ensembles with MixUp or CutMix improves
accuracy while not harming model calibration. Thus, adding some clarity to the
literature on this point, as we did not observe any trade-o between ensembling
and data augmentation for Subnetwork Ensembles. Rather, in our experiments,
we observed that combining Subnetwork Ensembles and data augmentation
improved calibration and uncertainty estimates. Our experiments with benchmark
corrupted datasets showed how the ndings are also robust with respect to
corruption since the minimum values for ECE and the NLL were obtained when
both data augmentation and Subnetwork Ensembles were used.</p>
          <p>Hence, combining Subnetwork Ensembles with data augmentation methods
for image classi cation tasks helps to improve performance without sacri cing
calibration. This situation signals a divergence on the e ects of combining
different methods for ensembling with data augmentation. Models trying to boost
performance should consider this discrepancy. Exploring this behavior divergence
(as future research) among ensembling methods when combined with data
augmentation could yield a better understanding of seemingly uncorrelated methods.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgments</title>
      <p>This publication has emanated from research conducted with the nancial
support of Science Foundation Ireland under Grant number 18/CRT/6183. For the
purpose of Open Access, the author has applied a CC BY public copyright
licence to any Author Accepted Manuscript version arising from this submission.
This work has been carried out using the ResearchIT Sonic cluster which was
funded by UCD IT Services and the Research O ce.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bojarski</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Del Testa</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dworakowski</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          , et al.:
          <article-title>End to end learning for selfdriving cars</article-title>
          .
          <source>ArXiv</source>
          (
          <year>2016</year>
          ), http://arxiv.org/abs/1604.07316
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Chrabaszcz</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Loshchilov</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hutter</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>A downsampled variant of imagenet as an alternative to the cifar datasets</article-title>
          .
          <source>ArXiv</source>
          (
          <year>2017</year>
          ), https://arxiv.org/abs/1707. 08819
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Degroot</surname>
            ,
            <given-names>M.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fienberg</surname>
            ,
            <given-names>S.E.</given-names>
          </string-name>
          :
          <article-title>The comparison and evaluation of forecasters</article-title>
          .
          <source>The Statistician</source>
          <volume>32</volume>
          ,
          <issue>12</issue>
          {
          <fpage>22</fpage>
          (
          <year>1983</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Dietterich</surname>
          </string-name>
          , T.G.:
          <article-title>Ensemble methods in machine learning</article-title>
          .
          <source>In: Multiple Classi er Systems</source>
          . pp.
          <volume>1</volume>
          {
          <fpage>15</fpage>
          . Springer Berlin Heidelberg, Berlin, Heidelberg (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Frankle</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carbin</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>The lottery ticket hypothesis: Finding sparse, trainable neural networks</article-title>
          .
          <source>In: International Conference on Learning Representations</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Gal</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ghahramani</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Dropout as a bayesian approximation: Representing model uncertainty in deep learning</article-title>
          .
          <source>In: Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48. ICML'16</source>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Gneiting</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Raftery</surname>
            ,
            <given-names>A.E.</given-names>
          </string-name>
          :
          <article-title>Strictly proper scoring rules, prediction, and estimation</article-title>
          .
          <source>Journal of the American Statistical Association</source>
          <volume>102</volume>
          ,
          <issue>359</issue>
          {
          <fpage>378</fpage>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Guo</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pleiss</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weinberger</surname>
            ,
            <given-names>K.Q.</given-names>
          </string-name>
          :
          <article-title>On calibration of modern neural networks</article-title>
          .
          <source>In: Proceedings of the 34th International Conference on Machine Learning. Proceedings of Machine Learning Research</source>
          , vol.
          <volume>70</volume>
          , pp.
          <volume>1321</volume>
          {
          <issue>1330</issue>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Havasi</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jenatton</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fort</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , et al.:
          <article-title>Training independent subnetworks for robust prediction</article-title>
          .
          <source>In: International Conference on Learning Representations</source>
          (
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>He</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ren</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , et al.:
          <article-title>Identity mappings in deep residual networks</article-title>
          .
          <source>In: Computer Vision { ECCV</source>
          <year>2016</year>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Hendrycks</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dietterich</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Benchmarking neural network robustness to common corruptions and perturbations</article-title>
          .
          <source>Proceedings of the International Conference on Learning Representations</source>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Hendrycks</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mu</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cubuk</surname>
            ,
            <given-names>E.D.</given-names>
          </string-name>
          , et al.:
          <article-title>Augmix: A simple method to improve robustness and uncertainty under data shift</article-title>
          .
          <source>In: International Conference on Learning Representations</source>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Lakshminarayanan</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pritzel</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Blundell</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Simple and scalable predictive uncertainty estimation using deep ensembles</article-title>
          .
          <source>In: Advances in Neural Information Processing Systems</source>
          . vol.
          <volume>30</volume>
          . Curran Associates, Inc. (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kadav</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Durdanovic</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Samet</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Graf</surname>
            ,
            <given-names>H.P.</given-names>
          </string-name>
          :
          <article-title>Pruning lters for e cient convnets</article-title>
          .
          <source>In: 5th International Conference on Learning Representations, ICLR</source>
          <year>2017</year>
          , Toulon, France,
          <source>April 24-26</source>
          ,
          <year>2017</year>
          , Conference Track Proceedings. OpenReview.net (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Naeini</surname>
            ,
            <given-names>M.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cooper</surname>
            ,
            <given-names>G.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hauskrecht</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Obtaining well calibrated probabilities using bayesian binning</article-title>
          .
          <source>In: Proceedings of the Twenty-Ninth AAAI Conference on Arti cial Intelligence</source>
          . p.
          <volume>2901</volume>
          {
          <issue>2907</issue>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Rame</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cord</surname>
            ,
            <given-names>M.:</given-names>
          </string-name>
          <article-title>MixMo: Mixing multiple inputs for multiple outputs via deep subnetworks</article-title>
          . In: ICCV (
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Shorten</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Khoshgoftaar</surname>
            ,
            <given-names>T.M.:</given-names>
          </string-name>
          <article-title>A survey on image data augmentation for deep learning</article-title>
          .
          <source>Journal of Big Data</source>
          <volume>6</volume>
          ,
          <issue>1</issue>
          {
          <fpage>48</fpage>
          (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Wen</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jerfel</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Muller</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , et al.:
          <article-title>Combining ensembles and data augmentation can harm your calibration</article-title>
          .
          <source>In: International Conference on Learning Representations</source>
          (
          <year>2021</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Wen</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tran</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ba</surname>
          </string-name>
          , J.:
          <article-title>Batchensemble: an alternative approach to e cient ensemble and lifelong learning</article-title>
          .
          <source>In: International Conference on Learning Representations</source>
          (
          <year>2020</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Yun</surname>
            , S., Han,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Oh</surname>
            ,
            <given-names>S.J.</given-names>
          </string-name>
          , et al.:
          <article-title>Cutmix: Regularization strategy to train strong classi ers with localizable features</article-title>
          .
          <source>In: International Conference on Computer Vision</source>
          (ICCV) (
          <year>2019</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Zagoruyko</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Komodakis</surname>
          </string-name>
          , N.:
          <article-title>Wide residual networks</article-title>
          .
          <source>In: Proceedings of the British Machine Vision Conference (BMVC)</source>
          . pp.
          <volume>87</volume>
          .
          <issue>1</issue>
          {
          <fpage>87</fpage>
          .12 (
          <year>September 2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , H.,
          <string-name>
            <surname>Cisse</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dauphin</surname>
            ,
            <given-names>Y.N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lopez-Paz</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <article-title>: mixup: Beyond empirical risk minimization</article-title>
          .
          <source>In: International Conference on Learning Representations</source>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>