Title: AGGREGATING EXPLANATION METHODS FOR NEURAL NETWORKS STABILIZES EXPLANATIONS

Abstract: Despite a growing literature on explaining neural networks, no consensus has been reached on how to explain a neural network decision or how to evaluate an explanation. Our contributions in this paper are twofold. First, we investigate schemes to combine explanation methods and reduce model uncertainty to obtain a single aggregated explanation. The aggregation is more robust and aligns better with the neural network than any single explanation method. Secondly, we propose a new approach to evaluating explanation methods that circumvents the need for manual evaluation and is not reliant on the alignment of neural networks and humans decision processes.

1. INTRODUCTION:

Despite the great success of neural networks especially in classic visual recognition problems, explaining the networks' decisions remains an open research problem Samek et al. (2019) . This is due in part to the complexity of the visual recognition problem and in part to the basic 'ill-posedness' of the explanation task. This challenge is amplified by the fact that there is no agreement on what a sufficient explanation is and how to evaluate an explanation method. Many different explanation strategies and methods have been proposed (Simonyan et al., 2013; Zeiler & Fergus, 2014; Bach et al., 2015; Selvaraju et al., 2017; Smilkov et al., 2017; Sundararajan et al., 2017) . Focusing on visual explanations for individual decisions, most methods either use a backpropagation approach or aim to construct a simpler linear model with an intuitive explanation. The plethora of explanation approaches is a signature of the high-level epistemic uncertainty of the explanation task. This paper is motivated by a key insight in machine learning: Ensemble models can reduce both bias and variance compared to applying a single model. A related approach was pursued for functional visualization in neuroimaging (Hansen et al., 2001) . Here we for the first time explore the potential of aggregating explanations of individual visual decisions in reducing epistemic uncertainty for neural networks.

We test the hypothesis that ensembles of multiple explanation methods are more robust than any single method. This idea is analyzed theoretically and evaluated empirically. We discuss the properties of the aggregate explanations and provide visual evidence that they combine features, hence are more complete and less biased than individual schemes. Based on this insight, we propose two ways to aggregate explanation methods, AGG-Mean and AGG-Var. In experiments on Imagenet, MNIST, and FashionMNIST, the aggregates identify relevant parts of the image more accurately than any single method.

Second, we introduce IROF (Iterative Removal Of Features) as a new approach to quantitatively evaluate explanation methods without relying on human evaluation. We circumvent the problems of high correlation between neighbor pixels as well as the human bias that are present in current evaluation methods.

2. RELATED WORK:



2.1. EXPLANATION METHODS:

The open problem of explainability is reflected in a lot of recent work (Kindermans et al., 2017; Selvaraju et al., 2017; Bach et al., 2015; Zhang et al., 2018; Zhou et al., 2016; Ancona et al., 2018; Ribeiro et al., 2016; Rieger et al., 2018; Kim et al., 2018; Lundberg & Lee, 2017; Zintgraf et al., 2017; Simonyan et al., 2013; Zeiler & Fergus, 2014; Selvaraju et al., 2017; Smilkov et al., 2017; Sundararajan et al., 2017; Shrikumar et al., 2017; Montavon et al., 2017; Chang et al., 2018) . We focus on generating visual explanations for single samples. The first work in this direction was Simonyan et al. (2013) with Saliency Maps (SM) that proposed backpropagating the output onto the input to gain an understanding of a neural network decision. The relevance for each input dimension is extracted by taking the gradient of the output w. r. t. to the input. This idea was extended by Springenberg et al. (2014) into Guided Backpropagation (GM) by applying ReLU non-linearities after each layer during the backpropagation. Compared to Saliency, this removes visual noise in the explanation. Grad-CAM (GC) from Selvaraju et al. ( 2017) is an explanation method, developed for use with convolutional neural networks. By backpropagating relevance through the dense layers and up-sampling the evidence for the convolutional part of the network, the method obtains coarse heatmaps that highlight relevant parts of the input image. Integrated Gradients (IG) Sundararajan et al. (2017) sums up the gradients from linearly interpolated pictures between a baseline, e.g. a black image, and the actual image. SmoothGrad (SG) filters out noise from a basic saliency map by creating many samples of the original input with Gaussian noise Smilkov et al. (2017) . The final saliency map is the average over all samples.

Finally, we also consider LIME Ribeiro et al. (2016) . In contrast to the other methods, LIME is not based on backpropagation. Instead, it approximates the neural network with a linear model locally around the input to be explained. The coefficients of the linear model for the respective input dimensions give the importance of each dimension. Compared to the other methods this is much more computationally expensive as it requires many passes through the neural network.

2.2. EVALUATION OF EXPLANATION METHODS:

The evaluation of explanation methods is a relatively recent topic with few systematic approaches (Bau et al., 2017; Ancona et al., 2018; Hooker et al., 2018; Adebayo et al., 2018; Fong & Vedaldi, 2017) . To our knowledge, Bach et al. (2015) proposed the first quantitative approach to evaluate an explanation method by flipping pixels to their opposite and comparing the decrease in output with the relevance attributed to the pixel by the explanation method. As the authors note, this only works for low-dimensional input. This work was followed up upon in Samek et al. (2016) . By dividing high-dimensional images into squares, they make the method feasible for high-dimensional inputs. Squares with high relevance (as measured by the explanation method) consecutively get replaced with noise sampled from the uniform distribution. The difference between the original output and the output for the degraded images indicates the quality of the explanation method. Hooker et al. (2018) proposes another quantitative approach to evaluate explanation methods called ROAR. For each explanation method they extract the relevance maps over the entire training set. They degrade the training set by setting different percentages of the pixels with the highest relevance to the mean and retrain the network. Each retrained network is evaluated on the test set. The accuracy on the test set decreases dependent on the percentage of pixels set to the mean. This requires retraining the same architecture multiple times for each explanation method at a high computational cost. Ancona et al. (2018) proposed a different approach to evaluate explanation methods, called Sensitivityn, based on the notion that the decrease in output when a number of inputs are canceled out should be equal to the sum of their relevances. For a range of n (between 1 and the total number of inputs) they sample a hundred subsets of the input. For each n, the Pearson Correlation Coefficient (PCC) between the decrease in output, when the subset of features is removed, and the sum of their relevances is reported. The result is a curve of the PCC dependent on the percentage of the input being removed. For a good explanation method, the PCC will decrease slowly.

3. METHODS:



3.1. AGGREGATING EXPLANATION METHODS TO REDUCE VARIANCE:

All currently available explanation methods have weaknesses that are inherent to the approach and include significant uncertainty in the resulting heatmap (Kindermans et al., 2017; Adebayo et al., 2018; Smilkov et al., 2017) . A natural way to mitigate this issue and reduce noise is to combine multiple explanation methods. Ensemble methods have been used for a long time to reduce the variance and bias of machine learning models. We apply the same idea to explanation methods and build an ensemble of explanation methods.

We assume a neural network F : X → y with X ∈ R m×m and a set of explanation methods {e j } J j=1 with e j : X, y, F → E with E ∈ R m×m . We write E j,n for the explanation obtained for X n with method e j and denote the mean aggregate explanation as ē with Ēn = 1 J J j=1 E j,n . While we assume the input to be an image ∈ R m×m , this method is generalizable to inputs of other dimensionalities as well.

To get a theoretical understanding of the benefit of aggregation, we hypothesize the existence of a 'true' explanation Ên . This allows us to quantify the error of an explanation method as the mean squared difference between the 'true' explanation and an explanation procured by an explanation method, i.e. the MSE.

For clarity we subsequently omit the notation for the neural network. We write the error of explanation method j on image X n as err

j,n = ||E j,n -Ên || 2 with MSE(E j ) = 1 N n err j,n and MSE( Ē) = 1 N n || Ēn -Ên || 2

is the MSE of the aggregate. The typical error of an explanation method is the mean error over all explanation methods

MSE = 1 J j MSE(E j ).

With these definitions we can do a standard bias-variance decomposition (Geman et al., 1992) .

Accordingly we can show the error of the aggregate will be less that the typical error of explanation methods,

MSE = 1 N n 1 J j || Ên -E j,n || 2 (1) = 1 N n || Ên -Ēn || 2 + 1 N J n,j || Ēn -E j,n || 2 , hence, MSE = 1 J j 1 N n || Ēn -E j,n || 2 epistemic uncertainty +MSE( Ē) ≥ MSE( Ē).

A detailed calculation is given in appendix A.1. The error of the aggregate MSE( Ē) is less than the typical error of the participating methods. The difference -a 'variance' term -represents the epistemic uncertainty and only vanishes if all methods produce identical maps. By taking the average over all available explanation methods, we reduce the variance of the explanation compared to using a single method. To obtain this average, we normalize all input heatmaps such that the relevance over all pixels sum up to one. This reflects our initial assumption that all individual explanation methods are equally good estimators. We refer to this approach as AGG-Mean.

E Agg-Mean,n = 1 J J j=1 E j,n

This estimator however does not take into account the estimate of the local epistemic uncertainty, i.e. the disagreement between methods. A way to incorporate this information is to form an 'effect size' map by dividing the mean aggregate locally with its standard deviation (Sigurdsson et al., 2004) .

Intuitively, this will assign less relevance to segments with high disagreement between methods.

For stability, we divide not directly by the local variance but add a constant to the estimate of the local variance. This can be interpreted as a smoothing regularizer or a priori information regarding epistemic and aleatoric uncertainties. We refer to this approach as AGG-Var.

E AGG-Var,n = 1 J J j=1 E j,n σ(E j∈J,n ) +

where σ(E j∈J,n ) is the point-wise standard deviation over all explanations j ∈ J for X n

In section 4 we will evaluate and compare AGG-Mean and AGG-Var against basic explanation methods.

3.2. EVALUATING EXPLANATION METHODS QUANTITATIVELY WITH IROF:

Figure 1 : Quantitative evaluation with IROF: Relevant segments as identified by an explanation method get consecutively replaced by the mean colour over the entire dataset. The IROF score of an explanation method is the integrated decrease in the class score over the number of removed segments.

Quantitative evaluation is a recurring problem with explainability methods. This is especially true for high-dimensional input, such as images, where important features are made up of locally highly correlated pixels. If the information in one pixel is lost, this will not change the overall feature and should therefore not result in a changed output score. The relevance values of single pixels are not indicative of the feature's importance as a whole. We circumvent this problem by utilizing conventional image segmentation, a well-explored area. By first dividing the image into coherent segments, we avoid the interdependency between the inputs.

Methodology We assume a neural network F : X → y with X ∈ R m×m and a set of explanation methods {e j } J j=1 with e j : X, y, F → E with E ∈ R m×m .

Furthermore we partition each image X n into a set of segments {S l n } L l=1 using a given segmentation method with s l n,i,j = 1 indicating that pixel x n,i,j belongs to segment l. Computing the mean importance

||Ej,nS l n ||1 ||S l n ||1

of each segment according to a given explanation method j, two segments can be directly compared against each other. By sorting the segments in decreasing order of importance according to the explanation method, we get a ranking of how relevant each segment of the image is.

We use X l n to indicate X n with the l segments with highest mean relevance replaced with the mean value. Taking F (X l n ) y repeatedly with increasing l ∈ 0, ..., L results in a curve of the class score dependent on how many segments of the image are removed. Dividing this curve by F (X 0 n ) y normalizes the scores to be within [0, 1] and makes curves comparable between input samples and networks.

If an explanation method works well, it will attribute high relevance to segments important for classification. As segments with high relevance are removed first, the score for the target class will go down faster. By computing the area over the curve (AOC) for the class score curve and averaging over a number of input samples, we can identify the method that identifies relevant areas of the image more reliably. For a good explanation method, the AOC will be higher. We refer to this evaluation method as the iterative removal of features (IROF). The IROF for a given explanation method e j is expressed as:

IROF(e j ) = N n=1 AOC F (X l n ) y F (X 0 n ) y L l=0

This approach is a quantitative comparison of two or more explainability methods that does not rely on human evaluation or alignment between human and neural network reasoning. For each explanation method the workflow produces a single value, enabling convenient comparison between two or more explanation methods. If the AOC is higher, the explanation method captures more information about the neural network classification.

IROF is dependent on having meaningful segments in the input, as natural images do. Dividing up text or non-natural images such as EEG into meaningful and independent segments does not have a natural solution and is left for future research.

4. EXPERIMENTS:

We first present empirical validation of our proposed evaluation technique IROF in section 4.2. Subsequently we evaluate the aggregation of explanation techniques against the vanilla techniques with IROF, Sensitivity-n and qualitative evaluation. In appendix A.6.1 we compare aggregated methods on a dataset of human-annotated heatmaps.

4.1. EXPERIMENTAL DETAILS:

We tested our method on five neural network architectures that were pre-trained on ImageNet: VGG19, Xception, Inception, ResNet50 and ResNet101 (Deng et al., 2009; Simonyan & Zisserman, 2014; He et al., 2016; Chollet, 2017; Szegedy et al., 2016) .1 Additionally, we ran experiments on CNN trained on the MNIST and FashionMNIST dataset LeCun & Cortes (2010); Xiao et al. (2017) .

We compared the aggregation methods against Saliency (SM), Guided Backpropagation (GB), SmoothGrad (SG), Grad-CAM (GC) and Integrated Gradients (IG) to have a selection of attributionbased methods. Additionally we compared against LIME as a method that is not based on attribution but rather on local approximation Ribeiro et al. (2016) . The aggregations are based on all attributionbased methods.

Some of the methods result in positive and negative evidence. We only considered positive evidence for the ImageNet tasks to compare methods against each other. To check that this does not corrupt the methods, we compared the methods that do contain negative results against their filtered version and found negligible difference between the two versions of a method in the used metrics.

For Agg-Mean we introduced an additional parameter, to the divisor. In our experiments we set to be ten times the mean σ over the entire dataset.

4.2. EVALUATING IROF FOR VALIDITY AS AN EVALUATION METHOD:

A good evaluation method should be able to reject the null hypothesis (a given explanation method is no better than random choice) with high confidence. We use this as motivation to evaluate and compare IROF by calculating the paired t-test of an explanation method versus random guessing. This is done with multiple explanation methods and networks, to reduce the impact of the explanation method.

We compare IROF and pixel removal with mean value and black as a replacement value respectively. Additionally we compare against Samek et al. (2016) as explained in section 2. For IROF and Samek et al. (2016) we set the 10% most relevant segments to the mean value over the dataset. For pixel removal, we set the equivalent number of pixels to the mean value. The percentage of segments or pixels being removed was chosen ad hoc. If the difference in degradation between random choice and the explanation method is high, the explanation method reports meaningful information. Since we compare the same explanation method on the same neural network with different evaluation methods, the p-values only contain information about how meaningful the evaluation method is.

We computed IROF and pixel removal with black or mean replacement values and compared the p-value changes dependent on the number of samples. Results are shown in fig. 2 (extended in appendix A.6). In table 1 we provide results for forty images in tabular form for an easier overview (other methods in appendix A.6). On forty images, all evaluation methods produce p-values below 0.05. Thus, all evaluation methods can distinguish between random guessing and an explanation method.

However, IROF can reject the null hypothesis (the explanation method does not contain any information), with much higher confidence with the same number of samples for any configuration. We can conclude that IROF is more sensitive to the explanation method than pixel removal or Samek et al. (2016) , making it the better choice to quantitatively evaluate an explanation method. the IROF as described in section 3.2. We include two non-informative baselines. Random randomly chooses segments to remove. Sobel is a sobel edge detector. Neither of them contain information about the neural network.

All explanation methods have a lower IROF than the random baseline on all architectures tested, indicating that all methods contain information about the image classification. Except for LIME, all methods also surpass the stronger baseline, SOBEL. The ranking of unaggregated methods varies considerably between architectures. This variance indicates that the accuracy of an explanation method depends on the complexity and structure of the neural network architecture. For all architectures AGG-Mean and AGG-Var have a lower IROF score than any non-aggregated method. For ResNet101 the difference between the best unaggregated method and the aggregated methods is especially large. We hypothesize, that the benefit of aggregating explanation methods increases for more complex neural network with large epistemic uncertainty on the explanation.

We can empirically confirm that aggregating methods improves over unaggregated methods and more reliably identifies parts of the images that are relevant for classification.

4.4. QUALITATIVE VISUAL EVALUATION:

We show heatmaps for individual examination for each of the methods in fig. 3 and compare qualitatively (large version of fig. 3 in appendix A.6.2). While visual evaluation of explanations for neural networks can be misleading, there is no better way available of checking whether any given explanation method agrees with intuitive human understanding (Adebayo et al., 2018) . Additionally, we compute alignment between human-annotated images and the explanation methods in ??, using the human benchmark for evaluation introduced in Mohseni & Ragan (2018). Under review as a conference paper at ICLR 2020 AGG-Var combines features of the aggregrated methods by attributing relevance on the classified object as a whole, but considering smaller details such as the face of an animal as more relevant.

It is a combination of the detail-oriented and shape-oriented methods. Compared to SmoothGrad, which concentrates on one isolated feature, the relevance is more evenly distributed and aligned with our human intuition that classification takes context into account and does not rely on e.g. only the beak of a bird. We can conclude that combining explainability methods provides a meaningful visual improvement over single methods.

4.5. EVALUATION WITH SENSITIVITY-n ON LOW-DIMENSIONAL INPUT:

To quantitatively compare explanation methods on a low-dimensional input we use Sensitivity-n (Ancona et al., 2018) . The exact procedure is described in section 2. We compare on MNIST (LeCun & Cortes, 2010) and FashionMNIST (Xiao et al., 2017) , two low-dimensional dataset with a basic CNN2 (architecture in appendix) . We follow the procedure suggested in Ancona et al. (2018) and test on a hundred randomly sampled subsets for 1000 randomly sampled test images. The number of pixels in the set n is chosen at fifteen points logarithmically spaced between 10 and 780 pixels.

As described in section 2, for a range of n (between 1 and the total number of inputs) a hundred subsets of the input features are removed. For each n, the average Pearson Correlation Coefficient (PCC) between the decrease in output and the relevance of the removed output features is reported.

The result is a curve of the PCC dependent on the removed percentage.

We show results in fig. 4 . AGG-Mean and AGG-Var perform in range of the best methods. For the CNN trained on FashionMNIST, AGG-Mean and AGG-Var perform better than unaggregated methods. For the CNN trained on MNIST, Guided Backpropagation and AGG-Mean perform best.

For both networks (trained on FashionMNIST and MNIST respectively), SmoothGrad and GradCAM perform considerably worse than the other methods.

In summary, aggregation seems to not be as beneficial when applied to a low-dimensional, "easier" tasks such as MNIST as it is for ImageNet, performing in range of the best unaggregated method. We hypothesize that this is because there is less epistemic uncertainty in explanations for less complex tasks and network architectures. 

5. CONCLUSION:

In this work we gave a simple proof that aggregating explanation methods will perform at least as good as the typical individual method. In practice, we found evidence that aggregating methods outperforms any single method. We found this evidence substantiated across quantitative metrics.

While our results show that different vanilla explanation methods perform best on different network architectures, an aggregation supersedes all of them on any given architecture.

A APPENDIX:

A.1 AGGREGATING EXPLANATION METHODS TO REDUCE VARIANCE -DETAILED DERIVATION All currently available explanation methods have weaknesses that are inherent to the approach and include significant noise in the heatmap (Kindermans et al., 2017; Adebayo et al., 2018; Smilkov et al., 2017) . A natural way to mitigate this issue and reduce noise is to combine multiple explanation methods. Ensemble methods have been used for a long time to reduce the variance and bias of machine learning models. We apply the same idea to explanation methods and build an ensemble of explanation methods.

We assume a neural network F : X → y with X ∈ R mxm and a set of explanation methods {e j } J j=1 with e j : X, y, F → E with E ∈ R mxm . We write E j,n for the explanation obtained for X n with method e j and denote the mean aggregate explanation as ē with Ēn = 1 J J j=1 E j,n . While we assume the input to be an image ∈ R mxm , this method is generalizable to inputs of other dimensions as well.

We define the error of an explanation method as the mean squared difference between a hypothetical 'true' explanation and an explanation procured by the explanation method, i.e. the MSE. For this definition we assume the existence of the hypothetical 'true' explanation Ên for image X n .

For clarity we subsequently omit the notation for the neural network.

We write the error of explanation method j on image X n as err

j,n = ||E j,n -Ên || 2 with MSE(E j ) = 1 N n err j,n and MSE( Ē) = 1 N n || Ēn -Ên || 2

is the MSE of the aggregate. The typical error of an explanation method is represented by the mean

MSE = 1 N n 1 J j || Ên -E j,n || 2 = 1 N J n,j || Ên -E j,n + Ēn -Ēn || 2 = 1 N J n,j ||( Ên -Ēn ) + ( Ēn -E j,n )|| 2 = 1 N J n,j || Ên -Ēn || 2 + || Ēn -E j,n || 2 + 2Tr ( Ên -Ēn )( Ēn -E j,n ) = 1 N n || Ên -Ēn || 2 + 1 N J n,j || Ēn -E j,n || 2 + 2 1 N n Tr   ( Ên -Ēn )   1 J j ( Ēn -E j,n )     = 1 N n || Ên -Ēn || 2 + 1 N J n,j || Ēn -E j,n || 2 + 2 1 N n Tr       ( Ên -Ēn ) 1 J j ( Ēn -E j,n ) =0       = 1 N n || Ên -Ēn || 2 + 1 N J n,j || Ēn -E j,n || 2 , hence, MSE = MSE( Ē) + 1 N J n,j || Ēn -E j,n || 2 epistemic uncertainty ≥ MSE( Ē)

The error of the aggregate MSE( Ē) is less than the typical error of the participating methods. The difference -a 'variance' term -represents the epistemic uncertainty and only vanishes if all methods produce identical maps.

A.2 COMPARING AGGREGATE OF TWO METHODS:

In section 3.1 we showed theoretically that the average MSE of two or more explanation methods will always be higher than the error of the averaged of those methods. Empirically, we test this for IROF with combinations of any two methods for ResNet101 and show the results in fig. 5 . For any two methods, the matrix shows the ratio between the aggregate method IROF and the average IROF of the aggregated methods. The aggregate IROF is always lower, confirming our theoretical results. An important part of our method is the choice of explanation methods to be included in the aggregation.

In our work we focus on backpropagation-based methods, since they tend to be computationally cheap. In our opinion this makes for a more realistic use case, not only for human but also for machine post processing.

In contrast, locality based methods such as LIME or the method by Fong & Vedaldi (2017) require many forward passes, since their methods essentially "learn" what parts of the input are relevant. We included LIME in our experiments to have a not-backpropagation based method included.

A.5 EXPERIMENTAL SETUP A.5.1 GENERAL

We use SLIC for image segmentation due to availability and quick run time (Achanta et al., 2012) . Preliminary experiments with Quickshift showed similar results (Vedaldi & Soatto, 2008) . SLIC was chosen over Quickshift due to the quicker run time. The number of segments was set to 300 ad hoc. fig. 1 shows the same procedure with 100 segments for the sake of clarity.

For AGG-Var, we add a constant to the denominator. We set this constant to 10 times the mean std, a value chosen empirically after trying values in the range of [1, 10, 100] times the mean.

Evaluations were run with a set random seed for reproducibility. Stddev were reported either for each individual result or if they were non-significant in the caption to avoid cluttering the results. Since our work does not include computationally heavy training, we did not record the exact computing infrastructure.

A.5.2 MNISTS:

The training for both models was equivalent. The architecture was as follows: We report p-values for evaluating with 50 images on ResNet101 in the manner described in section 4.2 in tabular form to provide a clear overview. 

:

Models retrieved from https://github.com/keras-team/keras.

Model and code retrieved from https://github.com/keras-team/keras/blob/master/examples/mnist_cnn.py.

Figures and Tables:

Figure 2: P-values for the rejection of the random removal null-hypothesis. Lower is better. P-values are on a logarithmic scale. IROF performs best in all scenarios.

Figure 3: Example images from Imagenet and the heatmaps produced by different methods on VGG19. Aggregated methods combine features from all methods. Too heavy focus on one feature by SmoothGrad is smoothed away by the aggregation.

Figure 4: Sensitivity-n for explanation methods. Higher is better. The proposed methods, AGG-Mean and AGG-Var perform better or equally good as all other methods.

Figure 5: Ratios between the aggregate IROF and the averaged IROF of two methods. Aggregation always improves on the results, as all values outside of the diagonal are below one.

(input)-(conv(32,3,3))-(conv(64,3,3))-(maxPool(2,2))-(dropout(0.25)) -(fully connected(128))-(dropout(0.5))-(output(10)) A.6 EVALUATING THE EVALUATION



Table content: <table><tr><td>EVALUATION METHOD</td><td>T-STAT</td><td>P-VAL</td></tr><tr><td>IROF (BLACK)</td><td colspan="2">1.58 1.22E-01</td></tr><tr><td>IROF (MEAN)</td><td colspan="2">5.44 3.60E-06</td></tr><tr><td>PIXEL FLIPPING (BLACK)</td><td colspan="2">1.92 6.22E-02</td></tr><tr><td>PIXEL FLIPPING (MEAN)</td><td colspan="2">2.10 4.25E-02</td></tr><tr><td>SAMEK (2016)</td><td colspan="2">2.77 8.65E-03</td></tr></table>

IROF scores across methods and architectures. AGG-Mean and AGG-Var surpass all methods in all scenarios. All std < 0.05.

Table content: <table><tr><td>METHOD</td><td colspan="5">INCEPTION RESNET101 RESNET50 VGG19 XCEPTION</td></tr><tr><td>RANDOM</td><td>60.3</td><td>61.0</td><td>65.5</td><td>68.4</td><td>50.1</td></tr><tr><td>SOBEL</td><td>71.5</td><td>74.5</td><td>75.6</td><td>79.6</td><td>68.3</td></tr><tr><td>LIME</td><td>74.0</td><td>67.6</td><td>66.7</td><td>73.4</td><td>74.0</td></tr><tr><td>SM</td><td>76.2</td><td>75.6</td><td>76.2</td><td>81.4</td><td>72.6</td></tr><tr><td>GB</td><td>73.7</td><td>77.6</td><td>80.9</td><td>84.3</td><td>74.8</td></tr><tr><td>IG</td><td>76.0</td><td>76.0</td><td>76.2</td><td>79.8</td><td>73.3</td></tr><tr><td>SG</td><td>77.9</td><td>77.7</td><td>77.5</td><td>83.9</td><td>75.0</td></tr><tr><td>GC</td><td>78.7</td><td>77.8</td><td>78.5</td><td>86.1</td><td>73.5</td></tr><tr><td>AGG-MEAN</td><td>79.9</td><td>81.1</td><td>80.9</td><td>86.6</td><td>76.7</td></tr><tr><td>AGG-VAR</td><td>80.4</td><td>81.2</td><td>81.0</td><td>86.7</td><td>76.7</td></tr></table>

t-test p-values of explanation methods for SmoothGrad.

Table content: <table><tr><td>EVALUATION METHOD</td><td>T STATISTIC</td><td>P-VALUE</td></tr><tr><td>IROF (BLACK)</td><td colspan="2">3.97 3.22E-04</td></tr><tr><td>IROF (MEAN)</td><td colspan="2">5.99 6.42E-07</td></tr><tr><td>PIXEL FLIPPING (BLACK)</td><td colspan="2">0.55 5.86E-01</td></tr><tr><td>PIXEL FLIPPING (MEAN)</td><td colspan="2">5.00 1.39E-05</td></tr><tr><td>SAMEK (2016)</td><td colspan="2">2.97 5.17E-03</td></tr></table>

t-test p-values of explanation methods for Guided backpropagation.

Table content: <table><tr><td>EVALUATION METHOD</td><td>T STATISTIC</td><td>P-VALUE</td></tr><tr><td>IROF (BLACK)</td><td colspan="2">3.79 5.42E-04</td></tr><tr><td>IROF (MEAN)</td><td colspan="2">5.64 1.93E-06</td></tr><tr><td>PIXEL FLIPPING (BLACK)</td><td colspan="2">1.16 2.52E-01</td></tr><tr><td>PIXEL FLIPPING (MEAN)</td><td colspan="2">0.49 6.30E-01</td></tr><tr><td>SAMEK (2016)</td><td colspan="2">3.02 4.54E-03</td></tr></table>

t-test p-values of explanation methods for Saliency.

Table content: <table><tr><td>EVALUATION METHOD</td><td>T-STAT</td><td>P-VAL</td></tr><tr><td>IROF (BLACK)</td><td colspan="2">1.58 1.22E-01</td></tr><tr><td>IROF (MEAN)</td><td colspan="2">5.44 3.60E-06</td></tr><tr><td>PIXEL FLIPPING (BLACK)</td><td colspan="2">1.92 6.22E-02</td></tr><tr><td>PIXEL FLIPPING (MEAN)</td><td colspan="2">2.10 4.25E-02</td></tr><tr><td>SAMEK (2016)</td><td colspan="2">2.77 8.65E-03</td></tr></table>

t-test p-values of explanation methods for GradCAM. Sensitivity-n for explanation methods. Higher is better. The proposed methods, AGG-Mean and AGG-Var perform better or equally good as all other methods. (large version of fig.4)

Table content: <table><tr><td>EVALUATION METHOD</td><td>T STATISTIC</td><td>P-VALUE</td></tr><tr><td>IROF (BLACK)</td><td colspan="2">4.73 3.23E-05</td></tr><tr><td>IROF (MEAN)</td><td colspan="2">7.81 2.42E-09</td></tr><tr><td>PIXEL FLIPPING (BLACK)</td><td colspan="2">-1.75 8.85E-02</td></tr><tr><td>PIXEL FLIPPING (MEAN)</td><td colspan="2">3.26 2.38E-03</td></tr><tr><td>SAMEK (2016)</td><td colspan="2">3.32 2.04E-03</td></tr></table>

Peer review (iclr2020):
This paper, inspired by the established technique of model ensembling, proposes two methods (AGG-Mean and AGG-Var) for aggregating different model explanations into a single unified explanation. The authors mathematically prove that the derived explanation is guaranteed to be more truthful than the average performance of the constituent explanations. In practice, the aggregation consistently outperforms *all* individual explanations, not just their aggregated performance. Additionally, the paper introduces a new quantitative evaluation metric for explanations, free of human intervention: IROF (Incremental Removal of Features) incrementally grays out the segments deemed as relevant by an explanation method and observes how quickly the end-task performance is degraded (good explanations will cause fast degradation). Solid validation confirms that the IROF metric is sound. I support paper acceptance. The experimental section is particularly strong, and makes a convincing argument for both the aggregation methods and the IROF metric. Even though I am not very familiar with the explainability literature and I would not be able to point out an omitted baseline for instance, the wide range of model architectures and aggregated explanation techniques makes a solid case. I appreciate the experiments on low-dimensional input, where the authors are deliberately showing a scenario in which their method does not score huge gains; this brings even more credibility to the paper. The presentation itself is clear, and there are no language or formatting issues. The only obvious downside of AGG-Mean and AGG-Var is that one would have to implement and run all constituent evaluation methods, which is expensive. Just as an idea for future work: given N explanation methods, one could ablate away one method at a time, thus getting an idea of whether any of the N explanations are redundant in the presence of others. Recommending a minimal set of useful explanation methods to the NLP community would then decrease the overall complexity of replicating the end-to-end explanation system.