SHAP (SHapley Additive exPlanations) is a game theoretic approach to explain the output of any machine learning model. It connects optimal credit allocation with local explanations using the classic Shapley values from game theory and their related extensions (see [papers](https://github.com/slundberg/shap#citations) for details and citations.
Explainers¶

class
shap.
TreeExplainer
(model, data=None, model_output='raw', feature_perturbation='interventional', **deprecated_options)¶ Uses Tree SHAP algorithms to explain the output of ensemble tree models.
Tree SHAP is a fast and exact method to estimate SHAP values for tree models and ensembles of trees, under several different possible assumptions about feature dependence. It depends on fast C++ implementations either inside an externel model package or in the local compiled C extention.
 model : model object
 The tree based machine learning model that we want to explain. XGBoost, LightGBM, CatBoost, Pyspark and most treebased scikitlearn models are supported.
 data : numpy.array or pandas.DataFrame
 The background dataset to use for integrating out features. This argument is optional when feature_perturbation=”tree_path_dependent”, since in that case we can use the number of training samples that went down each tree path as our background dataset (this is recorded in the model object).
 feature_perturbation : “interventional” (default) or “tree_path_dependent” (default when data=None)
 Since SHAP values rely on conditional expectations we need to decide how to handle correlated (or otherwise dependent) input features. The “interventional” approach breaks the dependencies between features according to the rules dictated by casual inference (Janzing et al. 2019). Note that the “interventional” option requires a background dataset and its runtime scales linearly with the size of the background dataset you use. Anywhere from 100 to 1000 random background samples are good sizes to use. The “tree_path_dependent” approach is to just follow the trees and use the number of training examples that went down each leaf to represent the background distribution. This approach does not require a background dataset and so is used by default when no background dataset is provided.
 model_output : “raw”, “probability”, “log_loss”, or model method name
 What output of the model should be explained. If “raw” then we explain the raw output of the trees, which varies by model. For regression models “raw” is the standard output, for binary classification in XGBoost this is the log odds ratio. If model_output is the name of a supported prediction method on the model object then we explain the output of that model method name. For example model_output=”predict_proba” explains the result of calling model.predict_proba. If “probability” then we explain the output of the model transformed into probability space (note that this means the SHAP values now sum to the probability output of the model). If “logloss” then we explain the log base e of the model loss function, so that the SHAP values sum up to the log loss of the model for each sample. This is helpful for breaking down model performance by feature. Currently the probability and logloss options are only supported when feature_dependence=”independent”.

shap_interaction_values
(X, y=None, tree_limit=None)¶ Estimate the SHAP interaction values for a set of samples.
 X : numpy.array, pandas.DataFrame or catboost.Pool (for catboost)
 A matrix of samples (# samples x # features) on which to explain the model’s output.
 y : numpy.array
 An array of label values for each sample. Used when explaining loss functions (not yet supported).
 tree_limit : None (default) or int
 Limit the number of trees used by the model. By default None means no use the limit of the original model, and 1 means no limit.
For models with a single output this returns a tensor of SHAP values (# samples x # features x # features). The matrix (# features x # features) for each sample sums to the difference between the model output for that sample and the expected value of the model output (which is stored in the expected_value attribute of the explainer). Each row of this matrix sums to the SHAP value for that feature for that sample. The diagonal entries of the matrix represent the “main effect” of that feature on the prediction and the symmetric offdiagonal entries represent the interaction effects between all pairs of features for that sample. For models with vector outputs this returns a list of tensors, one for each output.

shap_values
(X, y=None, tree_limit=None, approximate=False, check_additivity=True)¶ Estimate the SHAP values for a set of samples.
 X : numpy.array, pandas.DataFrame or catboost.Pool (for catboost)
 A matrix of samples (# samples x # features) on which to explain the model’s output.
 y : numpy.array
 An array of label values for each sample. Used when explaining loss functions.
 tree_limit : None (default) or int
 Limit the number of trees used by the model. By default None means no use the limit of the original model, and 1 means no limit.
 approximate : bool
 Run fast, but only roughly approximate the Tree SHAP values. This runs a method previously proposed by Saabas which only considers a single feature ordering. Take care since this does not have the consistency guarantees of Shapley values and places too much weight on lower splits in the tree.
 check_additivity : bool
 Run a validation check that the sum of the SHAP values equals the output of the model. This check takes only a small amount of time, and will catch potential unforeseen errors. Note that this check only runs right now when explaining the margin of the model.
For models with a single output this returns a matrix of SHAP values (# samples x # features). Each row sums to the difference between the model output for that sample and the expected value of the model output (which is stored in the expected_value attribute of the explainer when it is constant). For models with vector outputs this returns a list of such matrices, one for each output.

class
shap.
GradientExplainer
(model, data, session=None, batch_size=50, local_smoothing=0)¶ Explains a model using expected gradients (an extension of integrated gradients).
Expected gradients an extension of the integrated gradients method (Sundararajan et al. 2017), a feature attribution method designed for differentiable models based on an extension of Shapley values to infinite player games (AumannShapley values). Integrated gradients values are a bit different from SHAP values, and require a single reference value to integrate from. As an adaptation to make them approximate SHAP values, expected gradients reformulates the integral as an expectation and combines that expectation with sampling reference values from the background dataset. This leads to a single combined expectation of gradients that converges to attributions that sum to the difference between the expected model output and the current output.

shap_values
(X, nsamples=200, ranked_outputs=None, output_rank_order='max', rseed=None, return_variances=False)¶ Return the values for the model applied to X.
 X : list,
 if framework == ‘tensorflow’: numpy.array, or pandas.DataFrame if framework == ‘pytorch’: torch.tensor A tensor (or list of tensors) of samples (where X.shape[0] == # samples) on which to explain the model’s output.
 ranked_outputs : None or int
 If ranked_outputs is None then we explain all the outputs in a multioutput model. If ranked_outputs is a positive integer then we only explain that many of the top model outputs (where “top” is determined by output_rank_order). Note that this causes a pair of values to be returned (shap_values, indexes), where phi is a list of numpy arrays for each of the output ranks, and indexes is a matrix that tells for each sample which output indexes were choses as “top”.
 output_rank_order : “max”, “min”, “max_abs”, or “custom”
 How to order the model outputs when using ranked_outputs, either by maximum, minimum, or maximum absolute value. If “custom” Then “ranked_outputs” contains a list of output nodes.
 rseed : None or int
 Seeding the randomness in shap value computation (background example choice, interpolation between current and background example, smoothing).
For a models with a single output this returns a tensor of SHAP values with the same shape as X. For a model with multiple outputs this returns a list of SHAP value tensors, each of which are the same shape as X. If ranked_outputs is None then this list of tensors matches the number of model outputs. If ranked_outputs is a positive integer a pair is returned (shap_values, indexes), where shap_values is a list of tensors with a length of ranked_outputs, and indexes is a matrix that tells for each sample which output indexes were chosen as “top”.


class
shap.
DeepExplainer
(model, data, session=None, learning_phase_flags=None)¶ Meant to approximate SHAP values for deep learning models.
This is an enhanced version of the DeepLIFT algorithm (Deep SHAP) where, similar to Kernel SHAP, we approximate the conditional expectations of SHAP values using a selection of background samples. Lundberg and Lee, NIPS 2017 showed that the per node attribution rules in DeepLIFT (Shrikumar, Greenside, and Kundaje, arXiv 2017) can be chosen to approximate Shapley values. By integrating over many backgound samples DeepExplainer estimates approximate SHAP values such that they sum up to the difference between the expected model output on the passed background samples and the current model output (f(x)  E[f(x)]).

shap_values
(X, ranked_outputs=None, output_rank_order='max', check_additivity=True)¶ Return approximate SHAP values for the model applied to the data given by X.
 X : list,
 if framework == ‘tensorflow’: numpy.array, or pandas.DataFrame if framework == ‘pytorch’: torch.tensor A tensor (or list of tensors) of samples (where X.shape[0] == # samples) on which to explain the model’s output.
 ranked_outputs : None or int
 If ranked_outputs is None then we explain all the outputs in a multioutput model. If ranked_outputs is a positive integer then we only explain that many of the top model outputs (where “top” is determined by output_rank_order). Note that this causes a pair of values to be returned (shap_values, indexes), where shap_values is a list of numpy arrays for each of the output ranks, and indexes is a matrix that indicates for each sample which output indexes were choses as “top”.
 output_rank_order : “max”, “min”, or “max_abs”
 How to order the model outputs when using ranked_outputs, either by maximum, minimum, or maximum absolute value.
For a models with a single output this returns a tensor of SHAP values with the same shape as X. For a model with multiple outputs this returns a list of SHAP value tensors, each of which are the same shape as X. If ranked_outputs is None then this list of tensors matches the number of model outputs. If ranked_outputs is a positive integer a pair is returned (shap_values, indexes), where shap_values is a list of tensors with a length of ranked_outputs, and indexes is a matrix that indicates for each sample which output indexes were chosen as “top”.


class
shap.
KernelExplainer
(model, data, link=<shap.common.IdentityLink object>, **kwargs)¶ Uses the Kernel SHAP method to explain the output of any function.
Kernel SHAP is a method that uses a special weighted linear regression to compute the importance of each feature. The computed importance values are Shapley values from game theory and also coefficents from a local linear regression.
 model : function or iml.Model
 User supplied function that takes a matrix of samples (# samples x # features) and computes a the output of the model for those samples. The output can be a vector (# samples) or a matrix (# samples x # model outputs).
 data : numpy.array or pandas.DataFrame or shap.common.DenseData or any scipy.sparse matrix
 The background dataset to use for integrating out features. To determine the impact of a feature, that feature is set to “missing” and the change in the model output is observed. Since most models aren’t designed to handle arbitrary missing data at test time, we simulate “missing” by replacing the feature with the values it takes in the background dataset. So if the background dataset is a simple sample of all zeros, then we would approximate a feature being missing by setting it to zero. For small problems this background dataset can be the whole training set, but for larger problems consider using a single reference value or using the kmeans function to summarize the dataset. Note: for sparse case we accept any sparse matrix but convert to lil format for performance.
 link : “identity” or “logit”
 A generalized linear model link to connect the feature importance values to the model output. Since the feature importance values, phi, sum up to the model output, it often makes sense to connect them to the output with a link function where link(output) = sum(phi). If the model output is a probability then the LogitLink link function makes the feature importance values have logodds units.

shap_values
(X, **kwargs)¶ Estimate the SHAP values for a set of samples.
 X : numpy.array or pandas.DataFrame or any scipy.sparse matrix
 A matrix of samples (# samples x # features) on which to explain the model’s output.
 nsamples : “auto” or int
 Number of times to reevaluate the model when explaining each prediction. More samples lead to lower variance estimates of the SHAP values. The “auto” setting uses nsamples = 2 * X.shape[1] + 2048.
 l1_reg : “num_features(int)”, “auto” (default for now, but deprecated), “aic”, “bic”, or float
 The l1 regularization to use for feature selection (the estimation procedure is based on a debiased lasso). The auto option currently uses “aic” when less that 20% of the possible sample space is enumerated, otherwise it uses no regularization. THE BEHAVIOR OF “auto” WILL CHANGE in a future version to be based on num_features instead of AIC. The “aic” and “bic” options use the AIC and BIC rules for regularization. Using “num_features(int)” selects a fix number of top features. Passing a float directly sets the “alpha” parameter of the sklearn.linear_model.Lasso model used for feature selection.
For models with a single output this returns a matrix of SHAP values (# samples x # features). Each row sums to the difference between the model output for that sample and the expected value of the model output (which is stored as expected_value attribute of the explainer). For models with vector outputs this returns a list of such matrices, one for each output.

class
shap.
SamplingExplainer
(model, data, **kwargs)¶ This is an extension of the Shapley sampling values explanation method (aka. IME)
SamplingExplainer computes SHAP values under the assumption of feature independence and is an extension of the algorithm proposed in “An Efficient Explanation of Individual Classifications using Game Theory”, Erik Strumbelj, Igor Kononenko, JMLR 2010. It is a good alternative to KernelExplainer when you want to use a large background set (as opposed to a single reference value for example).
 model : function
 User supplied function that takes a matrix of samples (# samples x # features) and computes a the output of the model for those samples. The output can be a vector (# samples) or a matrix (# samples x # model outputs).
 data : numpy.array or pandas.DataFrame
 The background dataset to use for integrating out features. To determine the impact of a feature, that feature is set to “missing” and the change in the model output is observed. Since most models aren’t designed to handle arbitrary missing data at test time, we simulate “missing” by replacing the feature with the values it takes in the background dataset. So if the background dataset is a simple sample of all zeros, then we would approximate a feature being missing by setting it to zero. Unlike the KernelExplainer this data can be the whole training set, even if that is a large set. This is because SamplingExplainer only samples from this background dataset.

class
shap.
PartitionExplainer
(model, masker, partition_tree)¶ 
create_cluster_matrices
(partition_tree)¶ Build clustering dependent reuseable variables.

owen
(x, nsamples, output_indexes, interaction_tolerance, context, batch_size, silent)¶ Compute a nested set of recursive Owen values based on an ordering recursion.

single_context_owen
(x, nsamples, output_indexes, interaction_tolerance, context, silent)¶ Compute a nested set of recursive Owen values.
