TCAV: R ELATIVE CONCEPT IMPORTANCE TESTING WITH L INEAR C ONCEPT A CTIVATION V ECTORS
Anonymous authors
Paper under double-blind review
A BSTRACT
Despite the high performance of deep neural networks, the lack of interpretability has been an obstacle for their use in practice.
In domains with high stakes (e.g., medical diagnosis), the ability to gain insights into the network’s predictions is critical for users to trust and adopt them.
One way to improve the interpretability of a NN is to explain the importance of a particular concept (e.g., gender) in the prediction.
This is useful for explaining the reasoning behind the networks predictions, and for revealing any biases the network may have.
This work aims to provide quantitative answers to the relative importance of concepts of interest via concept activation vectors (CAV).
In particular, this framework enables nonexperts in machine learning to express concepts of interest and test hypotheses using examples (e.g., a set of pictures that illustrate the concept).
We show that CAV can be learned given a relatively small set of examples.
Hypothesis testing with
CAV can answer whether a particular concept (e.g., gender) is more important in predicting a given class (e.g., doctor) than other sets of concepts.
Interpreting networks with CAV does not require any retraining or modiﬁcation of the network.
We show that many levels of meaningful concepts are learned (e.g., color, texture, objects, a persons occupation).
We also show that CAV’s can combined with techniques such as deepdream in order to visualize a network’s understanding of speciﬁc concepts of interest.
We show how various insights can be gained from the relative importance testing with CAV.
I NTRODUCTION
Neural networks often achieve high performance, yet can be too complex for humans understand why they make the predictions they do.
When these powerful black boxes are used in domains with high stakes (e.g., medical diagnosis), being able to provide explanations of a NNs reasoning process is critical and can help gain trust from users.
One frequently-used type of explanation is to attach an importance weight to each input feature.
For example, the learned coefﬁcients in linear classiﬁers or logistic regressions can be interpreted as the importance of each feature for classiﬁcation.
A similar ﬁrst order importance measure exists for
NN’s, such as saliency maps (Erhan et al., 2009;
Selvaraju et al., 2016).
These techniques which use ﬁrst derivatives as a proxy for the importance of each input feature (pixels).
While these approaches are useful, they do not allow users to test any arbitrary features or concepts.
For example, if users want to learn the importance of the concept of gender, existing approaches require that gender be an input feature.
Our work offers quantitative measures of the relative importance of user-provided concepts using concept activation vectors (CAV).
Testing with CAV (TCAV) is designed under the following desiderata:
accessibility : TCAV should require no user expertise in machine learning (ML) 2.
customization : TCAV should be adaptable to any concept of interest (e.g., gender) on the ﬂy without pre-listing a set of concepts before training 3.
plug-in readiness : TCAV should require neither retraining nor modiﬁcation of the model 4.
quantiﬁcation : TCAV should provide a quantitative and testable explanation
One of key ideas for TCAV is that we can test the network with a few concepts of interest at a time, and only aim to learn the relative importance of them, instead of ranking the importance of all possible features/concepts.
For example, we can gain insights by learning whether gender concept was used more than the ’wearing scrubs’ concept for the classiﬁcation of doctor.
Similar forms of sparsity (i.e., only considering a few concepts at a time) are used in many existing interpretable models (Kim et al., 2014; Doshi-Velez et al., 2015; Tibshirani, 1994;
Zou et al., 2004; Ustun et al., 2013; Caruana et al., 2015).
Note that interpretability does not mean understanding the entire network’s behavior on every feature/concept of the input (Doshi-Velez, 2017).
Such a goal may not be achievable, particularly for ML models with super-human performance (Silver et al., 2016).
TCAV satisﬁes all the desiderata — accessibility, customization, plug-in readiness and quantiﬁcation — it enables quantitative relative importance testing for non-ML experts, for user-provided concepts without retraining or modifying the network.
Users express their concepts of interest using examples — a set of data points exemplifying the concept.
For example, if gender is the concept of interest, users can collect pictures of women.
The use of examples has been shown to be powerful medium for communication between ML models and non-expert users (Koh & Liang, 2017; Kim et al., 2014; 2015).
Cognitive studies on experts also support this approach (e.g., experts think in terms of examples (Klein, 1989)).
Section 2 relates this work to existing interpretability methods.
Section 3 explains how this framework work.
Section 4, we show that 1) how this framework learns meaningful directions and 2) the relative importance testing results that shed insights on how network is making predictions.
R ELATED WORK
In this section, we provide a brief overview of existing related interpretability methods and their relations to our desiderata.
We also include the need and the challenges of desiderata
plug-in
readiness.
2. S ALIENCY MAP METHODS
Saliency methods seek to identify regions of the input responsible for the classiﬁcation of the network (Smilkov et al., 2017; Selvaraju et al., 2016; Sundararajan et al., 2017; Erhan et al., 2009;
Dabkowski & Gal, 2017).
Qualitatively, these methods often successfully label regions of the input which are semantically relevant to the classiﬁcation.
Unfortunately, these methods do not satisfy our desiderata of 2) customization and 4) quantiﬁcation.
The lack customization is clear, as the user has no control over what concepts of interest these maps pick up on.
Regarding quantiﬁcation, there is no way to meaningfully quantify and interpret the brightness of various regions in these maps.
As a motivating example, suppose that given two saliency maps of two different cat pictures, one map highlighted the ear of the cat brighter than the other.
It is unclear both how to quantify ’brightness’ and second what kind of actionable insights this brightness level gives.
2. D EEP D REAM , NEURON LEVEL INVESTIGATION METHODS
There are techniques, such as DeepDream, which can be used to visualize the representation learned by each neuron of a neural network.
The technique starts from an image of random noise and iteratively modiﬁes the image in order to maximally activate a neuron or set of neurons of interest (Mordvintsev et al., 2015).
This technique has offered some insights into what each neuron may be paying attention to.
This technique also has opened up opportunities for AI-aided art (Mordvintsev et al., 2015).
However, the DeepDream method does not satisfy our desiderata 1) accessibility, 2) customization, and 4) quantiﬁcation.
It does not satisfy 1) because it does not treat the network as a black box: a user must understand the internal architecture in order to choose which neurons to visualize.
It does not satisfy 2) because no current method exists to ﬁnd which neurons correspond to semantically meaningful concepts such as gender, and it is unclear whether or not such a neuron even exists.
It does not satisfy 4) because we do not understand these pictures and there is currently no method to quantify how these pictures relate to the output of the network.
This method again does not provide actionable insight.
Even if we could understand the pictures produced by DeepDream, often neural networks have too many neurons (e.g., Inception (Szegedy et al., 2015)) to investigate.
Humans are typically not capable of digesting this amount of information.
2. W HY DO WE NEED DESIDERATA 3 - PLUG - IN READINESS
When interpretability is an objective, we have two options: (1) restrict ourselves to inherently interpretable models or (2) post-process our models to make them more interpretable.
Users may choose option (1) as there are a number of methods to build inherently interpretable models (Kim et al., 2014; Doshi-Velez et al., 2015; Tibshirani, 1994;
Zou et al., 2004; Ustun et al., 2013; Caruana et al., 2015).
If the users are willing and are able to adapt these models, then this is the gold standard.
Although building inherently interpretable machine learning models may be possible for some domains, this often requires compromising on performance.
An interpretable method that can be applied without retraining or modifying the network could be instantly applied to existing models.
The need to be able to explain an ML method without rebuilding the whole pipeline is urgent, and may also applied to models already in production.
The
EU Right to explanation requires ML methods with no human in the loop to provide explanation by year 2018 (Goodman & Flaxman, 2016).
All highly engineered ML methods would have to comply to this rule.
2. A NOTE ON DESIDERATA 3 - PLUG - IN READINESS AND LOCAL EXPLANATIONS
One of many challenges of building a post-processing interpretable method is to ensure that the explanation is truthful to the model’s behavior.
There may exist inconsistencies between the explanations and the model’s true reasoning behind its behavior.
For instance, one of post-processing methods for neural networks, saliency methods, have been shown to be vulnerable to constant shift in input that does not affect classiﬁcation.
Pieter-Jan Kindermans (2017) showed that simply applying a mean shift for the dataset can cause some saliency methods to result in signiﬁcant changes in the explanation.
This shows that despite the usefulness of these methods, they may not be truthful to how model is actually making decisions.
One way to ensure consistency between explanations and the model’s reasoning is to use the generated explanation as an input, and check the network’s output for validation.
This is typically used in perturbation-based interpretable methods (Koh & Liang, 2017; Ribeiro et al., 2016).
These methods perturb the input, and observe the network’s response, and use that to generate explanations.
They are truthful either locally or globally 1 by construction.
Even a truthful explanation may be misleading if it is only locally truthful (Ribeiro et al., 2016).
For example, since the importance of features only needs to be truthful in the vicinity of the data point of interest, there is no guarantee that the method will not generate two completely conﬂicting explanations.
These inconsistencies may result in decreased user trust at a minimum.
On the other hand, making a globally truthful explanation may be difﬁcult as the networks decision boundaries may be complex.
TCAV produces globally truthful explanations, by focusing on a few concepts of interest at a time.
TCAV M ETHOD
The interpretability methods discussed in the previous section illustrate two common themes.
First, linearity is a powerful technique for interpretability, but usually requires signiﬁcant trade-offs in order to apply.
For example, Ribeiro et al.
(2016) creates only local interpretations, while generalized additive models represent a highly restricted class of functions.
A second theme in interpretability research is that directly tying interpretations to training data is a powerful tool.
Motivated by these two ideas, we introduce a method that seems to allow global linear interpretability of a highly ﬂexible class of models, namely deep feedforward neural networks trained on classiﬁcation tasks.
Furthermore, this method is intrinsically tied to real-world data that represents concepts of interest to a human analyst, and can be used to test the relative importance of concepts.
Informally, the key idea is this: although feedforward networks learn highly nonlinear functions there is evidence that they work by gradually disentangling concepts of interest, layer by layer (Alain & Bengio, 2016;
Bau et al., 2017).
It has also been shown that representations are not necessarily contained in individual neurons but more generally in linear combinations of neurons (Raghu et al., 2017).
Thus the space of activation vectors for later layers may have a meaningful global linear structure.
Furthermore, if such a structure exists, we can uncover it by training a linear classiﬁer on activation vectors corresponding to a human-selected subset of input examples.
We now formalize this intuition.
First, we formally deﬁne a concept activation vector .
Let us imagine that an analyst is interested in a given concept C (e.g., zebra) and has gathered two sets of data points, P C and N , that represent positive and negative examples of this concept (say, photos of zebras, versus a set of random photos).
Typically the set N can simply be all training examples except for P C .
Here we represent the input to the network as vector in R n , and P C , N ⊂ R n .
Suppose that our layer l of the feedforward network consists of m neurons.
Then running inference on an input example and looking at the activations at layer l yields a function f l : R n → R m .
Our two sets P C and N naturally give rise to two sets of activation vectors in layer l , namely f l ( P C ) and f l ( N ) .
We can then train a linear classiﬁer on the binary classiﬁcation task of distinguishing between these two sets.
The weights of this classiﬁer are an element v lC ∈ R m .
We call this the concept activation vector for the concept C .
A variation on this idea is a relative concept activation vector.
Here the analyst selects two sets of inputs that represent two different concepts, C and D .
Training a classiﬁer on f l ( P C ) and f l ( P D ) yields a vector v lC,D ∈ R m which intuitively represents the distinction between the two concepts.
A key beneﬁt of this technique is the ﬂexibility allowed in choosing the set P C .
Rather than being tied to the class labels in the training data, an analyst can–after training–select sets that correspond to any concept of interest.
We now describe two ways that this technique be used to interpret a feedforward classiﬁer network.
In the next section we discuss the results of experiments with these methods.
3. A PPLICATION : W HERE ARE CONCEPTS LEARNED ?
As a simple demonstration of the value of concept activation vectors, we describe a technique for localizing where a concept is disentangled in a network.
A common view of feedforward networks is that different concepts are represented at different layers.
For example, many image classiﬁcation networks are said to detect textures at low levels, with increasingly complex concepts recognized at later layers.
Typically evidence for this view comes from various methods of reverseengineering (Bau et al., 2017; Zeiler & Fergus, 2014; Mordvintsev et al., 2015) the behavior of individual neurons in the network.
Using concept activation vectors, however, we can approach this question from the opposite direction.
We can pick out a particular concept C in advance, and consider the concept vectors v 1 C , v 2 C , . .
. , v kC for each layer in the network.
The changes in accuracies of the classiﬁers, a 1 C , a 2 C , . .
. , a 3 C then provide a measure of how well disentangled the concept is in each layer.
This may be viewed as a generalization of the ideas in (Alain & Bengio, 2016;
Bau et al., 2017).
In the next section we describe the results of an experiment based on this idea.
A PPLICATION :
T ESTING THE RELATIVE IMPORTANCE OF CONCEPTS
The real value of concept activation vectors comes from the fact that they may be used to test the relative importance of concepts.
For example, an analyst might ask about a photo of a zebra, ”was the presence of stripes in the image relevant to the model’s classiﬁcation of the image as a zebra?”
In some cases, with tedious effort in a photo retouching program, it might be possible answer questions like this directly.
However, concept activation vectors provide a faster and more general technique.
Consider an input x and concept C of interest.
At inference time, this will give rise to activations f l ( x ) at layer l .
We can then modify this vector in various ways using the concept vector v lC .
For example, we might create a new vector w − =
f l ( x ) − v lC , which might be viewed as a counterfactual of ” x with less of concept C ”.
Performing inference starting at layer l + 1 based on w − will give a new classiﬁcation result y w .
We can also create a new vector w + = f l ( x ) + v lC , which might be viewed as a counterfactual of ” x with more of concept C ”.
Thus to test the relevance of stripes to the classiﬁcation of a zebra, we would either add or subtract a ”stripe” concept activation vector from the zebra image activation vector, run forward propagation the results, and examine the ﬁnal layer of the network.
Large changes in the probability of zebra would indicate that stripes played a key role in the classiﬁcation.
Quantitatively, the metric of the inﬂuence of the concept C to class k can be measured by
[Equation]
where p k ( y ) represents the probability of class k of prediction y .
Intuitively speaking, I up/downw measures the ratio of data points that become ’more/less like concept C ’ after the modiﬁcation with concept vector v lC .
R ESULTS
In this section, we ﬁrst show evidence that the learned concept activation vector indeed reﬂect the concepts of interest.
Then we show the results for hypothesis testing using these concept activation vectors, and the insights one can gain from it.
All our experiments are based on the model from Szegedy et al.
(2015) using the publicly available model parameters from Inc (2017).
The pictures used to learn the concept activation vectors are collected from the latest ImageNet Fall 2011 release Russakovsky et al.
Each concept vector is learned using between 100-500 pictures as input.
We intentionally chose not to use all the available pictures in order to mirror realistic scenarios where users may not be able to collect a large amount of data.
The class ’arms’ only had 30 pictures, since ImageNet does not include this as a part of the dataset.
The pictures used to learn texture concepts are taken from the Bau et al.
(2017) data set.
In order to learn concept vectors for colors, we generated 500 pictures synthetically by generating the color channels randomly.
4. E VIDENCE OF THE VALIDITY OF LINEARITY ASSUMPTION
In this section we provide evidence that the concept activation vectors accurately reﬂect the given concepts.
We show that the linear maps used to construct them are accurate in predicting the concepts.
Where these concepts in the networks are learned is consistent with general knowledge about the representations learned by neural networks.
Low level features such as edges and textures are detected in the early layers and higher level concepts are only reliably detected in the upper layers.
Next, we use activation maximization techniques (Mordvintsev et al., 2015) to visualize each of the concept activation vectors and observe that the patterns are consistent with the provided concept.
Finally, we show the top k images that are most similar in terms of cosine similarity to each concept activation vector for further qualitative conﬁrmation.
4.1. W HERE EACH CONCEPT IS LEARNED .
Figure 1 shows the accuracy of the linear classiﬁers at each layer in Inception for each type of concept activation vector.
Overall, we observe high accuracy.
This is evidence that the given concepts are linearly separable in many layers of the network.
Note that the accuracy of more abstract concept activation vector (e.g., objects) increases in higher layers of the network.
The accuracy of a simpler concept activation vector, such as color, is high throughout the entire network.
This agrees with prior work on visualizing the learned representations at different layers of neural networks (Zeiler & Fergus, 2014).
This experiment does not yet show that these concept activation vectors align with the concepts that makes sense semantically to humans.
We demonstrate this with the next set of experiments.
[Figure]
In this section, we use the activation maximization technique Mordvintsev et al.
(2015) to visualize the learned representations in the direction of the concept activation vector.
We use an implementation from Mordvintsev.
Figure 2 shows highly recognizable features, such as knitted textures, and corgi faces.
The top images in Fig.
3 show the results for set of colors — red, blue, green and yellow (each column) and for the set of layers (lower to higher layers from top to bottom).
There seems to be less variance in each layer as the depth increase.
The bottom image shows textures.
Each column represents lace-like, honeycombed and bumpy.
It appears that lower layers learn a uniform scale of texture, and introduce different scales as the depth increases.
These pictures provide some qualitative conﬁrmation that the learned directions align with the given concepts.
However, they do not rule out the possibility that the concept activation vectors are ’noisy’ in some way.
Since the process which produces the concept activation vector only cares about accurately distinguishing between the small set of provided concepts, the concept activation vectors may have also contain other concepts.
For example, striped-ness vector may also be correlated t-shirt- ness.
The next section provides experiments that the concept activation vector s are indeed aligned with the concept of interest.
4.1. Q UALITATIVE CONFIRMATION : PICTURES THAT ARE SIMILAR TO CONCEPT ACTIVATION VECTOR
In order to qualitatively conﬁrm that the learned concept activation vector aligns with meaningful concepts, we compute cosine similarity between a set of pictures (all from one class) to the concept activation vector.
Fig.
4 shows that [point out a couple things].
We also observe that if there is not much relation between pictures and the concept, the cosine similarity is low.
This experiment qualitatively supports our argument that the alignment between concept activation vectors and the meaningful concepts.
We recommend doing this before
When using TCAV, in order to ensure that the provided examples were sufﬁcient to learn CAV, we recommend users to check cosine similarity with each concepts to the class.
Now we need quantitative measures.
See one-sided hypothesis testing in the next section.
4. T ESTING R ELATIVE I MPORTANCE OF C ONCEPTS
To recap, I up/downw + is the ratio of increased/decreased probability of class for w + = f l ( x ) + v lC .
I up/downw − is the same metric for w − =
f l ( x ) − v lC .
When comparing I upw
+
and I upw − (ﬁrst two columns) in Fig 5, we see that they are often almost inverse of each other.
This conﬁrms that adding or subtracting v lC clearly shows impact on the classiﬁcation task, conﬁrming that the v lC captures an important aspect of the prediction.
Also note that I upw + is often similar to I downw − , and I upw − is to I downw + .
Intuitively, this means that there were rarely the case that adding/subtracting v lC maintained the probability of class k prediction, p k
( y w ) — adding and subtracting v lC always caused predictions to swing.
In our view, this testing captures intrinsic aspects of the class (e.g., ﬁre engine is to red, cucumber is to bumpy, zebra is to striped) and associations (e.g., suit is to CEO).
For example, in Fig 5, the yellow color was more inﬂuential to cab class than any other colors.
This shows that the collected dataset is mostly from countries or cities where color of the cab is yellow (in some cities, cabs are red, green, etc.).
From the result that our women class was highly relevant to bikini class, we infer that the bikini pictures we collected have humans wearing the bikini rather than pictures of the clothing.
The graph for dumbbell class in Fig 5 shows that arms concept was more important to predict dumbbell class than other concepts.
This ﬁnding is consistent with ﬁndings from Mordvintsev et al.
(2015), where it discovered that deepdream picture of a dumbbell also showed an arm holding it.
Unlike all other concepts in this ﬁgure, we only collected 30 pictures of each concept (ImageNet did not have arms as a label).
Despite the small number of examples, we are still able to perform TCAV.
C ONCLUSION
We have introduced the TCAV method, which enables quantitative relative importance testing for non-ML experts.
TCAV uses user-provided concepts and does not depend on retraining or modifying the network.
TCAV satisﬁes the desiderata — accessibility, customization, plug-in readiness and quantiﬁcation.
TCAV can be also used to contrast two trained networks.
For example, one can compare the relative importance of concepts to determine how the different choices of training process or architecture inﬂuences learning of each concept.
Based on this, users can perform model selection based on the concepts that are more or less important for the task.
We hope TCAV can be also used to remove or amplify concepts in the network.
This is useful for de-biasing network.