Ablation Path Saliency
Anonymous authors
Paper under double-blind review
Abstract
We consider the saliency problem for black-box classification.
In image classification, this means highlighting the part of the image that is most relevant for the current decision.
We cast the saliency problem as finding an optimal ablation path between two images.
An ablation path consists of a sequence of ever smaller masks, joining the current image to a reference image in another decision region.
The optimal path will stay as long as possible in the current decision region.
This approach extends the ablation tests in Sturmfels et al.
The gradient of the corresponding objective function is closely related to the integrated gradient method Sundararajan et al.
In the saturated case (when the classifier outputs a binary value) our method would reduce to the meaningful perturbation approach Fong & Vedaldi (2017), since crossing the decision boundary as late as possible would then be equivalent to finding the smallest possible mask lying on the decision boundary.
Our interpretation provides geometric understanding of existing saliency methods, and suggests a novel approach based on ablation path optimisation.
Introduction
The basic idea of saliency or attribution is to provide something from which a human can judge how a classifier arrived at its decision of the prediction it gives for a certain input.
It is difficult to give a more mathematical definition, but various properties that such a method should fulfill have been proposed.
Sundararajan et al.
(2017) give axioms, of which sensitivity comes closest to the notion of saliency.
Essentially, the features on which the output is most sensitive should be given a higher saliency value.
The authors give further axioms to narrow it down – implementation invariance, completeness, linearity and symmetry-preservation – and obtain a corresponding method: the integrated gradient method.
Note that we have another way to arrive at a similar method, see §4.
Fong & Vedaldi (2017) is closer to our work: the authors directly compute the saliency of a given pixel by deleting, or altering that pixel, to see how this affects the output of the classifier.
Our method is to define a proper maximisation problem as follows.
First, we define ablation paths as time dependent smooth masks φ : [0 ; 1] !
C (Ω ; R ) , going a full mask to an empty mask, such that at each pixel the mask value decreases over time (see Figure 1).
We also impose constant area speed: the area covered by the mask should increase linearly over time (see §3).
Let F be the classifier, that outputs a probability between zero and one.
We choose a current image of interest x 0 and a baseline image x 1 .
The objective function is then P ( φ ) = ∫0 F ( x 0 + φ ( t )( x 1 (cid:0) x 0 ))
d t (see §4).
Assuming that F ( x 0 ) ≃ 1 and F ( x 1 ) ≃ 0 , maximising the objective function means that we try to find an ablation path that stays as long as possible in the decision region of x 0 .
Intuitively, we try to replace as many pixels of x 0 by pixels of x 1 while staying in the same class as x 0 .
The main contribution of this paper is to formulate the saliency problem as an optimisation problem on paths.
Doing so connects previous notions of saliency, notably integrated gradients Sundararajan et al.
(2017) (see §4.1), the ablation tests Sturmfels et al.
(2020) (see §4.2), and meaningful perturbations Fong & Vedaldi (2017); Fong et al.
(2019) (see §4.3).
Our formulation is also resolution invariant (it does not assume that images are defined on pixels); this allows to make a clear difference between images and their duals, for instance, which gives guidance as to where regularisation is needed.
Related Work
Simonyan et al.
(2013) defines a saliency map as the gradient of the network output at the given image.
This would appear to be a sensible definition, but the resulting saliency is very noisy because the network output is roughly constant around any particular image.
Selvaraju et al.
(2016) improves the situation by computing the gradient after each layer instead.
This is, however, not a black-box method such as the one we propose.
Koh & Liang (2017) computes an influence function , that is, a function that measures how the parameters would be changed by a change in the training data.
Although it is a black-box method, it is not a saliency method per se.
They use the gradient of the network output to find the pixel most likely to have a high saliency.
The pixel that have most effect are given a higher saliency.
By contrast, Petsiuk et al.
(2018) proposes to directly evaluate the saliency by finding out which pixels most affect the output, similarly to Fong & Vedaldi (2017), but without using any gradients.
There are a number of meta-studies of saliency methods.
Adebayo et al.
(2018) lists essential properties, for instance the requirement that the results should depend on the training data in a sense that perturbing model parameters should change the saliency.
Kindermans et al.
(2017) proposes a number of property that saliency methods should satisfy.
Ancona et al.
(2017) compares several saliency methods and proposes a method to evaluate them (the sensitiviy- n property).
Ablation Paths 3.1 Images and Masks
We consider a compact domain Ω .
Note that Ω may be discrete or continuous: in fact, we assume that Ω is endowed with a measure which could be the discrete measure (if Ω is a set of pixels) or the
Lebesgue measure (if Ω is a domain in R 2 , for instance).
In the sequel, ∫ Ω denotes integration with respect to that measure.
Without loss of generality, we assume the mass of that measure to be one, i.e., ∫ Ω 1 = 1 .
We consider a module M of functions on Ω with values in a vector space V (the dimensions of
V represent the channels , and elements of M represent images ).
This module is equipped with a commutative ring R which represents masks .
Concretely, in most of the paper we choose
[Equation]
The module structure simply means that masks can multiply images, i.e., that the operation (cid:18)x gives a new image in M when (cid:18) 2 R and x 2 M , and that this operation is bilinear.
3.2 Ablation Paths
Definition 3.1.
We define the set A of ablation paths as the set of functions φ : [0 ; 1] !
R fulfilling the following properties:
Boundary conditions φ (0) = 0 and φ (1) =
Monotonicity
[Equation]
Constant speed
[Equation]
We will call monotone paths the paths that verify the first two conditions but not the third.
Note that the set A of ablation paths is a convex subset of L 1 ([0 ; 1] ; R ) .
Some comments on each of those requirements are in order.
(i)
and 1 denote here the constant functions zero and one (which corresponds to the zero and one of the algebra R ) (ii) φ ( t 1 ) (cid:20) φ ( t 2 ) should be interpreted as usual as φ ( t 2 ) (cid:0) φ ( t 1 ) being in the cone of nonnegative elements 1 .
(iii)
If t 7! ∫ Ω φ ( t ) is differentiable, this requirement can be rewritten as dd t ∫ Ω φ ( t ) = 1 , so it can be regarded as a constant speed requirement.
This requirement is more a normalisation than a requirement, as is further detailed in Remark 3.3.
There is a canonical, simplest, ablation path between x 0 and x 1 :
[Equation]
The mask is thus constant in space at each time t .
The reader should check that all the requirements for an ablation path are fulfilled.
Note that an ablation path without the constant-speed property can always be transformed into one that does fulfil it.
This is clear if the function t 7! ∫ Ω φ ( t ) is strictly increasing, as this is then just a time reparameterisation, but this is in fact always possible, in a canonical sense.
The proof is in
Appendix A.
Lemma 3.2.
To any monotone path there corresponds a canonical ablation path.
Since R is itself a function space, an ablation path φ is in fact a function of two arguments.
In the sequel, we will abuse the notations and write φ as a function of one or two arguments depending on the context: φ ( t ) (cid:17) φ ( t; (cid:1) ) .
For instance, in the definition Definition 3.1 above, ∫ Ω φ ( t ) (cid:17) ∫ Ω φ ( t; (cid:1) )
(cid:17)
[Equation]
Remark 3.3.
If the ablation path φ is differentiable in time, the requirements in Definition 3.1 admit a remarkable reformulation.
Define
[Equation]
t ) :
= dd t φ ( t ) .
All the requirements in Definition 3.1 are equivalent to the following requirements for a function
[Equation]
The corresponding ablation path φ is then recovered by φ ( t ) := ∫
[Equation]
0 ( s ) d s .
What this means is that differentiable ablation paths can be parameterised as densities of doubly stochastic Markov transition kernels on [0 ; 1] (cid:2) Ω .
3.3 Regularity of Ablation Paths
Lemma 3.4.
If φ is an ablation path, then
[Equation]
In particular, t 7!
φ ( t; (cid:1) ) is continuous as a function [0 ; 1] !
L
[Equation]
Ω
[Equation]
Proof.
Choose t 0 ; t 1 in [0 ; 1] .
Without loss of generality, assume t 1 (cid:21) t 0 .
Then, ∫ Ω j φ ( t 1 ) (cid:0) φ ( t 0 )
j = ∫ Ω ( φ ( t 1 ) (cid:0) φ ( t 0 ))
=
t 1 (cid:0) t 0 , from which we conclude that φ ( t 1 ) (cid:0) φ ( t 0 ) is in L 1 and fulfils the equation above.
Score of an Ablation Path
We now fix two points x 0 (the current image ) and x 1 (the baseline image ) in the space of images M .
We propose the following measure of the score of an ablation path (see Definition 3.1) with respect to these two images.
Given a mask (cid:18) 2 R , we define the interpolated image [ x 0 ; x 1 ] (cid:18) 2 M as
[Equation]
We now define the score function P : A !
R from ablation paths to R by the integral
P
[Equation]
Note that, as F is bounded between zero and one, so is P ( φ ) for any ablation path φ .
The main idea is that if F ( x 0 ) ≃ 1 and F ( x 1 ) ≃ 0 , the higher this value of P is, the better the path is to describe the salient parts of the image.
Note that the function P is defined regardless of the constraints placed on ablation paths, i.e., the score function P is defined on the vector space of functions φ : [0 ; 1] !
R .
It is straightforward to compute its differential d P on that space:
[Equation]
So if we define the product of D 2 M (cid:3) and x 2 M producing an element in R (cid:3) by ⟨ xD; φ ⟩ := ⟨
D; xφ ⟩ as is customary, we can rewrite this differential as
[Equation]
Note that we know that any ablation path is bounded, so φ 2 L 1 ([0 ; 1] ; R ) , so the differential of P at φ can be identified with the function d P φ =
[ t 7!
( x 1 (cid:0) x 0 ) d F [ x 0 ;x 1 ] φ ( t ) ] in L 1 ([0 ; 1] ; R (cid:3) ) .
4.1 Relation with the Integrated Gradient Method
When this differential is computed on the interpolation path ℓ ( 1) and then averaged , then this is exactly the integrated average gradient Sundararajan et al.
More precisely, the integrated gradient is exactly
[Equation]
Note that this is in fact an integrated differential , since we obtain an element in the dual space M (cid:3) , and this differential should be appropriately smoothed along the lines of §5.1.
4.2 Relation to Pixel Ablation
Given a saliency function (cid:27) 2 R we can define a path by ~ φ ( t ) :
= 1 (cid:27) (cid:20) log ( t /(1 (cid:0) t )) when t 2 (0 ; 1) and define ~ φ (0) :
= 0 , ~
φ (1) :
= 1 .
This path is a monotone path, except in the module of images
M =
L 2 (Ω ; V ) , equipped with the ring of masks R =
L 1 (Ω) .
To be an ablation path, it still needs to be transformed into a constant speed path, which is always possible as explained in Appendix A.
Note that this is a generalisation of the ablation method in Sturmfels et al.
In that case, the set Ω would be a discrete set of pixels.
Note that in the ranking, pixels with the same saliency would be ranked in an arbitrary way and added to the mask in that arbitrary order.
In the method above, we add them all at once, but the time reparameterisation keeps that function constant longer for however many pixels were ranked the same.
As long as the ranking is strict (no two pixels have the same saliency), the two methods are the same.
4.3 Relation to Meaningful Perturbations
In the saturated case, that is, if F only takes values zero and one (or in the limit where it does), our method basically reduces to finding the interpolation with the largest mask on the boundary, in essence the approach of Fong & Vedaldi (2017).
Indeed, suppose that the ablation path φ crosses the boundary at time t (cid:3) .
It means that F ( [ x 0 ; x 1 ] φ ( t ) ) has value one until t (cid:3) and zero afterwards, so the score P defined in (2) is P ( φ )
=
t (cid:3) .
By the constant speed property, t (cid:3) = ∫
Ω φ ( t (cid:3) ) , so we end up maximising the mask area on the boundary.
Optimisation Problem and Algorithm
We proceed to define the optimisation problem at hand and how to solve it numerically.
Conceptually we try to find the ablation path (see Definition 3.1) that maximises the score P ( φ ) :
[Equation]
Recall that the set A of ablation paths is convex; however, since the objective function P is not convex, this is not a convex optimisation problem.
The method we suggest is to follow a gradient direction.
Such an approach is in general not guaranteed to approximate a global maximum, but empirically it does manage that quite well here.
5.1 Gradient and Metric
Note that the differential is an element of L 1 ([0 ; 1] ; R (cid:3) ) , so we need a map from that space to L([0 ; 1] ; R ) .
For now we assume that φ 2 L 2 ([0 ; 1] ; R ) and d P 2 L 2 ([0 ; 1] ; R (cid:3) ) .
However, we still need a covariance operator K : R (cid:3) !
R .
In practice, we use a covariance operator associated to a smoothing operator.
For a measure (cid:22) 2 R (cid:3) , ⟨ K(cid:22); (cid:18) ⟩ := ⟨ (cid:22); ∫ Ω k ( (cid:1)(cid:0) r ) (cid:18) ( r ) d r ⟩ , where k is a suitable smoothing function, for instance k
( r ) =
exp ( (cid:0)∥ r ∥ 2 / (cid:27) ) .
This allows us to consider the gradient of P .
Note that different choices of metric will influence on the algorithm.
Since the optimisation problem is constrained (since φ is constrained by the requirements in Definition 3.1), following the gradient direction will lead us to violate the constraints.
Since the constraints are convex, it is straightforward enough to project each gradient-updated version back to something that does fulfill them, and indeed that is the idea behind our algorithm, however in practice it does by itself not yield convergence without impractically many iterations.
See Appendix C for the details of how we actually proceed.
Examples
To test out our path-scoring approach and the saliency method based on its optimisation, we use a standard image classifier deep-CNN (Inception v4 Szegedy et al.
(2016), pre-trained on ImageNet), with a selection of real-world images for both the current target and baseline inputs.
For each example pair, we compare multiple saliency methods.
Our algorithm yields a whole path of masks, which cannot as a whole be visualised in one 2D view.
Generally, the threshold mask , which we define as the mask right where the path crosses the decision boundary, is most insightful: it still preserves enough of the image to be classified correctly, but no more.
All of the images in this section refer to that selection, and where the threshold lies in the path is indicated by the vertical black line in the score plots.
To be precise, this is the mask that preserves as little of the image as possible whilst still resulting in the intended class keeping the highest probability among the classes in the classifier’s prediction.
Note that although the threshold mask encapsulates a large part of our method’s useful output, we find that the additional information from the rest of the path, and the score-plot along the path, also provide good diagnostics especially in examples where the mask highlights an unexpected region of the image.
Figure 2 is an example with particularly clear-cut interpretation: the vibrantly coloured rubber eraser is sufficient to retain the classification even in an almost completely ablated image.
All of the compared methods manage to find a mask that focuses in on that, though with differences in the details.
The unconstrained optimisation narrows it down to a few individual pixels, which gives an extremely good score (somewhat unsurprisingly, since that is what is being optimised), but the result is hardly useful for interpretability purposes: this should be considered an adversarial example.
One interpretation of this is that identifying the gradient with the differential implies that the space of masks R is essentially bounded functions wihout further regularity (see §5.1), similar to the mask space in §4.2.
The region boundary in that space seems to be extremely close to the baseline, and the optimisation method finds those adversarial examples.
[Figure]
The integrated gradient method in principle also has this issue, and indeed the corresponding mask (pixel ranking, cf.
§4.2) is quite grainy/noisy, without however behaving adversarially (the entire pencil is highlighted).
The authors in Fong & Vedaldi (2017) were confronted with similar problems.
We use smoothing filters to compute the gradient, in order to both avoid adversarial examples and to have less noisy saliency masks.
Using that, the path-optimisation still manages to achieve a high score
[Figure]
but now highlights the eraser as a single, clearly interpretable feature.
Filtering can also be applied to integrated gradient before pixel-ranking.
That does avoid the noisyness, but it also leads to a blobby shape of the masks.
Comparison with a random-order ablation confirms that the good scores of the saliency methods really are a result of non-trivial feature highlighting, rather than something that comes out of the transition between the images automatically.
In Figure 3 it is evident that the saliency methods do not in general agree so clearly.
Here, the filtered optimal path again highlights a small, single region that is sufficient for a classification of the image as a house- rather than goldfinch.
Arguably, this is again adversarial (a human would certainly label the composite image gold- rather than house finch).
However it does give rise to a useful interpretation: note that the highlighted region includes the house finch’s plumage, whilst covering specifically the wing of the gold finch (which features a distinctive pattern not seen on house finches).
So in this case, the saliency tells more about the baseline than about the current target.
The integrated gradient meanwhile hardly manages to mask out anything at all, before the classification switches to gold finch.
Practically speaking, saliency is particularly interesting in questions of whether a classification was actually correct.
Figure 4 shows an example where the model misclassified an apple as a fig.
The unstable scores in even the optimised ablation path are perhaps symptomatic of this (we are not sure how representative this is); nevertheless both our method and integrated gradients find a mask of less than half of the image that still retains the fig-classification.
Whilst with integrated gradients, this mask includes the apple (which might in a real-world unclear situation lead one to think the classification payed attention to the intended target, increasing credibility), out method highlights mainly a patch of background at the border of the image.
The optimised paths depend not only on the model and current target, but also on the baseline; notice for example that the pencil, of which in Figure 2 mostly the eraser was highlighted, is in Figuremostly characterised by the eraser’s metallic joint as well as part of the blue shaft, which happens to coincide with the gold finch’s wings that were also masked out in Figure 3.
In Figure 6 it is something in between.
Still the results (with filtering) tend to be relatively coherent across baselines, more so than with the Integrated Gradients or the adversarial unfiltered ones.
One might ask why to use a true image as a baseline at all (as opposed to a blurred image, a constant colour image, as in Sturmfels et al.
(2020) or Fong & Vedaldi (2017)).
The problem with artificial baselines is that the network missclassifies them (a blurred goldfinch is classified as a power drill, for example), so the ablation path crosses region where the network is extrapolating wildly.
The resulting saliency may be difficult to interpret since the –unknown– parts of the baseline which the networks considers as important (which part of the blurred goldfinch lead to the power drill classification?)
have an influence on the saliency of the current image.
Ideally, we would like to have some result about saliency that gives good scores across many different baselines.
Future research is needed.
Another choice to be made is the regularisation.
We used here Gaußian filters; different sizes compared in Figure 6.
It is a tradeoff between blurring out the boundaries and inviting noisiness, however even a small filter appears to be enough to avoid the algorithm from converging to adversarial examples (seemingly smaller than what Fong et al.
(2019) require).
It is even possible to scale down the filter during the optimisation to eventually give very sharp edges but not noise elsewhere, though it is somewhat dubious what sense this makes mathematically, from the point of view that the filtering represents just a metric on R .
Again, further research is needed to assess the reliability.
[Figure]
[Figure] [Figure]
Pointing game
We evaluate our saliency algorithm using the pointing game method.
This method was introduced in Zhang et al.
(2017) and used, for instance, in Selvaraju et al.
; Fong & Vedaldi (2017).
The primary goal is to show that our method, applied to a good enough image classifier, typically gives results that match what a human would also think of as the important part of the image.
Specifically, we check whether the maximum-salient pixel lies within the bounding box of the object that defines the class.
Table 1 shows some results for our method on various images with blurred image as baseline.
We show a few examples of this pointing game on Figure 7.
See Appendix D for details and caveats with these results.
[Table]
[Figure]
A Canonical Time Reparametrisation
Proof of Lemma 3.2.
The function m : [0 ; 1] !
R defined by m ( t ) :
= ∫
Ω φ ( t ) is increasing and goes from zero to one (since we assume that ∫ Ω 1 = 1 ).
Note first that if m ( t 1 ) =
m ( t 2 ) , then φ ( t 1 )
=
φ ( t 2 ) from the monotonicity property.
Indeed, supposing for instance that t 1 (cid:20) t 2 , and defining the element (cid:18) :
= φ ( t 2 ) (cid:0) φ ( t 1 ) we see that on the one hand ∫ Ω (cid:18) = 0 , on the other hand, (cid:18) (cid:21) 0 , so (cid:18) = 0 and thus φ ( t 1 ) =
φ ( t 2 ) .
Now, define M := m ([0 ; 1])
=
f s 2 [0 ; 1] j 9 t 2 [0 ; 1] m ( t ) =
s g .
Pick s 2 [0 ; 1] .
If s 2 M we define ( s ) :
= φ ( t ) where m ( t ) =
s (and this does not depend on which t fulfills m ( t )
=
s from what we said above).
We remark that
[Equation]
Now suppose that s ̸2 M .
Define s 1 :
=
sup
( M \ [0 ; s ]) and s 2 := inf ( M \ [ s; 1]) (neither set are empty since 0 2 M and 1 2 M ).
Since s 1 2 M and s 2 2 M , there are t 1 2 [0 ; 1] and t 2 2 [0 ; 1] such that m ( t 1 )
=
s 1 and m ( t 2 )
=
s 2 .
Finally define ( s ) :
= φ ( t 1 ) + ( s (cid:0) s 1 ) φ ( t 2 ) (cid:0) φ ( t 1 ) s 2 (cid:0) s.
In this case, ∫ Ω ( s ) = m ( t 1 ) + ( s (cid:0) s 1 )
m ( t 2 ) (cid:0) m ( t 1 ) s 2 (cid:0) s= s .
The path constructed this way is still monotone, and it has the constant speed property, so it is an ablation path.
B L 1 -optimal Monotonicity Projection
The algorithm proposed in Appendix C for optimising monotone paths uses updates that can locally introduce nonmonotonicity in the candidate ^ φ 1 , so that it is needed to project back onto a monotone path φ 1 .
The following routine 3 performs such a projection in a way that is optimal in the sense of minimising the L 1 -distance 4 , i.e.
[Equation]
for all r 2 Ω and any other monotone path # .
The algorithm works separately for each r , i.e. we express it as operating simply on continuous functions p : [0 ; 1] !
R .
The final step effectively flattens out , in a minimal way, any region in
Algorithm 1 Make a function [0 ; 1] !
R nondecreasing [ i [ l i ; r i ]
f t 2 [
[Equation]
1] j p ′ ( t ) (cid:20)
g ▷ Union of intervals where p decreases for i do
[Equation]
j p t ) (cid:20) m i
g r i min f t 2 [ r i ; l i +1 ]
j p t ) (cid:21) m i g end for for i; j do if [ l i ; r i ] \ [ l j ; r j ] then if m j < m i , merge the intervals and recompute m as the new center end if end for return t 7!
{ p ( t ) if t ̸2 [ i [ l i ; r i ] m i if t 2 [ l i ; r i ] which the function was decreasing.
In practice, this algorithm is executed not on continuous functions but on a PCM-discretised representation; this changes nothing about the algorithm except that instead as real numbers, l; r and t are represented by integral indices.
C Path Optimisation Algorithm
As said in tsection § 5, our optimisation algorithm is essentially gradient descent of a path φ : it repeatedly seeks the direction within the space of all paths that (first ignoring the monotonicity constraint) would affect the largest increase to P ( φ ) as per (2).
As discussed before, this choice already requires a metric to obtain a vector-gradient from the covector-differential, which could be either the implicit ℓ 2 metric on the discretised representation (pixels), or a more physical kernel/filter-based metric.
We conceptually use the latter, however for technical reasons do not immediately apply the corresponding filter to the differential but rather to the path , which is not quite equivalent but does have the effect of avoiding noise from creeping into the state.
Unlike with the monotonisation condition, the update can easily be made to preserve speed-constness by construction, by projecting for each t the gradient g on the sub-tangent-space of zero change to
[Figure]
Algorithm 2 Projected Gradient Descent 1: φ (( t; r ) 7!
t )
▷ Start with linear-interpolation path 2: while φ is not sufficiently saturated do 3: for t in [0 ; 1] do 4: x φ;t :
= (1 (cid:0) φ ( t ))
x 0 + φ ( t ) x5: compute F ( x φ;t ) with gradient g :=
∇ F ( x φ;t ) 6: let ^ g :=
g (cid:0) ∫
Ω g ▷ ensure ^ g does not affect mass of φ ( t ) 7: update φ ( t; r ) φ ( t; r ) (cid:0) (cid:13) ⟨ ^ g ( r ) j j x 1 (cid:0) x 0 ⟩ , for r in Ω ▷ (cid:13) is learning rate 8: (optional) apply a filter to φ ( t ) 9: end for 10: (optional) apply nonlinear gain to φ 11: for r in Ω do 12: re-monotonise t 7!
φ ( t; r ) , using Algorithm13: end for 14: clamp φ ( t; r ) to [0 ; 1] everywhere 15: re-parametrise φ , such that
Appendix A
16: end while .
∫ Ω φ ( t ) , by subtracting the constant function times ∫ Ω g ( t ) .
Note this requires the measure of Ω to be normalised, or else considered at this point.
Then we apply these gradients time-wise as updates to the path, using a scalar product in the channelspace to obtain the best direction for φ itself (as opposed to the corresponding image composit x φ;t ).
Simply projecting the updates path then again to the set of legal (in the sense of Definition 3.1) ablation paths would presumably enough to converge towards a saturated path with high score, however
[Figure]
in tests with artificial constant gradient we found out that this requires extremely many iterations, with the number apparently scaling with the image dimension.
The problem here is that saturating updates tend to be undone again by the speed-normalising reparametrisation, except for the most affected pixel.
(Just increasing the learning rate does not help with this.)
If the gradients come from a deep CNN and for every pixel the monotonicity needs to be restored, such many iterations would be prohibitly computation-intensive.
Fortunately we can dramatically speed up the convergence by artificially encouraging saturation.
We tweak the ablation path φ pointwise with a sigmoidal function that brings values lower thanslightly closer to 0 , and values greater than 12 slightly closer to 1 .
To this end, we use a perturbation of the identity function defined by x 7! x
+ ϵ ( x ) , and apply it pointwise to the path:
[Equation]
The perturbation function ϵ : [0 ; 1] !
R has the property that x + ϵ ( x ) maps [0 ; 1] into itself.
The function ϵ we use is plotted on Figure 9.
Although this perturbation seems small, the examples in § now only require 20-40 iterations.
As to the motivation behind the transformation φ !
φ + ϵ ( φ ) , notice first that fully saturated masks – i.e., those that choose for every pixel are either zero or one, selecting exactly the value of either the current target or the baseline – are fixpoints of the function x 7!
x
+ ϵ ( x ) since ϵ (0) =
ϵ (1) = 0 .
So if such a mask is the optimum in the algorithm without artificial saturation (while there is no guarantee for this in general, this seems fairly frequent in practice), then it will also be an optimum of the algorithm with artificial saturation.
What is more, the dynamical system x 7! x
+ ϵ ( x ) quickly converges to zero or one, which efficiently encourages saturation, without sacrificing precision, as the function ϵ we chose is quite small.
Conversely, and unlike high learning rate, the saturation function is by construction monotone, symmetric and keeps the signal within the allowed bounds, so it avoids violating the ablation path constraints.
The problem with high learning rates is that the algorithm gets caught in a sequence of alternating strong constraint-violating updates followed by a projection step that largely undoes the previous update.
D Evaluation with Pointing Game
The Pointing Game, the results of which we show in §7, is a way to verify that the saliency method points at a region that a human would consider relevant to the classification.
It is often the region of an image that contains the physical object which is being classified.
Such evaluations of saliency methods clearly have caveats.
One can for instance argue that the cases when the saliency points somewhere outside the bounding box are the most insightful ones, as they indicate that the classifier is using information from an unexpected part of the image (for instance, the background).
Another caveat is that, if winning at the pointing game is the goal, a saliency method is only as good as its underlying classifier is.
Nevertheless, if a saliency method often hits the bounding box it is reasonable to conclude that both the classifier and the saliency method behave in an intuitive way, from a human perspective.
Our measurements in Table 1 confirm that the ablation-path method indeed does this well.
Our method has an advantage over other ones as it yields not only a single spatial map as the saliency but a whole path of masks.
However, it does not directly give a saliency map.
Here is how we choose one point in the image from an ablation path.
First, we choose a specific time, just as we did in the examples in §6.
In most cases, this means that we chose the time at which the probability has dropped by 20 %, that is the smallest time t such that F ( t ) (cid:20) 0 : 8 .
When there is no such time, we pick the one for which F takes the maximum value on the path.
Now that the time is chosen, we pick the point in the mask which have the smallest value.
Note that, even though this selection may be unstable (since many points are close to the minimum value, as the mask is typically saturated), it usually does not matter since the whole region selected by the mask is salient.
The classifier in this experiment was an EfficientNet Tan & Le (2019) pre-trained on ImageNet, the test data set 360 images from three synsets out of ImageNet.
As a comparison, we evaluated the pointing game with the same network and inputs also through the closely related Meaningful Perturbations method Fong & Vedaldi (2017).
We used a third-party
PyTorch implementation Gildenblat (2017).
Note that this implementation uses a slightly simplified method of removing information for performance, and that we did not change any of the hyperparameters of the method, so it is very likely that these results are not optimal.
We also note that Fong &
Vedaldi (2017) themselves include results for the pointing game on different data, with better scores.
Nevertheless, the point was to show that our method works reasonably well, and this may be due to the use of ablation paths: that increasing family of mask probably gives some stability to the saliency method, which improves the scores.
E Random ablation paths
In this section, following an idea of Sturmfels et al.
(2020), we compare our method to random ablation-paths.
Figure 2 includes one such example – the random path, which has a quite fuzzy class transition in roughly the middle of the path.
Figure 10 shows that this typical behaviour.
In
[Figure]
smoothed the unsmoothed case, the scores are almost compactly clustered in the middle, i.e., paths consisting of random single-pixel transitions rarely have exceptional scores.
If the random paths are spatially smoothed, outliers become more likely (the paths could by coincidence mask out a whole particularly relevant region), but the scores are still really unlikely to reach 0.9, something our optimisation approach routinely attains. F More examples
We provide in Figure 11 a series of ablation path results for one class in the ILSVRC datasetRussakovsky et al.
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Table]
[Figure]
[Figure]