Masksembles for Uncertainty Estimation

Deep neural networks have amply demonstrated their prowess but estimating the reliability of their predictions remains challenging. Deep Ensembles are widely considered as being one of the best methods for generating uncertainty estimates but are very expensive to train and evaluate. MC-Dropout is another popular alternative, which is less expensive, but also less reliable. Our central intuition is that there is a continuous spectrum of ensemble-like models of which MC-Dropout and Deep Ensembles are extreme examples. The first uses an effectively infinite number of highly correlated models while the second relies on a finite number of independent models. To combine the benefits of both, we introduce Masksembles. Instead of randomly dropping parts of the network as in MC-dropout, Masksemble relies on a fixed number of binary masks, which are parameterized in a way that allows to change correlations between individual models. Namely, by controlling the overlap between the masks and their density one can choose the optimal configuration for the task at hand. This leads to a simple and easy to implement method with performance on par with Ensembles at a fraction of the cost. We experimentally validate Masksembles on two widely used datasets, CIFAR10 and ImageNet.


Introduction
The ability of deep neural networks to produce useful predictions is now abundantly clear [50,4,44,47,8,9,25,31] but assessing the reliability of these predictions remains a challenge. Among all the methods that can be used to this end, MC-Dropout [12] and Deep Ensembles [32] have emerged as two of the most popular ones. Both of those methods exploit the concept of ensembles to produce uncertainty estimates. MC-Dropout does so implicitly -by train-* This work was supported in part by the Swiss National Science Foundation ing a single stochastic network [14,51,29], where randomness is achieved by dropping different subsets of weights for each observed sample. At test time, one can obtain multiple predictions by running this network multiple times, each time with a different weight configuration. Deep Ensembles, on the other hand, build an explicit ensemble of models, where each model is randomly initialized and trained independently using stochastic gradient descent [46,28]. As importantly, both methods rely on the fact that the outputs of individual models are diverse, which is achieved by introducing stochasticity into the training or testing process.
However, simply adding randomness does not always lead to diverse predictions. In practice, MC-Dropout often performs significantly worse than Deep Ensembles on uncertainty estimation tasks [32,40,17]. We argue that this can be attributed to the fact that each weight is dropped randomly and independently from the others. For many configurations of hyperparameters, in particular the dropout rate, this results in similar weight configurations and, consequently, less diverse predictions [10]. Deep Ensembles seem to not share this weakness for reasons that are not yet fully understood and usually produce significantly more reliable uncertainty estimates. Unfortunately, this comes at a price, both at training and inference time: Building an ensemble requires training multiple models, and using it means loading all of them simultaneously in memory, typically a very scarce resource.
In this work, we introduce Masksembles, an approach to uncertainty estimation that tackles these challenges and produces reliable uncertainty estimates on par with Deep Ensembles at a significantly lower computational cost. The main idea behind the method is simple -to introduce a more structured way to drop model parameters than that of MC-Dropout.
Masksembles produces a fixed number of binary masks which specify the network parameters to be dropped. The properties of the masks effectively define the properties of the final ensemble in terms of capacity and correlations.
During training, for each sample, we randomly choose one of the masks and drop the corresponding parts of the model just like a standard dropout. During inference, we run the model multiple times, once per mask, to obtain a set of predictions and, ultimately, an uncertainty estimate. Our method has three key hyperparameters: the total number of masks, the average overlap between masks and the number of ones and zeros in each mask. Intuitively, using a large number of masks approximates MC-Dropout, while using a set of non-overlapping, completely disjoint masks yields an Ensemble-like behavior. In other words, as illustrated in Fig. 5 Masksembles defines a spectrum of model configurations of which MC-Dropout and Deep Ensembles can be seen as extreme cases. We evaluate our method on several synthetic and real datasets and demonstrate that it outperforms MC-Dropout in terms of accuracy, calibration, and out-of-distribution (OOD) detection performance. When compared to Deep Ensembles, our method has similar performance but is more favorable in terms of training time and memory requirements. Furthermore, Masksembles is simple to implement and can serve as a drop-in replacement for MC-Dropout in virtually any model. To summarize, the main contributions of this work are as follows: • We propose an easy to implement, drop-in replacement method that performs better than MC-Dropout, at a similar computational cost, and that matches Ensembles at a fraction of the cost.
• We provide theoretical insight into two popular uncertainty estimation methods -MC-Dropout and Ensembles, by creating a continuum between the two.
• We provide a comprehensive evaluation of our method on several public datasets. This validates our claims and guides the choice of Masksemble parameters in practical applications.

Related Work
MC-Dropout [12] and Deep Ensembles [32] have emerged as two of the most prominent and practical uncertainty estimation methods for deep neural networks [1,40,17]. In what follows, we provide a brief background on uncertainty estimation, review the best-known methods, and discuss potential alternatives [53,20,2,37,36].

Background
The goal of Uncertainty Estimation (UE) is to produce a measure of confidence for model predictions. Two major types of uncertainty can be modeled within the Bayesian framework [7]. Aleatoric uncertainty, also known as Data uncertainty [11], captures noise that arises from data and therefore is irreducible, because the natural complexity of the data directly causes it. Sensor noise, labels noise, and classes overlapping are among the most common sources of aleatoric uncertainty. Epistemic uncertainty or model uncertainty [11] accounts for uncertainty in the parameters of the model that we learned, that is, it represents our ignorance about parameters of the data generation process. This type of uncertainty is reducible and therefore, given enough data, could be eliminated entirely. In addition to the aforementioned types of uncertainty, there is also Distributional uncertainty. Also known as dataset shift [43], this type of uncertainty is useful when there is a mismatch between the training and testing data distributions, and a model is confronted with unfamiliar samples.
For all the aforementioned types of uncertainty, ideally we want our model to output an additional signal indicating how reliable its prediction is for a particular sample. More formally, given an input, we want our model to output the actual prediction target as well as the corresponding uncertainty measure. For regression tasks, the uncertainty measure can be the variance or confidence intervals around the prediction made by the network [41]. For classification tasks, popular uncertainty measures are the entropy and max-probability [37,33]. Ideally, the measure of uncertainty should be high when the model is incapable of producing accurate prediction for the given input and low otherwise. Generally speaking, uncertainty can be either learned from the data directly [33,27], in particular for big data regimes and aleatoric uncertainty, or could be acquired from a diverse set of predictions [12,33], which are obtained from stochastic regularization techniques or ensembles. In this work, we focus on the latter family of methods.

Ensembles
Deep Ensembles [32] involve training an ensemble of deep neural networks on the same data by initializing each network randomly. This approach is originally inspired by a classical ensembling method, bagging [19]. An uncertainty estimate is obtained by running all the elements in the ensemble and aggregating their predictions. The major drawback of Deep Ensembles is the computational overhead: it requires training multiple independent networks, and during inference it is desirable to keep all these networks in memory. More generally, ensembling has been a popular way to boost the performance of individual neural network models [18,30,33,42,54,56], with the quality improvements often being associated with diverse predictions. In [10] authors provide a comprehensive comparison of several popular ensemble learning methods as well as several approximate Bayesian inference techniques. Extensive experiments on vision tasks suggest that simple ensembles have the lowest correlation between individual models. This is an important advantage of these methods, as ultimately this leads to highly diversified predictions on the samples which are very distinct from those observed in training.
Snapshot-based methods take a slightly different approach towards creating an ensemble, and try to collect a diverse set of weight configurations over the course of a single training. Snapshot ensembles [24] build upon the idea of using cyclical learning rates to ensure that the optimization process can efficiently explore multiple local optima. Similarly, Fast Geometric Ensembling [13,26], uses a method to identify low-error paths between local optima to obtain a collection of diverse representations. Although these approaches partially tackle training time issues, they typically perform worse than the standard ensembles [1] and consume the same amount of memory. Furthermore, because of the specifics of their training procedure, in particular, shared initialization with a pre-trained network, individual snapshots are not guaranteed to be decorrelated, which might hurt the performance [1].

Dropout
Dropout [48] is an extremely popular and simple approach to stochastically regularizing deep neural networks. During training, neurons are randomly dropped with fixed probability, which effectively produces an approximation of several slightly different model architectures and allows a single model to mimic ensemble behavior. Originally Dropout was used during training as a stochastic regularization technique, but [12,11] proposed using it during inference, providing sound mathematical justification for ensembling and Bayesian model averaging analogies. MC-Dropout is extremely easy to use and has zero memory overhead compared to a single model but shows consistently worse performance compared to Deep Ensembles [40,17]. In particular, different predictions made by several forward passes with randomly generated masks seem to be overly correlated and strongly underestimate the variance. In this paper, we postulate that the training procedure, which makes any combination of the weights possible, will tend to create uniformity between predictions. As opposed to Ensemble techniques, MC-Dropout techniques do not let multiple versions of the network actually be created, and the weights are forced to converge jointly.

Other Methods
Although Bayesian inference provides a natural way to assess uncertainty of model predictions, it is prohibitively expensive to apply these techniques to deep neural networks directly. A number of approximate inference techniques were developed for Bayesian Neural Networks (BNN) [34,38,35] that try to alleviate these problems, to name a few: Bayes by Backprop [3] uses Variational Inference to learn a parametric distribution over model weights that approximates the true posterior, Laplace Approximation [45] tries to find a Gaussian approximation to the posterior modes, MC-Dropout [12] could be seen as an approximate Bayesian procedure as well. Although these techniques are theoretically grounded, Deep Ensembles often show significantly better performance in practice [40,1], in terms of both accuracy and quality of the resulting uncertainty estimates.

Method
In this section, we introduce Masksembles, an approach to uncertainty estimation that creates a continuum between single networks, deep ensembles, and MC-Dropout. It builds on the intuition that dropout-based methods can be seen as stochastic variants of ensembles [33], albeit ensembles with infinite cardinality. We will argue that the main reason for MC-Dropout's poor performance is the high correlation between the ensemble elements that makes the overall predictions insufficiently diverse. Masksembles is designed to give control over the correlation between the elements of an ensemble and, hence, achieve a satisfactory compromise between reliable uncertainty estimation and acceptable computational cost.

Masksembles as Structured Dropout
Both Ensembles and MC-Dropout are ensemble methods, that is, they produce multiple predictions for a given input and then use an aggregated measure such as variance or entropy as an uncertainty estimator. Formally, consider a dataset {x i , y i } i , where x i ∈ R F are input features, and y i are scalars or labels. For classification problems, we model conditional distribution p(y|x; θ) as a mixture where θ k are the weights of element k of the ensemble, and N is the size of the ensemble. For Deep Ensembles, individual models are independent and do not share any weights, and hence each θ k is a separate set of weights, trained entirely independently. By contrast, for MC-Dropout there is a single shared θ, and individual models are obtained as θ k =b t k · θ, wherẽ b t k ∈ {0, 1} |θ| are random binary masks which are resampled for each iteration t. The elements ofb t k follow Bernoulli distribution parameterized by dropout probability p, and the parameters corresponding to the same network activations are dropped simultaneously. At inference time, a small number of predictions is produced by randomly sampling the masks. In practice, for any reasonable choice of p, the masksb t k will overlap significantly, which will tend to make predictions p(y|x; θ k ) highly correlated, and thus could lead to underestimated uncertainty. Furthermore, because masks are re-sampled at each training iteration, each network unit needs to be able to form a coherent response with any other unit, which creates a mixing effect and leads to uniformity between the predictions from different masks.
To tackle these issues, we propose using a finite set of pre-defined binary masks, which are generated so that their overlap can be controlled. They are then used to drop corresponding network activations so that the resulting models are sufficiently decorrelated and do not suffer from the mixing effect described above. In what follows, we describe the algorithm for mask generation, explain the way we apply generated masks to models, and discuss the trade-offs it incurs.

Generating Masks
Generating masks with a controllable amount of overlap is central to Masksembles. Let us first introduce the key parameters of our mask generation process: • N -number of masks.
• M -number of ones in each mask.
• S -scale that controls the amount of overlap given N and M.
The masks generation algorithm is summarized below. It starts by generating N vectors of all zeros of size M × S. Then, in each of those vectors, it randomly sets M of these elements to be 1 in each vector. As depicted by Fig. 1, it then looks for positions that are all zero in the resulting vectors. These correspond to features that will be dropped. For S = 1.0, the algorithm then generates N masks of size M that will contain only ones and therefore fully overlapping. Conversely, setting S to large positive values will generate N masks with mostly zero values and therefore very few overlapping one values.

Inserting Masksembles Layer into Networks
We start with the very simple case depicted by Fig. 2. It shows an MLP with one hidden layer of size 3 and 2dimensional inputs and outputs. We insert Masksembles layer right after the hidden layer and increase its size to M × S − D where D is the number of dropped features so that the sizes of the masks and the size of the layer match. Then at run-time, we apply the mask values and ignore all components of the hidden layer for which they are zero. Fig. 2 features 3 different configurations obtained by fixing both M and N -here, N is sufficiently large so that D = 0 -and changing the value of S to 1.0, 1.7, and 2.3, therefore increasing masks sizes and hidden size in range [3,5,7].
Applying such modification to the model creates a larger one that allows for multiple relatively uncorrelated predictions. This process extends naturally to MLPs of any dimension. It also extends to convolutional architectures without any significant modification. As in MC-dropout, we  can drop entire channels [49] instead of individual activations. In other words, treating the whole channel as a single feature is equivalent to the fully connected case discussed above.
In general, this means that we may have to adapt the size of network layers each time we change M, N, or S, which can be cumbersome. Fortunately, keeping S × M equal to the original channels number, 3 in the MLP example, makes it possible to apply Masksembles without any such change of the network configuration.

Parameters and Model Transitions
The chosen parameters N, M and S define several key model properties: • Total model size: The total number of model parameters. In the above MLP example, this is equal to where D is the number of features trimmed during the mask generation procedure. This functional relationship is illustrated in Fig. 3.
• Model capacity: The number of activations that are used during one forward pass of the model, which is equal to M.
• Masks IoU average Intersection over Union (IoU) between generated masks. We derive approximation for this quantity that appears to depend only on S : IoU(S) = 1/(2S − 1) and therefore N, M do not influence it, as show in Fig. 3. In fact, Deep Ensembles and MC-Dropout can be both seen as extreme cases and Masksembles can transition smoothly from one to the other (Fig. 5).
Ensembles: When S goes to infinity, Masks IoU goes to zero and Masksembles starts behaving like Ensembles that uses non-overlapping masks.
Dropout: As N increases, each individual mask configuration becomes less and less likely to be picked during training. In the limit where N goes to infinity, we reproduce the situation where each mask is seen only once, which is equivalent to MC-Dropout. In this case, the dropout rate would be 1 − 1 S . Transition: In Fig. 14, we use a simple classification problem to illustrate the span of behaviors Masksembles can cover. Specifically, we show that reducing mask overlap, that is, decreasing the correlation between binary masks, yields progressively more diverse predictions on out-of-training examples and generates more ensemble-like behavior.

Implementation details
The only extra computation performed in Masksembles over a single network is cheap tensor-to-mask multiplication. Therefore, compared to convolutional and fully connected layers, this product induces negligible computational overhead. Furthermore, we rely on similar optimizations as in [52] to make our implementation more efficient.

Experiments
In this section, we first introduce the evaluation metrics which we use to quantitatively compare Masksembles against MC-Dropout and Ensembles. We then compare our method with the baselines on two broadly used benchmark datasets CIFAR10 [30] and ImageNet [6].
Note that we did not use any complex data augmentation schemes, such as AugMix [23], Mixup [57] or adver-sarial training [15], in order to avoid entangling their effects with those of Masksembles. Ultimately, these techniques are complementary to ours and could easily be used together.

Metrics
Given a classifier with parameters θ, let p(y|x; θ) be the predicted probability for a sample represented by features x to have a label y, and let p gt (y|x) denote the true conditional distribution over the labels given the features. We use several different metrics to analyze how close p(y|x; θ) is to p gt (y|x) and to compare our method to others, in terms of both accuracy and quality of uncertainty estimation.
Accuracy. For classification tasks, we use the standard classification accuracy, i.e. the percentage of correctly classified samples on the test set.
Entropy (ENT). It is one of the most popular measures used to quantify uncertainty [33,37]. For classification tasks it is defined as where N c is the number of classes.
Expected Calibration Error (ECE). ECE quantifies the quality of uncertainty estimates specifically for in-domain uncertainty. A model is considered well-calibrated if its predicted distribution over labels p ( y|x; θ) is close to the true distribution p gt (y|x). As in [16], we define ECE to be the average discrepancy between the predicted and real data distribution: which is a common metric for calibration evaluation.
Out-of-Distribution Detection (OOD ROC / PR). Domain shift occurs when the features in the training data do not follow the same probability distribution as those in the test distribution. Detecting out-of-distribution samples is an important task, and uncertainty estimation can be used for this purpose under the assumption that our model returns higher uncertainty estimates for such samples. To this end, we use the uncertainty measure produced by our models as a classification score that determines whether a sample is in-domain or not. We then apply standard detection metrics, ROC and PR AUCs, to quantify the performance of our model.
Model Size This corresponds to the Total model size defined in Section 3.4. A major motivation for Masksembles is to match the performance of Deep Ensembles while using a smaller model that requires significantly less memory. We use a total number of weights that parameterize our models as a proxy for that. In addition to the model size, we also report the total GPU time used to train any particular model.

CIFAR10
CIFAR10 is among the most popular benchmarks for uncertainty estimation. The dataset is relatively small-scale, and very large models tend to overfit the data easily. We, therefore, picked the Wide-ResNet-16-4 [55] for our experiments and used training procedures similar to the original paper. Following [12], we place dropout layers before all the convolutional and fully connected layers in the MC-Dropout model. Masksembles layers are added exactly the same way.
Accuracy and ECE. One of the standard ways to assess the robustness of a model is to evaluate the dependency of its performance with respect to inputs perturbations [22,40]. In our experiments, we investigate the behaviour of all the considered models under the influence of domain shifts induced by typical sources of noise.
Following [52,40], we evaluate model accuracy and ECE on a corrupted version of CIFAR10 [22]. Namely, we consider 19 different ways to artificially corrupted the images and 5 different levels of severity for each of those corruptions.
We train all the models on the original uncorrupted CI-FAR10 training set and test them both on the original images and their corrupted versions. In Table 1, we report our results on the original uncorrupted images and in Fig. 6 the results on the noisy ones. Each box represents the first and third quantiles of accuracy and ECE while the error bars denote the minimum and maximum values. We tested four different approaches, that is, a single network, MC-Dropout, Ensembles, and our Masksembles. Unsurprisingly, as the severity of the perturbations increases, using a single network is the least robust approach and degrades fastest. Masksembles performs on par with Ensembles and consistently outperforms MC-dropout, even though we extensively tuned MC-Dropout for the best possible performance by doing a grid search on the dropout rate (which turned out to be p ≈ 0.1).
In these experiments, Masksembles was trained with a fixed number of N = 4 masks. We varied both S in the range [1.0, 5.0] and M in the range [0.3C, 2.0C], where C is the number of channels in the original model. Fig. 7 depicts the resulting range of behaviors. The 2D coordinates of the markers depict their accuracy and ECE, their colorsthe corresponding model size, and the size of the star markers denotes the value of the mask-overlap. For comparison purposes, we also display MC-dropout and Ensembles results in a similar manner, simply replacing the star with a square and a circle, respectively. As can be seen, the optimal Masksemble configuration depicted by the green star in the lower right corner delivers performances similar to those of Ensembles for a model size that is almost half the size. This is the one we also used in the experiments depicted by Fig. 6.
In Fig. 8, we chose the Masksembles parameters so that the model size always remains the same: We fix the number of masks N = 4 and vary S and M so that the total model size remains constant, which means that a lower mask overlap results in a lower capacity for each individual model. This procedure is important in practice because it enables us to take a large network, such as ResNet, and add Masksembles layers as we would add Dropout layer without having to change the rest of the architecture.
For this set of experiments we obtain a consistent improvement in calibration quality by reducing mask overlap and achieve ensembles-like performance with S = 5.
OOD ROC and PR. For OOD task, we followed the evaluation protocol of [5]. Namely, we trained our models on CIFAR10, and then used CIFAR10 test images as  our in-distribution samples and images from the SVHN dataset [39] (which belong to classes that are not in CI-FAR10), as our out-of-distribution samples. We report our OOD results in the two bottom rows of Table 1. Again, performance of our method is similar to that of Ensembles at a fraction of the computational cost, and significantly better than that of a single network and MC-dropout.

ImageNet
The ImageNet [6] is another dataset that is widely used to assess the ability of neural networks to produce uncertainty estimates. For this dataset, we rely on the well-known ResNet-50 [21] architecture as a base model, using the setup similar to that in [1]. Similarly to our CIFAR10 experiments, for the MC-Dropout and Masksembles models, we introduce dropout (masking) layers before every convolutional layer starting from stage3 layers.
We followed exactly the same evaluation protocol as in Section 4.2 and report our results on the original images in Table 2 and on the corrupted ones in Fig. 11. In Table 2 and Fig. 10 we use the same procedure as for CIFAR10 to select Masksembles parameters so that the total model size remains fixed.
For this dataset, Masksembles demonstrates its best performance for a choice of parameters corresponding to a Masks IoU of 0.5. Similarly to our results on CIFAR10, the performance of Masksembles both in terms of accuracy and ECE is very close to that of Ensembles and significantly better than that of MC-Dropout. Note that our method achieves these results with a training time and memory consumption that is 4 (four) times smaller than that of Ensembles, and nearly the same as that of a single network. In terms of calibration quality on corrupted images, we achieve Ensemblelike performance starting from S = 2 and up.

Conclusion
In this work, we introduced Masksembles, a new approach to uncertainty estimation in deep neural networks. Instead of using a fixed number of independently trained models as in Ensembles or drawing a new set of random binary masks at each training step as in MC-Dropout, Masksembles predefines a pool of binary masks with a con-   trollable overlap and stochastically iterates through them. By changing the parameters that control the mask generation process, we can span a range of behaviors between those of MC-Dropout and Ensembles. This allows us to identify model configurations that provide a useful tradeoff between the high-quality uncertainty estimates of Deep Ensembles at a high computational cost and the lower performance of MC-Dropout at a lower computational cost. In fact, our experiments demonstrate that we can achieve the performance on par with that of Deep Ensembles at a fraction of the cost. Because Masksembles is easy to implement, we believe it can serve as a drop-in replacement for MC-Dropout. In future work, we will explore ways to accelerate Masksembles by exploiting the structure of the masks, and apply our method to tasks that require a scalable uncertainty estimation method, in particular reinforcement learning and Bayesian optimization.

A. Supplementary Material
In this appendix, we study in more detail the relationship between the choice for N, M, and S parameters of Section 3.2 that control the mask generation process and the resulting model size, mask correlation, and models' diversity.

A.1. Expected models size
We first provide a formal derivation for the expected size of a generated model given the N, M, S parameters. Let us consider N vectors of size M × S filled with zeros, and then in each of those vectors, we randomly set M of these elements to be 1. Let ζ ij be a random variable that represents whether or not j-th position in i-th vector is equal to one. such configurations where j-th position is fixed to be one, therefore ζ ij > 0] be the random variable representing whether at least one 1 appears in the j-th position among all generated vectors. Given that P(ζ ij = 0) = 1− 1 S and P(X) = 1−P(X), then probability of j can be written as To compute the expected model size, we compute the expectation of j sum, since effectively it represents expected number of features that one will acquire after a trimming procedure:

A.2. Average IoU
We now justify our 1 2S−1 approximation for the average mask IoU. Let us consider two vectors produced by our mask generation algorithm. As above, let ζ 1j and ζ 2j be random variables that represent the value in the j-th position in the first and second masks, respectively. Starting from the standard definition of the IoU, we estimate the average intersection I of two such masks as the number of common ones: Given two masks with M ones each and intersection I, their IoU is I 2M−I . Therefore, a simple approximation for expected IoU is In Fig. 12, we plot this value as a function of S along with empirical values and the agreement is excellent.

A.3. Diversity analysis
It is known that less correlated ensembles of models deliver better performance, produce more accurate predictions [33,42,18], and demonstrate lower calibration error [40]. Hence, a strength of Masksembles is that it provides the ability to control how correlated models within Masksembles are by adjusting the N, M, and S parameters.
We now perform a diversity analysis of Masksembles models using the metric of [10]. It involves comparing two different models trained on the same data in terms of how different their predictions are. Measuring fraction of the test data points on which predictions of models disagree, the diversity, and normalizing it by the models error rate, we write Diversity = fraction of disagreed labels 1.0 − accuracy Plotting this diversity against accuracy allows us to look at our models from a bias-variance trade-off perspective. Since we want our models to be less correlated-larger diversityand at the same time to be accurate, the upperright corner of Fig. 13 is where the best models should be. For this experiment we used a single trained model; several Masksembles models with N = 4, fixed M to have the same capacity as the single one and varying S in [2,3,4,5]; ensembles model with 4 members. Fig. 13 depicts the results on CIFAR10 dataset. Ensembles have the largest diversity but Masksembles gives us the ability to achieve very similar results by controlling its parameters. The single model has 0 diversity by the definition.

A.4. Calibration Plots
Since Expected Calibration Error (ECE) provides only limited and aggregated information about model's calibration therefore in this section we present full calibration plots for experiments performed on CIFAR and ImageNet datasets in experiments sections.  For both datasets, the calibration plots support our claim that lower model correlation yields better calibration. Furthermore, reducing masks overlap for Masksembles enables us to match Ensembles behavior very closely.