Abstract
This paper reviews and advocates against the use of permuteandpredict (PaP) methods for interpreting black box functions. Methods such as the variable importance measures proposed for random forests, partial dependence plots, and individual conditional expectation plots remain popular because they are both modelagnostic and depend only on the pretrained model output, making them computationally efficient and widely available in software. However, numerous studies have found that these tools can produce diagnostics that are highly misleading, particularly when there is strong dependence among features. The purpose of our work here is to (i) review this growing body of literature, (ii) provide further demonstrations of these drawbacks along with a detailed explanation as to why they occur, and (iii) advocate for alternative measures that involve additional modeling. In particular, we describe how breaking dependencies between features in holdout data places undue emphasis on sparse regions of the feature space by forcing the original model to extrapolate to regions where there is little to no data. We explore these effects across various model setups and find support for previous claims in the literature that PaP metrics can vastly overemphasize correlated features in both variable importance measures and partial dependence plots. As an alternative, we discuss and recommend more direct approaches that involve measuring the change in model performance after muting the effects of the features under investigation.
Introduction
Machine learning methods have proved to be enormously successful tools for making predictions from data. However, most of these methods produce algebraically complex models that provide little or no insight into how they arrive at their predictions. As a consequence, many researchers have suggested methods to “Xray the black box” in order to provide insight into which input features are important and how they effect predictions; a task so precarious that others have advocated against the practice altogether (Rudin 2019).
This paper reviews methods based on permuting feature values or otherwise investigating the effect that changing the values of a feature has on predictions. Our message can be simply summarized by
When features in the training set exhibit statistical dependence, permuteandpredict methods can be highly misleading when applied to the original model.
Permutation methods are some of the oldest, most popular, and computationally convenient means of understanding complex learning algorithms. In this paper, we will focus primarily on three commonly used techniques:

Variable Importance These methods are designed to provide a score for each feature based on how much difference replacing the feature with noise makes in predictive accuracy. In particular, Breiman (2001) introduced the idea of measuring the importance of the jth feature by permuting its values in the training data and examining the corresponding drop in predictive accuracy when these new data are used in a model built with the original training data.
Given a training set consisting of a matrix of feature values X with rows \(\varvec{x}_i\) giving each observation and corresponding response vector \(\varvec{y}\), let \(X^{\pi ,j}\) be a matrix achieved by randomly permuting the jth column of X. Using \(L(y_i,f(\varvec{x}_i))\) as the loss for predicting \(y_i\) from \(f(\varvec{x}_i)\), the importance of the jth feature can be defined as:
$$\begin{aligned} \text{ VI}_j^{\pi } = \sum _{i=1}^N L(y_i, f(\varvec{x}^{\pi ,j}_i))  L(y_i,f(\varvec{x}_i)) \end{aligned}$$so as to measure the increase in loss due to replacing \(x_{ij}\) with a value randomly chosen from the (marginal) distribution of feature j.
Breiman (2001) designed the method specifically for use with random forests and considered outofbag (OOB) loss in which variable importance is averaged over trees, measured with that part of the data not used to construct the corresponding tree. For more general learners, either training or test loss can be used. Since being introduced, numerous variations on this idea have appeared. As one recent notable example, Fisher et al. (2019) considered averaging over all possible permutations and derived concentration bounds based on Ustatistics. Nonetheless, each of these methods utilizes the same general permuteandpredict (PaP) structure (Fisher et al. 2019, also provide a version based on conditional permutations); our simulations employ both the \(\text{ VI}_j^{\pi }\) and OOB importances when examining random forests.

Partial Dependence Plots (PDPs) Friedman (2001) suggested examining the effect of feature j by plotting the average prediction as the feature is changed. Specifically, letting \(X^{x,j}\) be the matrix of feature values where the jth entry of every row has been replaced with value x, we define the partial dependence function
$$\begin{aligned} \text{ PD}_j (x) = \frac{1}{N} \sum _{i=1}^N f(\varvec{x}^{x,j}_i) \end{aligned}$$as the average prediction made with the jth feature replaced with the value x. Since these are univariate functions (multivariate versions can be defined naturally), they can be readily displayed and interpreted.

Individual Conditional Expectation (ICE) PlotsGoldstein et al. (2015) suggested a refined version of partial dependence plots that involves simply plotting out the functions
$$\begin{aligned} \text{ ICE}_{i,j} (x) = f(\varvec{x}^{x,j}_i) \end{aligned}$$that correspond to tracing out the prediction given to any one example as the jth feature is changed. PDPs are then exactly the average of the corresponding ICE plots, but the latter allows an investigation in how the effect of feature j may change for different combinations of the remaining inputs. When N is very large, a random selection of ICE plots can be presented as examples. Goldstein et al. (2015) also described how these ICE plots can potentially be used to detect the kind of extrapolation we discuss in detail in this paper.
These techniques are attractive for a number of reasons: they are each computationally cheap, requiring O(N) operations, apply to the \(f(\varvec{x})\) derived from any learning method, and have no tuning parameters. These computational benefits make them easily programmable and as a result, they are widely available across a multitude of software implementations. From a statistical standpoint, they rely only on averages and are thus generally very stable. Moreover, at a high level, the approach has an intuitive feel that can give practitioners a (perhaps unwarranted) sense of confidence. For these reasons, they have been frequently adopted across a wide variety of scientific domains and still appear to remain the goto tool of choice for most applied scientists utilizing blackbox models.
However, procedures like these based on the PaP structure have been shown to exhibit serious flaws, especially when significant correlations exist between features. Strobl et al. (2007) investigate classification and note that the importance measures based on permuted OOB error in CART built trees are biased toward features that are correlated with other features and/or have many categories and further suggest that bootstrapping exaggerates these effects. Archer and Kimes (2008) explore a similar setup and also note improved performance when (true) signal features—those actually related to the response—are uncorrelated with noise features. Nicodemus et al. (2010) investigates these claims of feature preference in a largescale simulation study and again find that the OOB measures overestimate the importance of correlated predictors.
In explaining the observed behavior of variable importance measures, we need to distinguish two effects:

The use of a permutationbased measure of importance to summarize a known and fixed function when features are correlated. Permutation measures ignore the correlation between \(x_1\) and \(x_2\), treating each as being manipulatable separately from the other in ways that may not be realistic.
Given a fixed f(x) then with increasing sample size we can define the target of \(\text{ VI}_j^{\pi }\) as:
$$\begin{aligned} \text{ VI}_j^{\pi }(f) = E_{y,\varvec{x}}\left[ L(y,f_{j}(\varvec{x}_{j}))  L(y,f(\varvec{x})) \right] \end{aligned}$$where
$$\begin{aligned} f_{j}(\varvec{x}_{j}) = \int f(\varvec{x}) p_j(x_j) \mathrm{d}x_j \end{aligned}$$and \(p_j(x_j)\) is the marginal distribution of \(x_j\). Similarly, partial dependence has a general target of
$$\begin{aligned} f_{j}(x_j) = \int f(\varvec{x}) p_{j}(\varvec{x}_{j}) \mathrm{d}\varvec{x}_{j}. \end{aligned}$$ 
The effect of applying permutation methods to estimated functions. Here, if we treat permutation importance applied to the underlying relationship as the quantity to be estimated, and our application of permutation importance to an estimated random forest as an estimate, we can observe considerable bias due to measuring the random forest at extrapolation.
The first of these is inescapable, and the appropriateness of any particular importance summary will depend on the application at hand; arguments such as those in Strobl et al. (2007) can be seen as focused on this question. In contrast, we believe the second of these is at least as important and follow Hooker (2007) in assigning the effect to extrapolation. For example, suppose features \(x_1\) and \(x_2\) are strongly positively dependent, there will be no training examples which pair a large value of \(x_1\) with a small value of \(x_2\) or vice versa. Thus, the predictions made in the upperleft corner of \((x_1,x_2)\) space will mostly depend on the extrapolation behavior of the particular learning method employed. And as we demonstrate in the following sections, permutationbased methods place significant weight on exactly these predictions. As a concrete example: an evaluation of the importance of pregnancy status in a model that also includes gender would result in the evaluation of the response of pregnant men as often as pregnant women.
Our thesis here is illustrated by considering a linear model:
where, if each covariate \(x_j\) has variance 1, its permutation importance is given by \(\beta _j^2\), regardless of the correlation among the features. While this is by no means the only way to define importance for a linear model, it does correspond to the familiar incantation of “the change in y for one unit change in \(x_j\), keeping all else fixed” and could be construed as justifying permuteandpredict measures. In this model, we can also regard \(\beta _j^2\) (or its rank among coefficients) as the target of estimation when we initially obtain a random forest or a neural network from data generated from this model and then apply permutation importance to it. In our experiments, we observe that this estimate is biased upwards for covariates that are correlated with each other, and that this bias increases with correlation. The alternative measures for which we advocate imply a different notion of variable importance in linear models, but they do not extrapolate and do not suffer from the same discrepancy between importance applied to a known underlying model, and importance applied to a machine learning estimate of it.
For these reasons, we argue that these methods can be misleading. Consider a situation in which \(x_1\) and \(x_2\) are strongly correlated and a backwards elimination strategy is being used as a covariate selection procedure (e.g., DíazUriarte and De Andres 2006 built a sequence of random forests removing the least important features at each step). Our examples provide a situation in which \(x_1\) and \(x_2\) would both be retained ahead of features that are ranked as more important than them in terms of the underlying linear model. Such a procedure may then result in a collection of strongly correlated features, each of which is individually only weakly predictive (in combination with the other retained features), while more strongly predictive features are discarded.
Our argument implicitly connects variable importance to notions of statistical inference; variable importances are an estimate for the quantity that would have been obtained by making the same calculation with unknown true response function. We are, as such, interested in the statistical properties of a machine learning method, as opposed to conducting a “model audit” in which an estimated model is considered fixed and we merely wish to summarize its behavior. This is similar to the distinction in Fisher et al. (2019) between model reliance and model class reliance which provides generalized notion confidence interval for variable importance. That said, we restrict our attention here to bias due to extrapolation; measures of variability will also depend on the machine learning method being used. Confidence intervals can be calculated in the case of ensemble methods such as random forests by relating them to Ustatistics (e.g., Ishwaran and Lu 2019). The notion of model class reliance in Fisher et al. (2019) provides a highly adaptable analogue of profile confidence intervals for methods based on optimization. These can be employed with any notion of variable importance including either the permuteandpredict methods we critique here, or using conditional permutations. While we do not investigate these measures, here our results would advocate for using the latter.
Our goals in this paper are to (i) review the growing body of literature on this topic, (ii) provide an extended, more detailed examination of the effect of these diagnostic tools along with an explanation for this behavior when applied to random forests, and (iii) advocate for recently developed importance measures that avoid extrapolation, either by generating perturbed data differently, or relearning models. In addition to random forests, we also examine the behavior of neural networks where different, but similarly problematic, behavior is observed.
While permuteandpredict measures produced biased estimates, there are alternatives that do not involve measuring the behavior of models far from their training data, and we explore two strategies to do this. The first of these is to generate perturbed versions of the feature of interest conditionally on the vector of the remaining features, (as opposed to independently of them), thus avoiding distorting the feature distribution; the approaches of Strobl et al. (2007) fall within this class. A more general approach is relearning, which generally involves measuring the drop in model performance when the effects of the features in question are muted. The particular way in which the muting and testing occurs varies slightly between procedures appearing in the recent literature—Mentch and Hooker (2016, 2017) suggest permuting said features and rebuilding the model, the leaveoutcovariates (LOCO) approach in Lei et al. (2018) simply drops them, and the conditional randomization test in Candes et al. (2018) substitutes those features in question with randomized replacements (knockoffs) sampled conditional on the remaining features. In each case, however, rather than extrapolate the original model, a new model is relearned using the data \((\varvec{y},X^{\pi }_j)\) and the change in performance is tested for statistical significance. In fact, all these strategies result in the same population target value if we use squared error loss, and our simulations suggest they do not exhibit the same biases as permuteandpredict. Note that either generating conditional random variables or relearning requires the use of an additional model and therefore computational or modeling effort, hence our subtitle.
We stress that these relearning procedures, while a substantial improvement, are themselves not entirely immune from producing surprising and potentially misleading results even when permutations are used to construct a new model. Very recent work has demonstrated that even though it seems quite unintuitive to think that a permuted feature could substantially improve predictive performance, such an outcome is possible in low signal settings (Mentch and Zhou 2020). In light of this, we therefore see a conditionandrelearn approach—in which we both replace the feature values under investigation with samples generated conditional on the remaining features and construct a new model—as essentially the gold standard for evaluating feature importance. Put simply, we argue that procedures that involve conditioning on the remaining features (rather than simply permuting) or rebuilding the model are both substantial improvements over more classical “permuteandpredict” approaches, but ideally procedures should do both.
This paper focuses specifically on permutation methods and variants of it that can be applied to either the learned model, or the learning algorithm that generated it, in the spirit of staying within the algorithm class (Fisher et al. 2019). However, these are not the only ways to try to understand the output of machine learning. Our explanations of the poor behavior of permuteandpredict methods are traced to Hooker (2007) where Breiman’s variable importance methods were examined in the context of a functional ANOVA decomposition
with the individual effects \(f_{u}\), for a collection of covariate indices u defined by averaging over the remaining features. Here, permutateandpredict variable importance can be equated to Sobol indices (Sobol 1993) when all the features are independent (see Roosen 1995, for an early exploration of these tools for interpreting machine learning functions). Hooker (2007) proposed a generalization of this expansion to any distribution over the features, with the purpose of avoiding extrapolation. Similar results to the generalized functional ANOVA can be obtained by approximating a black box function in terms of additive models, described as model distillation in Tan et al. (2018b). However, implementing these ideas is not as straightforward as the methods we discuss here.
Shapley values (Lundberg and Lee 2017) have also become popular tools for assigning “credit” to covariates for any quantity, including predictive performance, or individual predictions. Some implementations of Shapley values exhibit the same permutation structure that we critique here and can be similarly misleading (Slack et al. 2020). Their implementation is also more complex than the methods we examine in this paper. Finally, we focus on procedures that are applicable to any machine learning method. Specific methods have their own diagnostics such as the splitimprovement methods suggested in Friedman (2001) that apply specifically to trees. We note that these methods can also be biased toward features with more potential split points (Strobl et al. 2007), along with potential corrections in Zhou and Hooker (2019), Loecher (2020), Li et al. (2019).
In the following, we introduce a simple, and understandable model in Sect. 2 used to illustrate the misleadingness of variable importance measures and diagnostic plots in Sect. 3. We provide an explanation of these results in terms of extrapolation behavior in Sect. 4 and suggest remedies in Sects. 5 and 6.
A simple simulated example
Here we set up a simple model that will allow us to be clear about the values that we ought to obtain from variable importance measures and which we can then contrast to those we actually find. Specifically, we propose a linear regression model based on 10 features \((x_1,\ldots ,x_{10})\):
where \(\epsilon _i \sim N(0,0.1^2)\) produces process noise. The variable importance methods we investigate here are not restricted to regression problems. However, in this setting we are able to relate all these diagnostic tools to the coefficients of the regression, providing a point of comparison. Our choice of noise variance is also deliberately small in order to make the behavior we observe clearer.
In addition to specifying the relationship between features and output, we need to provide a distribution for the \(x_{ij}\). It is this that makes permuteandpredict methods misleading. In our model, each of the features is marginally distributed as uniform on [0, 1]. They are generated independently with the exception of the first two \((x_1,x_2)\) which we make correlated via a Gaussian copula (Nelsen 2007) with correlation parameter \(\rho \). The strength of this correlation will play a large role in how strongly variable importance and other measures can mislead.
For a linear model such as (2) with covariates that have the same scale, variable importance can be obtained from the magnitude of covariates; see Gregorutti et al. (2015) and Theorem 1 for a formal connection to the variable importance measures in Breiman (2001). Here we will be interested in the relative importance of \(x_1\) and \(x_2\) to the other features, and we have chosen coefficients so that \((x_3,x_4,x_5)\) provide a reference for features with the same coefficient, \(x_6\) has no influence and \(x_1\) and \(x_2\) have a clear importance ordering within \((x_7,\ldots ,x_{10})\).
This example serves to isolate the reasons that the permuteandpredict methods can be misleading. We contend that permutationbased diagnostic tools are only misleading when one both employs flexible learning methods and has correlated features. Neither, by themselves, are sufficient to induce large bias, although we note that the combination is in fact very common in practice. This necessity is illustrated in the following theorem that investigates the diagnostics returned by an estimated linear model.
Theorem 1
For \(f(x) = \hat{\beta }_0 + \sum _{j=1}^p \hat{\beta }_j x_j\) fit by leastsquares

1.
\(E_{\pi } \text{ VI}_j^{\pi } = 2 \hat{\beta }_j^2 \sum _{i=1}^N \left( x_{ij}  \bar{x}_j\right) ^2\) where \(E_{\pi }\) indicates the expectation over permutations and \(\bar{x}_j\) is the average value of the jth feature.

2.
\(\text{ PD}_j(x) = C_j + \hat{\beta }_j x\) where \(C_j = \sum _{j' \ne j} \beta _{j'} \bar{x}_{j'}\)

3.
\(ICE_{i,j}(x) = C_{i,j} + \hat{\beta }_j x\) where \(C_{i,j} = \sum _{j' \ne j} \beta _{j'} x_{ij'}\)
The first of these results is given in Gregorutti et al. (2015) and Fisher et al. (2019); the latter two results follow in a direct fashion. A proofs is provided in “Appendix”.
Theorem 1 is given in terms of an estimated linear model, but the analogous population result applies if these variable importance measures are applied to data generated from a linear model. Theorem 1 indicates that for linear models, permutation importance methods return the squared coefficient of the corresponding covariate, multiplied by the covariate’s marginal sum of squares. When the covariates are standardized, this results in associating variable importance with the magnitude of the corresponding coefficient, approximately corresponding to common interpretations in linear models. We find that permutation importances do, in fact, recover importance ordering reliably when linear models are used as estimates in our simulation. That breaks down, however, when random forests or neural networks are used to estimate the underlying function, where we see considerable bias in the ordering of importances relative to that given by the underlying (true) generating function.
In the simulations described below, for each choice of correlation parameter \(\rho \) and sample size N, we learn both a random forest and a single layer neural network with 20 hidden nodes (randomForest and nnet, respectively, in R). We then evaluated the variable importance \(\text{ VI}^{\pi }\) as given above using the training data. For random forests we also obtained the original outofbag importance measures \(VI^o_j\) implemented in importance; these differ from \(VI^{\pi }_j\) in being evaluated from outofbag residuals for each tree and are thus specific to bagging methods.
Additionally, we recorded the partial dependence of f on \(x_1\) and \(x_2\) for each model as well as the ICE for 11 observations with the ith observation taken at \(x_{i1} = x_{i2} = (i1)/10\) and the remaining \(x_{i3},\ldots ,x_{i10}\) generated uniformly but kept constant across all simulations. These values were chosen so that the reference points were always in the bulk of the feature distribution. We simulated each data set with associated learned function f, feature importances and plots, 50 times and report the average over these simulations in order to reduce variability in the results.
Simulation results
In order to ensure that scaling does not affect our results, we report the importance rank of each feature: for each simulation we order the importance of the features from least to greatest and record the position of the feature in this list. That is, features deemed most important are given the highest rank. This is commonly employed in screening methods where only the most important features are retained.
Figure 1 shows the average importance rank of each of the 10 features obtained on the training set using the measures implemented in the randomForest package. We use 2,000 observations in each of 50 simulations and give results where \(x_1\) and \(x_2\) are related with a Gaussian copula with either correlation \(\rho = 0\) or 0.9. Note that in the independent case (\(\rho =0\)), random forests, neural networks and linear models all agree on the ordering of the covariates, including ties between \(x_1\)–\(x_5\), which also corresponds to the results in Theorem 1.
However, when \(\rho =0.9\), permutationbased methods applied to random forests and neural networks rank \(x_1\) and \(x_2\) as more important than \((x_3,x_4,x_5)\) and frequently more important than even \(x_9\), which has a larger coefficient. However, in line with Theorem 1, linear models retained the same importance rank between the two correlation structures, an ordering which agrees with the known coefficients of the response function.
In Sect. 4, we explain this observation by noting that in permuting only 1 correlated feature, we break its relationship with the remaining correlated features resulting in evaluations of the function in regions which, by construction, have no data nearby; see Fig. 4. This may be viewed as being due to the very high correlation parameter employed, and the specific sample size. In Fig. 2, we examine the joint effect of sample size and correlation on the average rank given to \(x_1\) and \(x_2\). This time, we modify (2) so that each of \(x_1\) and \(x_2\) have coefficient 0.8, making them less relevant than \((x_3,x_4,x_5)\), and plot their average importance rank over \(\rho \in \{0,0.1,0.25,0.35,0.5,0.75,0.9\}\) and for each data set size \(N \in (100,200,500,1000,2000,5000)\). These are averaged over 20 simulations to improve stability.
Here, we observe that for small N, nonzero correlation makes \(x_1\) and \(x_2\) appear to be more important than \((x_3,x_4,x_5)\), particularly for the outofbag importance measures, but that for small \(\rho \) this effect is removed at larger N. For large \(\rho \), the importance rank decreases with N, though never below 5, the value indicated by Theorem 1.
Figure 3 gives the average partial dependence and ICE plots for \(x_1\) for each of the models comparing those trained on independent feature distributions to those with \(\rho =0.9\). For random forests, we observe what appears to be less attenuation of the relationship due to edge effects when \(x_1\) and \(x_2\) are correlated, but note that these will still be compared to partial dependence functions for features where the edge effects are attenuated. Neural network partial dependence exhibits greater variability when the features are correlated. This is particularly evident in the ICE plots for neural networks where plots in the high correlation case diverge considerably from the underlying relationship. Recall that each of these lines is an average of 50 replications, making the ICE for any individual curve highly variable. The problematic behavior of these plots is more apparent in Fig. 6 where a lowerdimensional setting reduces both bias and variance.
Extrapolation and explanations
The patterns observed in the results above have also been observed in, for example Toloşi and Lengauer (2011), although the periodic reappearance of these observations does not appear to have reduced the use of these types of diagnostics. Furthermore, to this point, there has been relatively little explanation offered as to why this sort behavior occurs.
As noted in Theorem 1, for linear models with standardized features, permutationbased importances report the square of the feature coefficients. Moreover, where the features are not correlated, random forest permutation importances essentially provide the same ranking as permutation importances applied to linear models. The overemphasis of correlated features is caused by random forests’ (and neural networks’) need to extrapolate in order to generate predictions at those permuted locations.
To illustrate this point, consider the model \(y = x_1 + \epsilon \) so that \(x_2\) does not influence the response. We generate \(\epsilon \sim N(0,0.05)\) yielding a very high signaltonoise ratio of 100/3 and learn a random forest based on 200 points with \((x_1,x_2)\) uniformly distributed but associated through a Gaussian copula with correlation 0.9. This was repeated 100 times to stabilize the resulting estimates, and to allow us to investigate the betweensimulation variability of our answers.
The left panel of Fig. 4 plots the generated \((x_1,x_2)\) points, the points used to assess permutation importance for \(x_2\) and the contours of the learned random forest. Here we observe two things:

1.
Although the true contours are given by vertical lines, the random forest only approximates these contours within the convex hull of the data. Outside this, the contours become more diagonal.

2.
While the data distribution is concentrated along the diagonal, the points used to evaluate permutation importance fill out the unit square.
Thus, much of the evaluation of permutation importance is based on values of \(\varvec{x}\) that are far from the training data, where random forests are (unsurprisingly) poor at mimicking the underlying data generating function.
The middle plot of Fig. 4 overlays a shaded contour with the splits obtained from 10 example trees selected at random from our forests. Here we observe that at the top left and bottom right corners, individual tree predictions are obtained either by splits that proceed horizontally from or vertically from the data distribution at the adjacent corners. Thus, as discussed, each tree will predict a local average from one of the two corners.
The righthand plot of Fig. 4 makes this reasoning more explicit, in which the permuted value \(x_{i1}^{\pi }\) moves the query from the original data in the bottom left, to \(\varvec{x}^{\pi }\) in the bottom right of the plot where there are very few observations. In treebased methods, predictions from each tree at x take the form:
where L(x) denotes the set of observations falling in the same leaf as x. The collection of response values \(y_i\) for which the corresponding weight \(w_i\) can be nonzero is a subset of all training observations and such observations are referred to as the potential nearest neighbors (pNN) of x.
For correlated features, the potential nearest neighbors of \(\varvec{x}^{\pi }\) include those whose values are far from the original \(\varvec{x}\) in both coordinates; indeed this happens with substantial frequency among the trees in our forest. In these trees, the permuted prediction \(\hat{f}(x^{\pi })\) is likely to be far from the original prediction \(\hat{f}(x)\), causing a large perceived importance of the feature \(x_1\) even when it is irrelevant. By contrast, when the observations are more uniformly distributed over the feature space, the pNN’s of \(\varvec{x}^{\pi }\) will be localized around it, and will have very similar values of \(x_2\) to the original point \(\varvec{x}\) making \(f(\varvec{x}^{\pi })\) a reasonable comparison to \(f(\varvec{x})\).
In fact, almost any of the data points in the rightmost plot of Fig. 4 are pNNs of \(\varvec{x}^{\pi }\). This can be seen by examining the set of rectangles that reach both the data distribution and the bottomright corner of the plot. Moving along one edge or other, however, the geometry of forming a rectangle that encompasses both a small number of data points and the prediction restricts potential nearest neighbors to be those with larger values of both \(x_1\) and \(x_2\) (or smaller values for points above the diagonal).
In Fig. 4, this argument explains the shift in contours away from the observed data and an increase in the importance measure for \(x_2\). However, it is not sufficient to explain the joint increase in importance for both \(x_1\) and \(x_2\) when they have symmetric effects in the simulations in Sect. 2. To explain this effect, we also observe that the concentration of observations along the diagonal increases the overall signal jointly attributed to them, increasing the number of splits given to at least one of these two covariates.
In contrast to random forests, our characterization of neural network extrapolation is simply in terms of increased variability. When fitting highdimensional polynomials, the phenomenon of observing large oscillations outside the range of the data is termed Gibbs effects and we suspect that a similar phenomenon occurs here. Figure 5 presents a contour plot of the average of 100 20hiddennode neural networks trained on the same data as above along with the standard deviation between these models. Here, the lack of reliability in permutation importance and in partial dependence plots can be explained by the large increase in variance as we move away from the data distribution, allowing fluctuations in predictions to increase apparent variable importance.
Figure 6 plots the average PD and ICE functions for each of random forests and neural networks in the same manner as Fig. 3. Here, the effect of extrapolation is made even more evident. ICE plots reflect the underlying relationship reasonably well in regions that are supported by the data, but can be very different outside of that. In the case of neural networks, these exhibit greater variability; in random forests, extrapolationinduced inflation of importance measures is a larger source of concern, suggesting more significance for \(x_2\) than we would expect.
Variable importance alternatives
As has been noted, these effects of correlation on variable importance have been observed in various forms by several authors in recent years. Fortunately, there have also been several alternatives proposed, generally in line with one of two ideas:

1.
Permuting (or otherwise generating) new values of feature j based on its distribution conditional on the remaining features. This general idea seems to have first been suggested in Strobl et al. (2008) but similar schemes have since appeared in numerous other works including Tuv et al. (2009), where the authors utilize tree ensembles to generate predictively nonredundant feature sets, and Wu et al. (2007) where the original dataset is augmented with pseudovariables in order to help tune the size and complexity of linear models. More recently, Barber et al. (2015) and Candes et al. (2018) developed the “knockoff” framework whereby original features are either swapped out for randomized replacements to test their importance via conditional randomization tests or the feature space is augmented with null copies of the original features after which a knockoff filter is applied to eliminate nonimportant features.
Fisher et al. (2019) similarly examines model class reliance using conditional permutations. The notion of model class reliance examines how widely an importance measure can vary while maintaining closetooptimal predictive accuracy. Although we do not examine these methods here, the results we present suggest that this conditional version should be preferred.

2.
Removing feature j from the data and examining the drop in accuracy when a new model is learned without it. This leaveonecovariateout (LOCO) framework is well studied within classical statistical methods (e.g., Lehmann and Romano 2006) and suggested more generally in Lei et al. (2018) in the context of conformal inference.
These methods can also be combined. Mentch and Hooker (2016) examined the change in prediction between two random forests, one trained on the original data, the other trained on data in which feature j was permuted. Here the permutation served simply to make the feature irrelevant to the prediction, and the resulting models were both evaluated within the bulk of the training distribution. As the authors note, the choice to permute, rather than drop, a feature was made in order to maintain the same complexity in the fitting procedure and thus make the two predictions statistically comparable.
In fact, these methods all produce similar variable importance scores. In our simulation in Sect. 2, we also computed the following variable importance measures that combine these ideas:
Conditional Variable Importance measured by creating \(X^{c,j}\) in which \(x_{ij}\) is simulated conditional on the remaining features \(x^{c,j}_{ij} \sim x_{ij}  \varvec{x}_{i,j}\) and measuring
We note that for the Gaussian copula model used here, the distribution of \((x_{ij}\varvec{x}_{i,j})\) can be explicitly computed. Note that the idea of conditional permutation importance for random forests proposed in Strobl et al. (2008) falls into this category, as does the notion of conditional model reliance in Fisher et al. (2019) as described above. In Strobl et al. (2008), the authors generate \(X^{c,j}\) for each tree by permuting \(X_j\) within cells of a partition generated based on all cutting points related to \(X_{j}\) in that tree.
Dropped Variable Importance obtained by the increase in training error when learning a model \(f^{j}(\varvec{x})\) from the data \(\varvec{y},X_{j}\) that does not include the jth feature
This is equivalent to the LOCO methods explored in Lei et al. (2018).
PermuteandRelearn Importance obtained by permuting the features and learning \(f^{\pi ,j}\) from \((\varvec{y},X^{\pi ,j})\) giving
This was the approach taken in Mentch and Hooker (2016) in which distributional results for random forests were used to assess the statistical significance of \(f(\varvec{x})  f^{\pi ,j}(\varvec{x})\).
ConditionandRelearn Importance in which a new model \(f^{c,j}(\varvec{x})\) is learned from the data \((\varvec{y},X^{c,j})\) and we measure
These measures all necessarily entail additional computational costs: requiring training a new model, and/or estimating, and simulating from, the distribution of \((x_{ij}\varvec{x}_{i,j})\). In our simulation, this distribution can be computed analytically, but that will rarely if ever be the case in practice.
Using these measures changes the estimand of variable importance. In the case of leastsquares loss, these do all target the same quantity:
Theorem 2
Let \(\varvec{x}_j^*\) be obtained by replacing \(x_j\) with \(x_j^*\) where \(x_j^* \perp y \varvec{x}_{j}\) and \(f(\varvec{x}) = E(y\varvec{x})\). Then, the minimum least squares predictor of y from \(\varvec{x}^*\) is
and the corresponding variable importances for this f are given by
Note that outside of squared error, the predictor minimizing loss when predicting from \(\varvec{x}^*\) may no longer be \(f_{j}(\varvec{x}_{j})\) and thus, the variable importance definitions may differ.
As we can see in Fig. 7, these measures also all agree (to within Monte Carlo variability) on the ordering of covariate importance across all models. Unlike the permuteandrepredict measures, they reduce the importance of \(x_1\) and \(x_2\) when these become more correlated. For LOCO methods, this can be explained intuitively by \(x_1\) being able to account for the some of the signal coming from \(x_2\). For conditional importance measures, it is associated with the distribution \((x_2x_1)\) having a much smaller variance than the marginal distribution of \(x_2\) (see, for example, the points in Fig. 5).
This is, in fact, what we should expect. For estimated linear models, Theorem 3 states that these all have approximately the same expectation:
Theorem 3
Let \(f(x) = \hat{\beta }_0 + \sum _{j=1}^p \hat{\beta }_j x_j\) be a model fit via leastsquares with linear dependence between features so that \(E(x_{ij}\varvec{x}_{j}) = \gamma _{0j} + \varvec{x}_{i,j} \varvec{\gamma }_j\). Let \(\delta _{ij} = x_{ij}  \hat{\gamma }_0  \varvec{x}_{j}\varvec{\gamma }_j\) be the leastsquares residuals to predict \(x_{ij}\). Then,
Here the addition of o(1) comes from estimating coefficients with a random covariate matrix when permuting a feature; when the importances are normalized by N, this becomes o(1/N) and is generally small.
All of these methods exhibit the compensation effect, reducing the importance of correlated features relative to their coefficients. Theorem 3 also suggests a way to correct for this effect by dividing by the appropriate quantity, if desired. However, these results are only exact for linear models and the most reliable diagnostic that we know of for this is to examine the effect of jointly removing or permuting pairs of features, and then relearning. An extension of Theorem 1 yields a joint importance of \(\sum _{i=1}^N ( \beta _1 (x_{i1}\bar{x}_1) + \beta _1 (x_{i2}\bar{x}_2))^2\), which is not recoverable from any of univariate importance measures discussed in this paper.
A further set of approaches to variable importance use the behavior of \(f(\varvec{x})\) close to values of \(\varvec{x}\) in the data. Saliency (Simonyan et al. 2013) obtains derivatives with respect to \(\varvec{x}\), while LIME (Ribeiro et al. 2016) approximates this with a LASSO method localized to the point of interest by a kernel; Shapley values can also be used for individual predictions (Lundberg and Lee 2017). By querying the value of \(f(\varvec{x})\) close to the features of interest, these should not suffer from extrapolation; although see Slack et al. (2020) for an example of distorting both SHAP and LIME by modifying \(f(\varvec{x})\) when \(\varvec{x}\) is not in the feature distribution. However, local explanations do not generally provide the same globallevel picture of behavior that permutation methods purport to. For example, if f(x) essentially encodes a threshold with a transition point that is not close to observed data, we will see low saliency at all observed points, even though there may be a large range of predictions. Thus, while these kinds of localized explanations may help provide insights into the features affecting particular predictions, they lack the ability to offer an overall summary of a feature’s contribution to the model.
Ordering versus testing: a further word of caution
As discussed throughout this paper, while the permuteandrepredict measures of variable importance can be highly misleading in the presence of correlated features, several alternative measures such as the four mentioned above can alleviate these biases by refitting the models under investigation, leading to importance orderings that are more intuitive, stable, and consistent. We caution here, however, that while such measures can correct improper variable importance orderings, they may not be sufficient to employ variable importances within hypothesis tests.
Formal hypothesis tests for variable importance in random forests were first proposed in Mentch and Hooker (2016) and an alternative nonparametric test with potential to operate in bigdata settings was recently proposed in Coleman et al. (2019). A similar modelagnostic variant was recently proposed in Williamson et al. (2020) Rather than assign a particular measure of variable importance, these tests assume that such a measure already exists and evaluate whether a given feature or collection of features is significantly more important than could be expected by random chance. More formally, these tests partition the features into two sets \(\varvec{x}_1\) and \(\varvec{x}_2\) and consider a null hypothesis that can be written generically as:
and evaluated on an external test set. Here, \(RF(\varvec{x}_1,\varvec{x}_2)\) denotes a random forest constructed on the original features \((\varvec{x}_1,\varvec{x}_2)\) and \(RF(\varvec{x}_1,\varvec{x}_{2}^{*})\) denotes a random forest constructed on the same original features \(\varvec{x}_1\), but where \(\varvec{x}_2\) is either dropped or replaced by a nonimportant, randomized substitute such as a permutation or a new sample conditional on \(\varvec{x}_1\). Note that these correspond exactly to the importance measures described in the preceding subsection.
The intuition behind these tests is that if the features in \(\varvec{x}_2\) are important, then they should make a meaningful contribution to the predictive accuracy of the model beyond what can be obtained by using \(\varvec{x}_1\) alone. In that case, we should expect that \(\text {Error} \left[ RF(\varvec{x}_1,\varvec{x}_{2}^{*}) \right] > \text {Error} \left[ RF(\varvec{x}_1,\varvec{x}_2) \right] \) and we can thus reject \(H_0\) and conclude that \(\varvec{x}_2\) is of significant importance.
In recent work, however, Mentch and Zhou (2020) showed that the manner in which \(\varvec{x}_{2}^{*}\) is altered can have a substantial impact on the performance of the aforementioned hypothesis tests. In particular, the authors demonstrate that there are settings in which the “PermuteandRelearn” approach can identify \(\varvec{x}_2\) as predictively significant, even when those features are completely independent of the response, conditional on \(\varvec{x}_1\).
As a demonstration of this, consider again the same linear regression model
utilized in previous sections, but where observations are sampled independently from \(N(0,\Sigma )\) where the \((i,j)^{th}\) entry of \(\Sigma \) is of the form \(\rho ^{ij}\) so as to induce correlation among these features. The additional error \(\epsilon _i \sim N(0,\sigma ^2)\) and \(\sigma \) is chosen to produce a desired signaltonoise ratio (SNR) in the dataset. Now suppose that in addition to these 10 original features, we also consider including q additional noise features. Each of these noise features is sampled from a standard normal and then correlated with one of the original 10 features—selected uniformly at random—at a strength of 0.7 so that conditional on those original 10 features, the q additional features are independent of the response y. We then carry out the testing procedure prescribed in Williamson et al. (2020) on both bagging and random forests, treating \(\varvec{x}_2\) as the set containing the q additional noise features at varying SNRs and sizes of q.
We consider 3 different types of randomized substitutes \(\varvec{x}_{2}^{\star }\). The first is a random permutation of the original \(\varvec{x}_{2}\), corresponding directly to the “PermuteandRelearn” approach. Since we know the true joint feature distribution in this simulation, random samples of \(\varvec{x}_{2}\) from the true conditional distribution can be obtained and used as the second type of random substitutes \(\varvec{x}_{2}^{\star }\). On the other hand, in practice, this conditional distribution needs to be estimated. Thus, as our third form of substitution we utilize the ModelX (MX) knockoff framework proposed by Candes et al. (2018) to generate \(\varvec{x}_{2}^{\star }\). In particular, we sample secondorder multivariate Gaussian knockoff variables using the approximate semidefinite program construction (Candes et al. 2018) as implemented in the R package knockoff. The entire procedure is repeated 100 times for each setting combination and each time we record whether the null hypothesis above was rejected. Averaging across the 100 trials gives the proportion of times we reject \(H_0\) and conclude that the q additional noise features are significantly important. Results are shown in Fig. 8.
Importantly, note that because the q additional noise features are conditionally independent of the response, intuitively, we should expect this test to reject only about 5% of the time when \(\alpha =0.05\), as it is here. It is immediately obvious from the left plot in Fig. 8, however, that in many settings, especially as increasingly many noise features are added, the rejection rates of the “PermuteandRelearn” approach lie well above that nominal level. The heart of the issue here is that by permuting those q features in \(\varvec{x}_2\), we are breaking not only their relationship to the response, but also their relationship to (i.e., correlation with) other features. Also note, importantly, that this is not an issue arising from this particular test or set of hypotheses—any test of conditional independence evaluated by comparing model performance when a subset of features are dropped or permuted will suffer the same issue. On the other hand, with random substitutes drawn from the true conditional distribution (rightmost plot in Fig. 8), the false rejection rates lie very near the prespecified nominal level of 0.05. The middle plot in Fig. 8 suggests MX knockoffs are able to adequately account for this correlation structure as here too we see rejections happening about 5% of the time.
Thus, in keeping with the overall theme of our work, this demonstrates that even though relearning after permuting solves many of the initial issues discussed above, relearning alone does not fully resolve the issues associated with permutationbased variable importance. We also stress that the alternative importance measures discussed above that specifically try to generate randomized replacement feature copies that preserve the betweenfeature relationship do not appear to suffer from such testing difficulties. For a much more extended discussion on this topic, we refer the reader to Mentch and Zhou (2020).
Real world data: bike sharing
To illustrate the realworld impact of the difference among these importance measures, Fig. 9 presents the importance rankings of features in the hourly bike share data reported in FanaeeT and Gama (2013) as stored on the UCI repository. Here we predicted the log number of rentals each hour from 14 features using the randomForest package in R. We report the importance rank (ordered from least to most) of each feature as calculated by the default outofbag permutation measure, and as calculated by \(\text{ VI}^{\pi L}_j\)—permuting the jth feature, but then learning a new model before assessing the change in accuracy. \(\text{ VI}^{\pi L}_j\) was chosen because it required only reusing the current learning method and maintained the dimension of the feature space.
Here we observe that while many of the features exhibit comparable ranks, there are some notable disagreements, temp, in particular, appearing important in OOB measures, but quite unimportant otherwise. A screening tool based on OOB importance might have selected this rather than yr to include in candidate features, possibly harming subsequent analysis.
Partial dependence alternatives
While restricting to the data distribution creates a number of ways to redesign feature importance measures as illustrated in Sect. 5, this is less straightforward for plots of effects. We now discuss briefly some alternatives that avoid extrapolation.
ICE plots can be restricted to a range of values consistent with the data distribution. In Fig. 3, we have indicated regions with high data density by making the ICE plot lines solid over this portion of \(x_1\). This device provides local information, but also serves to demonstrate the extent of dependence of \(x_1\) on other covariates. However, we note here that we need some means of determining an appropriate range of values for each \(x_1\). Originally, Goldstein et al. (2015) suggested labeling all observations on ICE plots, although this does not indicate the range over which the ICE plot is based on values near observed data. In Fig. 3, we have obtained this from 2standard deviations within the Gaussian copula used to generate the data. However, lacking this information, obtaining these bounds requires us to estimate a conditional distribution.
Figure 6 suggests modifying partial dependence plots to average only the solid parts of each ICE line. This could be strongly misleading—attributing changes due to \(x_2\) rather to \(x_1\). Hooker (2007) provides a reinterpretation of permutation diagnostics in terms of the functional ANOVA decomposition (1). In this framework, equivalents of partial dependence functions can be obtained by finding functions \(f_1(x_1)\) and \(f_{1}(\varvec{x}_{1})\) to minimize
in which \(p(\varvec{x})\) approximates the feature distribution and \(f_{1}(\varvec{x}_{1})\) is an unknown function of all features except \(x_1\). Hooker (2007) minimized a quasiMonte Carlo approximation to this integral, but required an estimate of \(p(\varvec{x})\), which will likely not be accurate in high dimensions. Chastaing et al. (2012) modified the estimation technique to include smoothing methods. Similar structures were used in Mentch and Hooker (2017) to test for feature interactions.
A key problem for these methods is the need to jointly estimate \(f_1(x_1)\) and the highdimensional \(f_{1}(\varvec{x}_{1})\), requiring specialized learning methods. Lou et al. (2013) and Tan et al. (2018b) instead fit a generalized additive model (Wood 2006) that includes only onedimensional functions in the right hand side of (1). These can be fit to the data directly or may be used to examine the values of \(f(\varvec{x})\) as a model distillation method. In Fig. 3, our linear model fits explicitly fall within this class and provide a coherent, extrapolationfree, representation of the underlying function.
Conclusions
While naïve permutationbased methods can be appealing, we have shown with some quite simple examples that they can give misleading results. We also identify the extrapolation behavior by flexible models as a significant source of error in these diagnostics. The precise biases that permuteandpredict methods produce will depend on the learning method employed as well as the specifics of the dependence of the features and the response function; see Bénard et al. (2021) for approaches to this analysis.
Alternative methods for summaries of feature importance all require further computational effort. \(\text{ VI}^{\pi L}_j\) still employs permutations, but learns a new model after permuting the features; Mentch and Hooker (2016) found that by maintaining the feature dimension, this made for a better statistical comparison than dropping a feature and relearning as we have done in \(\text{ VI}^{D}_j\). As demonstrated in earlier sections, an even better approach is to conditionandrelearn so that the randomized features used to replace those under investigation maintain at least approximate dependencies between the remaining features. Recent work by Berrett et al. (2020) presents something of a hybrid approach between these that still utilizes permuted replacement features, but where those permutations are sampled in a nonuniform fashion informed by the conditional distribution. Methods that avoid relearning the response can be based on conditional permutation or simulation, but in general that still requires a model for \(x_{ij}\varvec{x}_{i,j}\); see Liu and Zheng (2018) for recent developments. Alternative measures of importance include generalizations of Sobol indices (Hooker 2007) and Shapley values (Owen 2014; Lundberg and Lee 2017), although the calculation of these, if not undertaken carefully, can be subject to the same extrapolation bias that we identify here.
Beyond assigning importance scores, the use of permuteandpredict methods in PD and ICE plots are concerning for the same reasons. Alternatives to these are more challenging. Local explanation methods such as LIME and saliency maps avoid extrapolation, but do not provide a global representation of the learned model over the whole range of feature values; a threshold function being a case in point. We also note that the counterfactual explanation methods explored in Wachter et al. (2017) may pose similar extrapolation problems, but have not explored this here.
As an alternative visual diagnostic, the additive models explored in Tan et al. (2018b) produce effective graphical displays. Tan et al. (2018a) found that these better represented the overall behavior of the function than methods based on combining local explanations. However, specialized methods are still required to employ the diagnostics suggested in Hooker (2007).
References
Archer, K.J., Kimes, R.V.: Empirical characterization of random forest variable importance measures. Comput. Stat. Data Anal. 52(4), 2249–2260 (2008)
Barber, R.F., Candès, E.J., et al.: Controlling the false discovery rate via knockoffs. Ann. Stat. 43(5), 2055–2085 (2015)
Bénard, C., Da Veiga, S., Scornet, E.: Mda for random forests: inconsistency, and a practical solution via the sobolmda. arXiv preprintarXiv:2102.13347 (2021)
Berrett, T.B., Wang, Y., Barber, R.F., Samworth, R.J.: The conditional permutation test for independence while controlling for confounders. J. R. Stat. Soc. Ser. B Stat. Methodol. 82(1), 175–197 (2020)
Breiman, L.: Random Forests. Mach. Learn. 45, 5–32 (2001)
Candes, E., Fan, Y., Janson, L., Lv, J.: Panning for gold: “modelx” knockoffs for high dimensional controlled variable selection. J. R. Stat. Soc. Ser. B Stat. Methodol. 80(3), 551–577 (2018)
Chastaing, G., Gamboa, F., Prieur, C., et al.: Generalized Hoeffding–Sobol decomposition for dependent variablesapplication to sensitivity analysis. Electron. J. Stat. 6, 2420–2448 (2012)
Coleman, T., Peng, W., Mentch, L.: Scalable and efficient hypothesis testing with random forests. arXiv preprintarXiv:1904.07830 (2019)
DíazUriarte, R., De Andres, S.A.: Gene selection and classification of microarray data using random forest. BMC Bioinform. 7(1), 3 (2006)
FanaeeT, H., Gama, J.: Event labeling combining ensemble detectors and background knowledge. Prog. Artif. Intell. 1–15, 66 (2013)
Fisher, A., Rudin, C., Dominici, F.: All models are wrong, but many are useful: Learning a variable’s importance by studying an entire class of prediction models simultaneously. J. Mach. Learn. Res. 20(177), 1–81 (2019)
Friedman, J.H.: Greedy function approximation: a gradient boosting machine. Ann. Stat. 1189–1232, 66 (2001)
Goldstein, A., Kapelner, A., Bleich, J., Pitkin, E.: Peeking inside the black box: visualizing statistical learning with plots of individual conditional expectation. J. Comput. Graph. Stat. 24(1), 44–65 (2015)
Gregorutti, B., Michel, B., SaintPierre, P.: Grouped variable importance with random forests and application to multiple functional data analysis. Comput. Stat. Data Anal. 90, 15–35 (2015)
Hooker, G.: Generalized functional Anova diagnostics for highdimensional functions of dependent variables. J. Comput. Graph. Stat. 16(3), 66 (2007)
Ishwaran, H., Lu, M.: Standard errors and confidence intervals for variable importance in random forest regression, classification, and survival. Stat. Med. 38(4), 558–582 (2019)
Lehmann, E.L., Romano, J.P.: Testing Statistical Hypotheses. Springer (2006)
Lei, J., G’Sell, M., Rinaldo, A., Tibshirani, R.J., Wasserman, L.: Distributionfree predictive inference for regression. J. Am. Stat. Assoc. 113(523), 1094–1111 (2018)
Li, X., Wang, Y., Basu, S., Kumbier, K., Yu, B.: A debiased mdi feature importance measure for random forests. arXiv preprint arXiv:1906.10845 (2019)
Liu, Y., Zheng, C.: Autoencoding knockoff generator for fdr controlled variable selection. arXiv preprint arXiv:1809.10765 (2018)
Loecher, M.: Unbiased variable importance for random forests. Commun. Stat. Theory Methods 66, 1–13 (2020)
Lou, Y., Caruana, R., Gehrke, J., Hooker, G.: Accurate intelligible models with pairwise interactions. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 623–631. ACM (2013)
Lundberg, S.M., Lee, S.I.: A unified approach to interpreting model predictions. In: Proceedings of the 31st International Conference on Neural Information Processing Systems, pp. 4768–4777 (2017)
Mentch, L., Hooker, G.: Quantifying uncertainty in random forests via confidence intervals and hypothesis tests. J. Mach. Learn. Res. 17(1), 841–881 (2016)
Mentch, L., Hooker, G.: Formal hypothesis tests for additive structure in random forests. J. Comput. Graph. Stat. 26(3), 589–597 (2017)
Mentch, L., Zhou, S.: Getting better from worse: augmented bagging and a cautionary tale of variable importance. arXiv preprint arXiv:2003.03629 (2020)
Nelsen, R.B.: An Introduction to Copulas. Springer (2007)
Nicodemus, K.K., Malley, J.D., Strobl, C., Ziegler, A.: The behaviour of random forest permutationbased variable importance measures under predictor correlation. BMC Bioinform. 11(1), 110 (2010)
Owen, A.B.: Sobol’indices and shapley value. SIAM/ASA J. Uncertain. Quantif. 2(1), 245–251 (2014)
Ribeiro, M.T., Singh, S., Guestrin, C.: Why should i trust you? Explaining the predictions of any classifier. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1135–1144. ACM (2016)
Roosen, C.B.: Visualization and Exploration of Highdimensional Functions Using the Functional ANOVA Decomposition. Ph. D. thesis, Stanford University (1995)
Rudin, C.: Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead. Nat. Mach. Intell. 1(5), 206–215 (2019)
Simonyan, K., Vedaldi, A., Zisserman, A.: Deep inside convolutional networks: visualising image classification models and saliency maps. arXiv preprint arXiv:1312.6034 (2013)
Slack, D., Hilgard, S., Jia, E., Singh, S., Lakkaraju, H.: Fooling lime and shap: adversarial attacks on post hoc explanation methods. In: Proceedings of the AAAI/ACM Conference on AI, Ethics, and Society, pp. 180–186 (2020)
Sobol, I.M.: Sensitivity analysis for nonlinear mathematical models. Math. Model. Comput. Exp. 1, 407–414 (1993)
Strobl, C., Boulesteix, A.L., Zeileis, A., Hothorn, T.: Bias in random forest variable importance measures: illustrations, sources and a solution. BMC Bioinform. 8(1), 25 (2007)
Strobl, C., Boulesteix, A.L., Kneib, T., Augustin, T., Zeileis, A.: Conditional variable importance for random forests. BMC Bioinform. 9(1), 307 (2008)
Tan, S., Caruana, R., Hooker, G., Koch, P., Gordo, A.: Learning global additive explanations for neural nets using model distillation. arXiv preprint arXiv:1801.08640 (2018)
Tan, S., Caruana, R., Hooker, G., Lou, Y.: Distillandcompare: auditing blackbox models using transparent model distillation. In: Proceedings of the 2018 AAAI/ACM Conference on AI, Ethics, and Society, pp. 303–310 (2018)
Toloşi, L., Lengauer, T.: Classification with correlated features: unreliability of feature ranking and solutions. Bioinformatics 27(14), 1986–1994 (2011)
Tuv, E., Borisov, A., Runger, G., Torkkola, K.: Feature selection with ensembles, artificial variables, and redundancy elimination. J. Mach. Learn. Res. 10, 1341–1366 (2009)
Wachter, S., Mittelstadt, B., Russell, C.: Counterfactual explanations without opening the black box: automated decisions and the gdpr. Harv. J. Law Technol. 31, 841 (2017)
Williamson, B.D., Gilbert, P.B., Simon, N.R., Carone, M.: A unified approach for inference on algorithmagnostic variable importance. arXiv preprint arXiv:2004.03683 (2020)
Wood, S.N.: Generalized Additive Models: An Introduction with R. Chapman and Hall/CRC (2006)
Wu, Y., Boos, D.D., Stefanski, L.A.: Controlling variable selection by the addition of pseudovariables. J. Am. Stat. Assoc. 102(477), 235–243 (2007)
Zhou, Z., Hooker, G.: Unbiased measurement of feature importance in treebased methods. arXiv preprint arXiv:1903.05179 (2019)
Acknowledgements
This work was partially supported by NSF Grants DMS1712554, DMS1712041 and DMS2015400 as well as the Center for Research Computing at the University of Pittsburgh.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Supplementary Information
Below is the link to the electronic supplementary material.
Proofs of results
Proofs of results
Proof of Theorem 1:
We observe \(E_{\pi } x_{ij}^{\pi ,j} = \bar{x}_j\) and write
Examining the second term, when \(f(\varvec{x}_i) = \varvec{x}_i \beta \) standard results give that \(\sum _{i=1}^{N} (y_i  \varvec{x}_i \hat{\beta })x_i = 0\) further \(E_{\pi } \sum _{i=1}^N (y_i  \varvec{x}_i \hat{\beta })x_{ij}^{\pi ,j} = \sum _{i=1}^{N} (y_i  \varvec{x}_i \hat{\beta }) \bar{x}_j = 0\). Adding and subtracting \(\bar{x}_j\), the first term can be simplified to
yielding the first result. The remaining identities are the result of direct calculation. \(\square \)
Proof of Theorem 2:
We begin by observing that
This is the quantity we estimate directly in \(\text{ VI}^C_j\). Observing that \(x_j^{\pi ,j}\), \(x_j^{c,j}\) and, in the case of \(\text{ VI}^D_j\) replacing \(x_j\) with any constant, all satisfy \(x_j^* \perp y\varvec{x}_{j}\), yields the result.
Proof of Theorem 3:
Observe that for any invertible matrix A, regressing on XA is equivalent to regressing on X.
For simplicity, we will assume that the feature matrix X includes a column of 1’s to allow for an intercept. Writing \(X \hat{\varvec{\beta }} = X^{j} (\hat{\varvec{\beta }}^{j} + \hat{\gamma }^{j} \hat{\beta }_j) + \beta _j \varvec{\delta }_j\), we have
where \(\varvec{e} = \varvec{y}  X \hat{\varvec{\beta }}\) are orthogonal to \(X^{j}\), as is \(\varvec{\delta }_j\). Then writing
we see the second term is zero by standard results and we obtain the result by substitution.
The result for \(\text{ VI}^{\pi L}_j\) can be shown by first centering the \(x_{ij}\) after which \(E_{\pi } \sum _{i=1}^{N} x_{i j}^{\pi ,j} y_i = E_{\pi } \sum _{i=1}^{N} x_{i j}^{\pi j} x_{it k} = 0\). Hence, \(E_{\pi } f^{\pi ,j}(\varvec{x}) = f^{j}(\varvec{x}) + o_p(1/N)\) and the result follows from that for \(\text{ VI}^D_j\).
The result for \(\text{ VI}^{C L}_j\) is obtained by the same calculation, after subtracting \(\gamma _{0j} + \varvec{x}_{i,j} \varvec{\gamma }_j\) from \(x_{ij}^{c,j}\).
The result for \(\text{ VI}^C_j\) follows from the calculations in the proof of Theorem 1 after observing that \( E( x_{ij}  x_{ij}^{c,j} )^2 = 2 \text{ var }(x_{ij}\varvec{x}_{j})\).
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Hooker, G., Mentch, L. & Zhou, S. Unrestricted permutation forces extrapolation: variable importance requires at least one more model, or there is no free variable importance. Stat Comput 31, 82 (2021). https://doi.org/10.1007/s1122202110057z
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s1122202110057z
Keywords
 Feature importance
 Partial dependence
 ICE plot
 Permutation
 Functional ANOVA
 Intelligibility
 Interpretation