C AN I TRUST YOU MORE ? M ODEL -A GNOSTIC H IERARCHICAL E XPLANATIONS
Anonymous authors
Paper under double-blind review
A BSTRACT
Interactions such as double negation in sentences and scene interactions in images are common forms of complex dependencies captured by state-of-the-art machine learning models.
We propose Mah´e , a novel approach to provide M odel- a gnostic h ierarchical ´e xplanations of how powerful machine learning models, such as deep neural networks, capture these interactions as either dependent on or free of the context of data instances.
Speciﬁcally, Mah´e provides context-dependent explanations by a novel local interpretation algorithm that effectively captures any-order interactions, and obtains context-free explanations through generalizing contextdependent interactions to explain global behaviors.
Experimental results show that Mah´e obtains improved local interaction interpretations over state-of-the-art methods and successfully provides explanations of interactions that are contextfree.
I NTRODUCTION
State-of-the-art machine learning models, such as deep neural networks, are exceptional at modeling complex dependencies in structured data, such as text (Vaswani et al., 2017; Tai et al., 2015), images (He et al., 2016;
Huang et al., 2017), and DNA sequences (Alipanahi et al., 2015; Zeng et al., 2016).
However, there has been no clear explanation on what type of dependencies are captured in the black-box models that perform so well (Ribeiro et al., 2018; Murdoch et al., 2018).
In this paper, we make one of the ﬁrst attempts at solving this important problem through interpreting two forms of structures, i.e., context-dependent representations and context-free representations.
A context-dependent representation is the one in which a model’s prediction depends speciﬁcally on a data instance level (such as a sentence or an image).
In order to illustrate the concept, we consider an example in image analysis.
A yellow round-shape object can be identiﬁed as the sun or the moon given its context, either bright blue sky or dark night.
A context-free representation is one where the representation behaves similarly independent of instances (i.e., global behaviors).
In a hypothetical task of classifying sentiment in sentences, each sentence carries very different meaning, but when “not” and “bad” depend on each other, their sentiment contribution is almost always positive - i.e., the structure is context-free.
To investigate context-dependent and context-free structure, we lend to existing deﬁnitions in interpretable machine learning (Ribeiro et al., 2016;
Kim et al., 2018).
A context-dependent interpretation is a local interpretation of the dependencies at or within the vicinity of a single data instance.
Conversely, a context-free interpretation is a global interpretation of how those dependencies behave in a model irrespective of data instances.
In this work, we study a key form of dependency: an interaction relationship between the prediction and input features.
Interactions can describe arbitrarily complex relationships between these variables and are commonly captured by state-of-the-art models like deep neural networks (Tsang et al., 2018; Murdoch et al., 2018).
Interactions which are context-dependent or context-free are therefore local or global interactions, respectively.
We propose Mah´e , a framework for explaining the context-dependent and context-free structures of any complex prediction model, with a focus on explaining neural networks.
The context-dependent explanations are built based on recent work on local intepretations (such as (Ribeiro et al., 2016;
Murdoch et al., 2018; Singh et al., 2018)).
Speciﬁcally, Mah´e takes as input a model to explain and a data instance, and returns a hierarchical explanation, a format proposed by Singh et al.
(2018) to show local group-variable relationships used in predictions (Figure 1).
To provide context-free
[Figure]
explanations, Mah´e generalizes those context-dependent interactions with consistent behavior in a model and determines whether a local representation in the model is responsible for the global behavior.
In this case, Mah´e takes as input a model and representative data corresponding to an interaction of interest and returns whether or not that interaction is context-free.
We conduct experiments on both synthetic datasets and real-world application datasets, which shows that Mah´e ’s context-dependent explanations can signiﬁcantly outperform state-of-the-art methods for local interaction interpretation, and Mah´e is capable of successfully ﬁnding context-free explanations of interactions.
In addition, we identify promising cases where the methodology for context-free explanations can successfully edit models.
Our contributions are as follows: 1) Mah´e achieves the task of improved context-dependent explanations based on interaction detection and ﬁtting performance and model-agnostic generality, compared to state-of-the-art methods for local interaction interpretation, 2) Mah´e is the ﬁrst to provide context-free explanations of interactions in deep learning models, and 3) Mah´e provides a promising direction for modifying context-free interactions in deep learning models without signiﬁcant performance degradation.
R ELATED W ORKS
Attribution Interpretability : A common form of interpretation is feature attribution, which is concerned with how features of a data instance contribute to a model output.
Within this category, there are two distinct approaches: additive and sensitivity attribution.
Additive attribution interprets how much each feature contributes to the model output when these contributions are summed.
In contrast, sensitivity attribution interprets how sensitive a model output is to changes in features.
Examples of additive attribution techniques include LIME (Ribeiro et al., 2016) and CD (Murdoch et al., 2018).
Examples of sensitivity attribution methods include Integrated Gradients (Sundararajan et al., 2017), DeepLIFT (Shrikumar et al., 2017), and SmoothGrad (Smilkov et al., 2017).
Unlike previous approaches, Mah´e provides additive attribution interpretations that consist of non-additive groups of variables (interactions) in addition to the normal additive contributions of each variable.
Interaction Interpretability : An interaction in its generic form is a non-additive effect between features on an outcome variable.
Only until recently has there been development in interpreting nonadditive interactions despite often being learned in complex machine learning models.
The difﬁculty interpreting non-additive interactions stems from their lack of exact functional identity compared to, for example, a multiplicative interaction.
Methods that exist to interpret non-additive interactions are NID (Tsang et al., 2018) and Additive Groves (Sorokina et al., 2008).
In contrast, many more methods exist to interpret speciﬁc interactions, namely multiplicative ones.
Notable methods include
CD (Murdoch et al., 2018), Tree-Shap (Lundberg & Lee, 2017), and GLMs with multiplicative interactions (Purushotham et al., 2014).
Unlike previous methods, our approach provides local interpretations of the more challenging non-additive interaction .
Locally Interpretable Model-Agnostic Explanations (LIME) :
LIME (Ribeiro et al., 2016) is a very popular type of model interpretation.
Its popularity comes from additive attribution interpretations to explain the output of any prediction model.
The original and most popular version of LIME uses a linear model to approximate model predictions in the local vicinity of a data instance.
Since its introduction, variants of LIME have been proposed, for example Anchors (Ribeiro et al., 2018) and LIME-SUP (Hu et al., 2018).
While Anchors generates a form of context-free explanation, its method of selecting fully representative features for a prediction does not consider interactions.
For example, Anchors assumes that (not, bad) “virtually guarentees” a sentiment prediction to be positive, whereas in Mah´e this is not necessarily true; only their interaction is positive (See Table 6 for an example).
LIME-SUP touches upon interactions but does not study their interpretation.
I NTERACTION E XPLANATIONS
Let f ( · ) be a target function (model) of interest, e.g. a classiﬁer, and φ ( · ) be a local approximation of f and is interpretable in contrast to f .
A common choice for φ is a linear model, which is interpretable in each linear term.
Namely, for an data instance x ∈ R p , weights w ∈ R p and bias b , interpretations are given by w i x i , known as additive attributions (Lundberg & Lee, 2017) from
[Equation]
Given a set of n data points { x ( i ) } ni =1 that are inﬁnitesimally close or local to x , a linear approximation of D = { ( x (1) , f ( x (1) )) , . . .
, ( x ( n ) , f ( x ( n ) )) } will accurately ﬁt to the functional surface of f at the data instance, such that φ ( x ) =
f
( x ) .
Because it is possible in such scenarios that φ ( x ) = f ( x ) ≈ b , there must be some nonzero distances between x and x ( i ) to obtain informative attribution scores.
LIME, as it was originally proposed, uses a linear approximation as above where samples are generated in a nonzero local vicinity of x (Ribeiro et al., 2016).
The drawback of linear
LIME is that there is often an error (cid:15) =
| f
( x ) − φ ( x ) | > 0 .
For complex models f , the functional surface at x can be nonlinear.
Because D consists of x ( i ) with distance d > 0 from x , a closer ﬁt to f ( x ) in its nonlinear vicinity, i.e. { f ( x ( i ) ) } ni =1 , can be achieved with the following generalization of Eq. 1:
[Equation]
where g i ( · ) can be any function, for example one that is arbitrarily nonlinear.
This function is called a generalized additive model (GAM) (Hastie & Tibshirani, 1990), and now attribution scores can be given by g i ( x i ) for each feature i .
For the purposes of interpreting individual feature attribution, the GAM may be enough.
However, if we would like broader explanations, we can also obtain nonadditive attributions or interactions between variables (Lou et al., 2013), which can provide an even better ﬁt to the complex local vicinity.
Expanding Eq.
2 with interactions yields:
[Equation]
where g (cid:48) i ( · ) can again be any function, x I ∈ R |I| are interacting variables corresponding to the variable indices I , and {I i } Ki =1 is a set of K interactions.
Attribution scores are now generated from both g (cid:48)
i and g (cid:48) i .
In this paper, we learn g
i and g (cid:48)
i using Multilayer Perceptrons (MLPs).
φ or φ K can be converted to classiﬁcation by applying a sigmoid function.
Adding non-additive interactions, I , that are truly present in the local vicinity increases the representational capacity of φ K ( x ) .
I corresponds to non-additive interacting features if and only if g (cid:48) ( · ) (Eq. 3) cannot be decomposed into a sum of |I| arbitrary subfunctions δ , each not depending on a corresponding interacting variable (Tsang et al., 2018), i.e. g (cid:48)
( x I ) (cid:54) =
(cid:88) i ∈I
δ i ( x I\{ i } ) .
Mah´e F RAMEWORK
In this section, we introduce our Mah´e framework, which can provide context-dependent and context-free explanations of interactions.
To provide context-dependent explanations, we propose to use a two-step procedure that ﬁrst identiﬁes what variables interact locally, then learns a model of interactions (as Eq. 3) to provide a local interaction score at the data instance in question.
The procedure of ﬁrst detecting interactions then building non-additive models for them has been studied previously (Lou et al., 2013; Tsang et al., 2018); however, previous works have not focused on using the same non-additive models to provide local interaction attribution scores, which enable us to visualize interactions of any size as demonstrated later in §5.2.3.
4. C ONTEXT -D EPENDENT E XPLANATIONS
Local Interaction Detection : To perform interaction detection on samples in the local vicinity of data instance x , we ﬁrst sample n points in the (cid:15) -neighborhood of x with a maximum neighborhood distance (cid:15) under a distance metric d .
While the choice of d depends on the feature type(s) of x , we always set (cid:15) =
σ , i.e. one standard deviation from the mean of a Gaussian weighted sampling kernel.
When all features are continuous, neighborhood points are sampled with mean x ∈ R p and d = (cid:96) 2 to generate x (1) , . . .
, x ( n ) , x ( i ) ∼ N ( x , σ 2 I ) , where N is a normal distribution truncated at (cid:15) .
When features are categorical, they are converted to one-hot binary representation.
For x of binary features, we sample each point around x by ﬁrst selecting a number of random features to ﬂip (or perturb) from a uniform distribution between 0 and min( p, (cid:15) (cid:48) ) .
The max number of ﬂips (cid:15) (cid:48) is derived from (cid:15) for a distance metric that is usually cosine distance (Ribeiro et al., 2016).
Distances between local samples and x are then weighted by a Gaussian kernel to become sample weights (e.g. the frequency each sample appears in the sampled dataset).
1 For context-dependent explanations, the exact choice of σ depends on the stability and interaction orders of explanations.
The interaction orders may become too large and uninformative because the local vicinity area covers too much complex representation from f ( · ) .
Thus we recommend tuning σ to the task at hand.
Our framework is ﬂexible to any interaction detection method that applies to the dataset D
= { ( x (1) , f ( x (1) )) , . . .
, ( x ( n ) , f ( x ( n ) )) } .
Since we seek to detect non-additive interactions, we use the neural interaction detection (NID) framework (Tsang et al., 2018), which interprets learned neural network weights to obtain interactions.
To the best of our knowledge, this detection method is the only polynomial-time algorithm that accurately ranks any-order non-additive interactions after training one model, compared to alternative methods that must train an exponential number O (2 p ) of models.
The basic idea of NID is to interpret an MLP’s accurate representation of data to accurately identify the statistical interactions present in this data.
Because MLPs learn interactions at nonlinear activation functions, NID performs feature interaction detection by tracing high-strength (cid:96) 1 -regularized weights from features to common hidden units.
In particular, NID efﬁciently detects any-order interactions by ﬁrst assuming each ﬁrst layer hidden unit in a trained MLP captures at most one interaction, then NID greedily identiﬁes these interactions and their strengths through a 2D traversal over the MLP’s input weight matrix, W ∈ R p × h .
The result is that instead of testing for interactions by training O (2 p ) models, now only O (1) models and O ( ph ) tests are needed.
In addition to its efﬁciency, applying NID to our framework Mah´e has several advantages.
One is the universal approximation capabilities of MLPs (Hornik, 1991), allowing them to approximate arbitrary interacting functions in the potentially complex local vicinity of f ( x ) .
Another advantage is the independence of features in the sampled points of D .
Normally, interaction detection methods cannot identify high interaction strengths involving a feature that is correlated with others because interaction signals spread and weaken among correlated variables (Sorokina et al., 2008).
Without facing correlations, NID can focus more on interpreting the data-generating function, the target model f .
One disadvantage of our application of NID is the curse of dimensionality for MLPs when p is large (e.g. p > n ) (Theodoridis et al., 2008), which is oftentimes the case for images.
In general, large input dimensions should be reduced as much as possible to avoid overﬁtting.
For images, p is normally reduced in model-agnostic explanation methods by using segmented aggregations of pixels called superpixels as features (Ribeiro et al., 2016; Lundberg & Lee, 2017; Ribeiro et al., 2018).
Hierarchical Interaction Attributions :
Upon obtaining an interaction ranking from NID,
GAMs with interactions (Eq. 3) can be learned for different top- K interactions ranked by their strengths (Tsang et al., 2018).
In the Mah´e framework, there are L + 1 different levels of a hierarchical explanation which constitutes our context-dependent explanation, where L is the number of levels with interaction explanations, and K =
L at the last level.
When presenting the hierarchy such as Figure 1 Step 3, the ﬁrst level shows the additive attributions of individual features from by a trained φ ( · ) in Eqs.
1 or 2, such as the explanation from linear LIME.
Subsequently, the parameters w of φ ( · ; w , b ) are frozen before interaction models are added to construct φ K ( · ) in Eq.
The next levels of the hierarchy can be presented either as the interaction attribution of g (cid:48) K ( · ) as in Figure 1 or those of { g (cid:48) i ( · )
} Ki =1 (Eq. 3), where at each level K is increased and { g (cid:48)
i ( · ) } Ki =1 , bias b are retrained.
The practice of training interaction models g (cid:48)
i on the residual of φ is used to prevent degeneracy of univariate functions in φ in the presence of any overlapping interaction functions (Lou et al., 2013).
Since φ K is trained at each hierarchical level on D , the ﬁt of each φ K can also be explained via predictive performance, such as R 2 performance in Figure 1 Step 3.
The stopping criteria for the number of hierarchical levels can depend on the predictive performance or user preference.
4. C ONTEXT -F REE E XPLANATIONS
In order to provide context-free explanations, we propose determining whether the local interactions assumed to be context-dependent in §4.1 can generalize to explain global behavior in f .
To this end, we ﬁrst deﬁne ideal conditions for which a generic local explanation can generalize.
For choosing distance metric d and sampling points in the local vicinity of x , please refer to §4.1 and our considerations for generalizing explanations at the end of this section.
Deﬁnition 1 (Generalizing Local Explanations) .
Let f ( · ) be the model output we wish to explain, and X f be the data domain of f .
Let a local explanation of f at x ∈ X f be some explanation E that is true for f ( x ) and depends on samples x (cid:96) ∈
X f that are only in the local vicinity of x , i.e. d ( x , x (cid:96) ) ≤ (cid:15) provided a distance metric d and distance (cid:15) ≥ 0 .
The local explanation E is a global explanation if the following two conditions are met: 1) Explanation E is true for f at all data samples in X f , including samples outside the local vicinity of x , i.e. all samples x
g ∈ X f satisfying d ( x , x g ) > (cid:15) .
There exists a sample x (cid:48)
∈
X f and a local modiﬁcation to f ( x (cid:48) )
(modifying f ( x (cid:96) ) in the vicinity d ( x (cid:48) , x (cid:96) ) ≤ (cid:15) ) that changes E for all samples in X f while still meeting condition 1).
For example, consider a simple linear regression model we wish to explain, f ( x ) =
w 1 x 1 + w 2 x 2 .
Let its local explanation be the feature attributions w 1 x 1 and w 2 x 2 .
This local explanation is a global explanation because 1) for all values of x 1 and x 2 , the feature attributions are still w 1 x 1 and w 2 x 2 , and 2) if any of the weights are changed, e.g. w 1 → w (cid:48) 1 , the attribution explanation will change, but the feature attributions are still w (cid:48)
1 x 1 and w 2 x 2 for all values of x 1 and x 2 .
Our context-free explanation of interaction I is: whenever local interaction I exists, its attribution will in general have the same polarity (or sign).
Since it is impossible to empirically prove that a local explanation is true for all data instances globally (via Deﬁnition 1), this work is focused on providing evidence of context-free interactions.
This evidence can be obtained by checking whether our explanation is consistent with the two conditions from Deﬁnition 1 for the interaction of interest
I : 1) For representative data instances in the domain of f , if local interaction I exists, does it always have the same attribution polarity?
The representative data instances should be separated from each other at an average distance beyond (cid:15) .
Can local interaction
I at a single data instance ˜ x be used to negate I ’s attribution polarity for all representative data instances where I exists?
The advantage of checking the response of f to local modiﬁcation is determining if consistent explanations across data instances are more than just coincidence.
This is especially important when only a limited number of data instances are available to test on.
We propose to modify an interaction attribution of the model’s output f ( x ) at data instance x by utilizing a trained model g (cid:48) k
( x I ) of interaction
I k , where 1 ≤ k ≤ K (Eq. 3).
Let ˜ g (cid:48) k
( · ) be a modiﬁed version of g (cid:48) k
We can then deﬁne a modiﬁed form of Eq. 3:
[Figure]
[Equation]
Without retraining ˜ φ k ( · ) , we use ˜ φ k and the same local vicinity { x ( i ) } ni =1 in D to generate a new dataset ˜ D
= { ( x (1) , ˜ φ k ( x (1) ) , . . .
, ( x ( n ) , ˜ φ k ( x ( n ) )) } .
Finally, we can modify the interaction attribution of f ( x ) by ﬁne-tuning f ( · ) on dataset ˜ D .
In this paper, we modify interactions by negating them: ˜ g (cid:48)
k ( · ) = − cg (cid:48) k
( · ) , where − c negates the interaction attribution with a speciﬁed magnitude c .
How can modifying a local interaction affect interactions outside its local vicinity?
This would suggest that the manifold hypothesis is true for f ( · ) ’s representations of these interactions (Figure 2).
The manifold hypothesis states that similar data lie near a lowdimensional manifold in a high-dimensional space (Turk & Pentland, 1991;
Lee et al., 2003; Cayton,
Studies have suggested that the hypothesis applies to the data representations learned by neural networks (Rifai et al., 2011; Basri & Jacobs, 2016).
The hypothesis is frequently used to visualize how deep networks represent data clusters (Maaten & Hinton, 2008; LeCun et al., 2015), and it has been applied to representations of interactions (Reed et al., 2014), but not for neural networks.
Part of our objective is to generalize our explanation as much as possible.
In the case of languagerelated tasks, we additionally generalize based on our meaning of a local interaction and the distance metric we use, d .
In this paper, local interactions for language tasks do not have word interactions ﬁxed to speciﬁc positions; instead, these interactions are only deﬁned by the words themselves (the interaction values) and their positional order.
For example, the (“not”, “bad”) interaction would match in the sentences: “this is not bad” and “this does not seemed to be that bad”.
For comparing texts and measuring the size of local vicinities, we use edit distance (Levenshtein, 1966), which allows us to compare sentences with different word counts.
For all distance metrics used, see §5.1.
E XPERIMENTS 5. E XPERIMENTAL S ETUP
We evaluate the effectiveness of Mah´e ﬁrst on synthetic data and then on four real-world datasets.
To evaluate context-dependent explanations of Mah ´ e , we ﬁrst evaluate the accuracy of Mah ´ e at local interaction detection and modeling on the outputs of complex base models trained on synthetic ground truth interactions.
We compare Mah´e to Shap-Tree (Lundberg et al., 2018), ACDMLP (Singh et al., 2018), and ACD-LSTM (Murdoch et al., 2018;
Singh et al., 2018), which are local interaction modeling baselines for the respective models they explain: XGBoost (Chen & Guestrin, 2016), multilayer perceptrons (MLP), and long short-term memory networks (LSTM)
(Hochreiter & Schmidhuber, 1997).
Synthetic datasets have p = 10 features (Table 2).
[Table]
In all other experiments, we study Mah´e ’s explanations of state-of-the-art level models trained on real-world datasets.
The state-of-the-art models are: 1) DNA-CNN, a 2-layer 1D convolutional neural network (CNN) trained on MYC-DNA binding data 3 (Mordelet et al., 2013;
Yang et al., 2013; Alipanahi et al., 2015; Zeng et al., 2016; Wang et al., 2018), 2) Sentiment-LSTM, a 2-layer bi-directional LSTM trained on the Stanford Sentiment
Treebank (SST)
(Socher et al., 2013; Tai et al., 2015), 3)
ResNet152, an image classiﬁer pretrained on ImageNet ‘14 (Russakovsky et al., 2015;
He et al., 2016), and 4)
Transformer, a machine translation model pretrained on
WMT-14 En → Fr (Vaswani et al., 2017; Ott et al., 2018).
Avg.
p for our context-dependent evaluations, similar to our context-free tests, are shown in Table 1.
The following hyperparameters are used in our experiments.
We use n = 1 k local-vicinity samples in D for synthetic experiments and n = 5 k samples for experiments explaining models of real-world datasets, with 80% - 10% - 10% train-validation-test splits to train and evaluate Mah´e .
The distance metrics for vicinity size are: (cid:96) 2 distance for synthetic experiments, cosine distance for DNA-CNN and ResNet152, and edit distance for Sentiment-LSTM and Transformer.
We use on-off superpixel and word approaches to binary feature representation for explaining ResNet152 and SentimentLSTM respectively (Ribeiro et al., 2016; Lundberg & Lee, 2017), and the other experiments for real-world datasets use perturbation distributions that randomly perturbs features to belong to the same categories of original features, as in (Ribeiro et al.,
2018).The superpixel segmenter we use is quick-shift (Vedaldi & Soatto, 2008; Ribeiro et al., 2016).
For the hyperparameters of the neural networks in Mah´e , we use MLPs with 50 - 30 - 10 ﬁrst-tolast hidden layer sizes to perform interaction detection in the NID framework (Tsang et al., 2018).
These MLPs are trained with (cid:96) 1 regularization λ 1 = 5e − 4 .
The learning rate used is always 5e −except for Transformer experiments, whose learning rate of 5e − 4 helped with interaction detection under highly unbalanced output classes.
The MLP-based interaction models in the GAM (Eq. 3) mlp Fmlp Fmlp Fmlp F 4 tree tree tree tree lstm lstm lstm lstm   s t a nd a r d i ze
d M S E ∗
Shap-TreeACD-MLPACD-LSTM
Mah´e (
[Figure]
ﬁt (
[Figure]
lower
[Figure]
) mlp Fmlp Fmlp Fmlp F 4 tree tree tree tree lstm lstm lstm lstm 0 .0 .1 .
R - P r ec i s i o n
[Figure] [Figure]
have architectures of 30 - 10 .
They are trained with (cid:96) 2 regularization of λ 2 = 1e − 5 and learning rate of 1e − 3 .
Because learning GAMs can be slow, we make a linear approximation of the univariate functions in Eq.
3, such that g i ( x i ) =
x i .
This approximation also allows us to make direct comparisons between Mah ´ e and linear LIME, since x i is exactly the linear part (Eq. 1).
All neural networks train with early stopping, and Level L + 1 is decided where validation performance does not improve more than 10% with a patience of 2 levels.
c ranges from 3 to 4 in our experiments.
5. C ONTEXT -D EPENDENT E XPLANATIONS 5.2. S YNTHETIC E XPERIMENTS
[Table]
In order to evaluate Mah´e ’s context-dependent explanations, we ﬁrst compare them to state-of-the-methods for local interaction interpretation.
A standard way to evaluate the accuracy of interaction detection and modeling methods has been to experiment on synthetic data because ground truth interactions are generally unknown in real-world data (Hooker, 2004;
Sorokina et al., 2008; Lou et al., 2013; Tsang et al., 2018).
Similar to Hooker (2007), we evaluate interactions in a subset region of a synthetic function domain.
We generate synthetic data using functions F 1 − F 4 (Table 2) with continuous features uniformly distributed between − 1 to 1 , train complex base models (as speciﬁed in §5.1) on this data, and run different local interaction interpretation methods on 10 trials of 20 data instances at randomly sampled locations on the synthetic function domain.
Between trials, base models with different random initializations are trained to evaluate the stability of each interpretation method.
We evaluate how well each method ﬁts to interactions by ﬁrst assuming the true interacting variables are known, then computing the Mean Squared Error (MSE) between the predicted interaction attribution of each interpretation method and the ground truth at 1000 uniformly drawn locations within the local vicinity of a data instance, averaged over all randomly sampled data instances and trials (Figure 3a).
We also evaluate the interaction detection performance of each method by comparing the average R-precision (Manning et al., 2008) of their interaction rankings across the same sampled data instances (Figure 3b).
R-precision is the percentage of the top- R items in a ranking that are correct out of R , the number of correct items.
Since F 1 − F 4 only ever have 1 ground truth interaction, R is always 1 .
Compared to Shap-Tree, ACD-MLP, and ACD-LSTM, the Mah´e framework is the only one capable of detection and ﬁtting, and it is the only model-agnostic approach.
5.2. E VALUATING ON R EAL -W ORLD D ATA
In this section, we demonstrate our approaches to evaluating Mah´e ’s context-dependent explanations on real-world data.
We ﬁrst evaluate the prediction performance of Mah´e on the test set of
D as interactions are added in Eq.
3, i.e. K increases.
For a given value of σ , we run Mah´etimes on each of 40 randomly selected data instances from the test sets associated with DNA-CNN,
Sentiment-LSTM, and ResNet152.
For Transformer, performance is examined on a speciﬁc grammar ( cet ) translation, to be detailed in §5.3.
The local vicinity samples and model initializations in
Mah´e are randomized in every trial.
We select the σ that gives the worst performance for Mah´e at K
=
L in each base model, out of σ = 0 .
4 σ (cid:48) , 0 .
6 σ (cid:48) , 0 .
8 σ (cid:48) , and 1 .
σ (cid:48) , where σ (cid:48) is the average pairwise distance between data instances in respective test sets.
Results are shown in Table 3 for K starting from 0 , which is linear LIME, and increasing to the last hierarchical level L .
[Table]
[Figure]
An alternative approach to evaluating Mah´e is to determine out of LIME and Mah´e explanations, could human evaluators prefer Mah´e explanations?
We recruit a total of 60 Amazon Mechanical
Turk users to participate in comparing explanations of Sentiment-LSTM predictions.
While the presented LIME explanations are standard, we adjust Mah´e to only show the K = 1 interaction and merge its attribution with subsumed features’ attributions to make the difference between LIME and Mah´e subtle (Figure 4).
We present evaluators with explanations for randomly selected test sentences under the main condition that these sentences must have at least one detected interaction, which is the case for > 95% of sentences.
In total, there are explanations for 40 sentences, each of which is examined by 5 evaluators, and a majority vote of their preference is taken.
Each evaluator is only allowed to pick between explanations for a maximum of 4 sentences.
Please see Appendix B for additional conditions used to select sentences to show evaluators and more examples like Figure 4.
The result of this experiment is that the majority of preferred explanations ( 65% , p = 0 . 029 ) is with interactions, supporting their inclusion in hierarchical explanations.
5.2. H IERARCHICAL E XPLANATIONS
Examples of context-dependent hierarchical explanations for ResNet152, Sentiment-LSTM, and
Transformer are shown in Figure 6, Table 6, and Appendix F respectively after page 9.
For the image explanations in Figure 6, superpixels belonging to the same entity often interact to support its prediction.
One interesting exception is (d) because water is not detected as an important interaction with buffalo in the prediction of water buffalo.
This could be due to various reasons.
For example, water may not be a discriminatory feature because there are a mix of training images of water buffalo in ImageNet with and without water.
The same is true for related classes like bison.
Explanations may also appear unintuitive when a model misbehaves.
Therefore, quantitative validations, such as the predictive performance of adding interactions in each hierarchical level (e.g. R 2 scores in
Figure 6), can be critical for trusting explanations.
5. C ONTEXT -F REE E XPLANATIONS
In this section, we show examples of context-free explanations of interactions found by Mah´e .
We ﬁrst study the context-free interactions learned by Sentiment-LSTM.
To have enough sentences for this evaluation, we use data from IMDB movie reviews (Maas et al., 2011) in addition to the test set of SST.
Based on our results (Figure 5), we observe that the polarities of certain local interactions are almost always the same, where the words of matching interactions can be separated by any number of words in-between.
To ensure that this global behavior is not a coincidence, we modify local interaction behavior in Sentiment-LSTM to check for a global change in this behavior (§4.2).
As a result, when the model’s local interaction attribution at a single data instance is negated, the attribution is almost always the opposite sign for the rest of the sentences.
[Table]
[Table] [Table]
[Figure] [Figure]
[Figure]
(+)
[Figure] [Figure]
[Figure]
(+)
[Figure] [Figure]
[Figure] [Figure]
[Figure] [Figure]
[Figure] [Figure]
[Figure] [Figure]
[Figure] [Figure]
[Figure] [Figure]
[Figure] [Figure]
[Figure] [Figure]
A notable insight about Sentiment-LSTM is that it appears to represent (too, bad) and (only, worse) as globally positive sentiments, and Mah ´ e ’s modiﬁcation in large part rectiﬁes this misbehavior (Figure 5).
The modiﬁcations to SentimentLSTM only cause an average reduction of 1 . 5% test accuracy, indicating that the original learned representation stays largely intact.
Results for σ = 16 are shown with the average pairwise edit distance between sentences being σ (cid:48)
= 24 . 8 .
Words in detected interactions are separated by 1 .
3 words on average.
Next, we study the possibility of identifying context-free interactions in Transformer on a known form of interaction in English-to-French translations: translations into a special
French word for “this” or “that”, cet , which only appears when the noun it modiﬁes begins with a vowel.
Some examples of cet interactions are (this, event), (this, article), and (this, incident), whose nouns have the same starting vowels in French.
For our explanation task, the presence of cet is used as the prediction variable in local interaction extraction.
To minimize the sources of cet , we limit original sentence lengths towords, and we perform translations on WikiText-103 (Merity et al., 2016) to evaluate on enough sentences.
The results of context-free experiments on cet interactions of adjacent English words are shown in Table 4.
The interactions always have positive polarities towards cet , and after modifying Transformer at a single data instance for a given interaction, its polarity almost always become negative, just like the context-free interactions in Sentiment-LSTM.
Examples of new translations from the modiﬁed Transformer are shown in the “after” rows in Table 5, where cet now disappears from the translations.
The test BLEU score of Transformer only decreases by an average percent difference of − 2 .
7% from modiﬁcation, which is done through differentiating the max value of cet output neurons over all translated words.
Results for σ = 6 , σ (cid:48)
= 10 .
5 are shown.
Experiments on DNA-CNN and ResNet152 show similar results at ﬁxed interaction positions (§4.2).
For DNA-CNN, out of the 94 times a 6-way interaction of the CACGTG motif (Sharon et al., 2008) was detected in the test set, every time yielded a positive attribution polarity towards DNA-protein afﬁnity, and the same was true after modifying the model in the opposite polarity (cosine distance σ = 0 .
35 , σ (cid:48)
= 0 . 408 ).
For ResNet152, context-free interactions are also found (cosine distance σ = 0 .
4 , σ (cid:48)
= 0 . 663 ).
However, because superpixels are used, the interactions found may contain artifacts caused by superpixel segmenters, yielding less intuitive interactions (see Appendix A).
5. L IMITATIONS
Although Mah´e obtains accurate local interactions on synthetic data using NID, there is no guarantee that NID ﬁnds correct interactions.
Mah´e faces common issues of model-agnostic perturbation methods in interpreting high-dimensional feature spaces, choice of perturbation distribution, and speed (Ribeiro et al., 2016; 2018).
Finally, an exhaustive search is used for context-free explanations.
C ONCLUSION
In this work, we proposed Mah´e , a model-agnostic framework of providing context-dependent and context-free explanations of local interactions.
Mah´e has demonstrated the capability of outperforming existing approaches to local interaction interpretation and has shown that local interactions can be context-free.
In future work, we wish to make the process of ﬁnding context-free interactions more efﬁcient, and study to what extent model behavior can be changed by editing its interactions or univariate effects.
Finally, we would like to study the interpretations provided by Mah´e more closely to ﬁnd new insights into structured data.
[Figure]
prediction: stretcher
[Figure]
) prediction: window screen
[Figure] [Figure]
) prediction:
Pomeranian
[Figure]
prediction: water buffalo
[Figure]
level 4)
[Table]
, lightest, enjoyable 0.
S UPPLEMENTARY M ATERIALS
A
C ONTEXT -F REE EXPLANATIONS IN R ES N ET
[Figure]
B F URTHER DETAILS OF M ECHANICAL T URK EXPERIMENT
Several other conditions were used to choose which sentences to show Mechanical Turk evaluators besides requiring a detected interaction.
We ensure that there is a signiﬁcant attribution difference between LIME and Mah´e by only choosing among sentences that have a polarity difference between
Mah´e ’s interaction and LIME’s corresponding linear attributions.
To reduce ambiguities of uninterpretable explanations arising from a misbehaving model - an issue also faced by Sundararajan et al.
(2017) in interpretation evaluation - we only show explanations of sentences that the model classiﬁed correctly.
We also attempt to limit the effort that evaluators need to analyze explanations by only showing sentences with 5 - 12 words with uniform representation of each sentence length.
An example of the interface that evaluators select from is shown in Figure 8.
Randomly selected examples of comparisons that evaluators make are shown in Figure 9.
The visualization tool for presenting additive attribution explanations is graciously provided by the ofﬁcial code repository of
LIME 4 .
/lime
[Figure]
C R UNTIME
Figures 10 and 11 show runtimes of context-dependent and -free explanations using Mah´e .
All experiments were conducted on Intel Xeon 2 .
6 GHz CPUs and Nvidia 1080 Ti GPUs.
Experiments with MLPs were run on CPUs and inference/retraining of DNA-CNN, Sentiment-LSTM,
ResNet152, and Transformer were run on GPUs.
[Figure] [Figure]
D C OMPARISONS TO B ASELINES FOR C ONTEXT -F REE E XPLANATIONS
[Figure]
C o n s i s t e n c y o f
A tt r i b u t i o n P o l a r i t y
[Figure]
[Figure]
C o n s i s t e n c y o f
A tt r i b u t i o n P o l a r i t y
[Figure]
E E XPERIMENTS WITH LARGE NUMBER OF FEATURES
We performed experiments on the accuracy and runtime of the MLP used for interaction detection (via NID) on datasets with large number of features.
We generate synthetic data of n samples and p features { (cid:0) X
( i ) , y ( i ) (cid:1) } with randomly generated pairwise interactions of using the following equation (Purushotham et al., 2014):
[Equation]
where X ( i ) ∈ R p is the i th instance of the design matrix
X ∈ R p × n , y ( i
) ∈
R is the i th instance of the response variable y ∈ R n × 1 , W ∈ R p ×
p contains the weights of pairwise interactions, β ∈ R p contains the weights of main effects, and i = 1 , . . . , n .
W was generated as a sum of K rank one matrices, W = (cid:80) Kk
=1 a k a (cid:62) k .
X is normally distributed with mean 0 and variance 1 .
Both a k and β are sparse vectors of 2 − 3% nonzero density and are normally distributed with mean 0 and variance 1 .
K
= 5 .
We found that in low p settings, i.e. p = 100 , n only needed to be at least 10 p to recover 5pairwise interactions at AUC > 0 .
Increasing p to 1000 still required n > 10 p , but performance stability signiﬁcantly improved between 10 p and 100 p for detecting 900 - 2000 interactions.
When p = 10 k, we could not detect interactions at n = 10 p and did not study further due to large training time.
In general, increasing n by an order of magnitude at ﬁxed p required 4-9x more runtime.
As a rough estimate, increasing p by an order of magnitude at ﬁxed n required 2 - 3 x more runtime.
There is high variance in the runtime associated with increasing p because of the early stopping used.
F H IERARCHICAL EXPLANATIONS OF cet INTERACTIONS IN T RANSFORMER
[Table]
G M ORE EXAMPLES OF INTERACTIONS WITH CONSISTENT POLARITIES IN S ENTIMENT -LSTM
[Table]