2023-04-14    Share on: Twitter | Facebook | HackerNews | Reddit

KernelShap and TreeShap - Two Most Popular Variations of the SHAP method

Making sense of AI's inner workings with KernelShap and TreeShap – the powerfull tools for responsible AI.


Responsible AI is an approach to artificial intelligence that ensures fairness, transparency, and accountability in the development, deployment, and management of AI systems. In the era of increasing reliance on AI-driven decision-making, understanding and explaining the predictions made by these models is essential. Interpretability of AI models helps build trust, enables better decision-making, and allows us to mitigate biases. 

Two popular methods for explaining AI models are KernelShap and TreeShap. These techniques are part of the SHAP (SHapley Additive exPlanations) family, which is based on cooperative game theory. In this blog post, we will delve into the details of KernelShap and TreeShap, exploring their underlying principles, advantages, and use cases. 


KernelShap is a model-agnostic explanation method that provides interpretable explanations for any black-box model. It uses the concept of Shapley values from cooperative game theory to attribute feature importance to individual features in the context of a specific prediction. 

The Shapley value for feature \(i\) in a model \(f\) can be calculated using the following formula: 

$$ϕ_i(f) = \sum_{S ⊆ N \setminus {i}} \frac{|S|!(|N|-|S|-1)!}{|N|!} [f(S ∪ {i}) - f(S)]$$

Here, \(S\) is a subset of features excluding \(i\), and \(N\) is the total number of features. The term \(|S|!\) represents the factorial of the number of features in subset \(S\), while \(|N|-|S|-1!\) represents the factorial of the remaining features outside of the subset. The denominator \(|N|!\) is the factorial of the total number of features.

Shapley values, in the context of AI, are used to distribute the contribution of each feature to the final prediction. It ensures that the contribution of each feature is fairly allocated in a way that is efficient, symmetric, and additive. 

KernelShap approximates the Shapley values by solving a weighted linear regression problem. It samples instances from the feature space and estimates the Shapley values using the Lasso regression model. The Lasso model is a linear model with an L1 penalty term, which helps in feature selection and makes the explanation sparse.

Lasso (Least Absolute Shrinkage and Selection Operator) regression is a linear regression technique that includes an L1 penalty term to shrink the coefficients of less important features towards zero. This allows for both regularization and feature selection, resulting in a more interpretable and parsimonious model. 

The equation for Lasso regression is given by: 

$$L(\beta) = \sum_{i=1}^{n}(y_i - X_i\beta)^2 + \lambda\sum_{j=1}^{p}|\beta_j|$$

In this equation: 

  • \(L(\beta)\) represents the objective function to be minimized,
  • \(y_i\) is the actual response (outcome) for the \(i^{th}\) observation,
  • \(X_i\) is the feature vector for the \(i^{th}\) observation,
  • \(\beta\) is the vector of coefficients to be estimated,
  • \(n\) is the total number of observations,
  • \(p\) is the total number of features,
  • \(\lambda\) is a non-negative regularization parameter, and
  • \(|\beta_j|\) is the absolute value of the \(j^{th}\) coefficient. 

The first term, \(\sum_{i=1}{n}(y_i - X_i\beta)2\), is the sum of squared residuals, which represents the difference between the actual and predicted responses. Minimizing this term alone would result in an ordinary least squares regression. 

The second term, \(\lambda\sum_{j=1}^{p}|\beta_j|\), is the L1 penalty term that adds the absolute values of the coefficients multiplied by the regularization parameter \(\lambda\). By increasing \(\lambda\), the penalty term forces some coefficients to be exactly zero, effectively selecting a subset of features for the final model. The optimal value of \(\lambda\) is usually determined through cross-validation.


The KernelShap algorithm involves the following steps: 

  1. Generate a dataset of binary-masked instances by randomly selecting feature combinations.
  2. Compute the output of the black-box model for each instance.
  3. Fit a weighted linear regression model on the generated dataset, where the weights are determined by the similarity between the instance and the instance of interest.
  4. The coefficients of the linear regression model represent the approximate Shapley values. 

KernelShap advantages and limitations

KernelShap has several advantages

  • It can be applied to any black-box model, regardless of its architecture or training algorithm.
  • It provides a unified measure of feature importance that is consistent across different models.
  • It takes into account the interactions between features. 

However, KernelShap also has some limitations

  • It can be computationally expensive, especially for high-dimensional data or complex models.
  • It requires a large number of samples to provide accurate estimates of the Shapley values. 


TreeShap is a model-specific explanation method designed for tree-based models, such as decision trees, random forests, and gradient boosting machines. Like KernelShap, it is based on Shapley values, but it exploits the structure of tree-based models to compute the values efficiently. 

TreeShap computes the exact Shapley values for each feature by recursively traversing the decision tree, attributing contributions to each feature as it moves down the tree. It uses a dynamic programming approach to avoid redundant calculations and reduce the computational complexity.


The TreeShap algorithm involves the following steps: 

  1. Traverse the tree from the root to the leaf nodes, recording the decision path for the instance of interest.
  2. Attribute contributions to each feature encountered along the path, taking into account the number of possible feature combinations and the probability of each combination.
  3. Repeat the process for all trees in the ensemble, if applicable.
  4. Average the contributions across all trees to obtain the final Shapley values. 

TreeShap advantages and limitations

TreeShap has several advantages: 

  • It computes the exact Shapley values without the need for sampling or approximations.
  • It is computationally efficient due to its dynamic programming approach.
  • It is specifically designed for tree-based models, which are widely used in practice. 

However, TreeShap is limited to tree-based models and cannot be applied to other types of models, such as deep learning or support vector machines. 


KernelShap and TreeShap are powerful methods for explaining AI models in the context of responsible AI. Both techniques leverage the concept of Shapley values to provide interpretable and fair attributions of feature importance. While KernelShap is a model-agnostic approach that can be applied to any black-box model, TreeShap is tailored for tree-based models and offers exact Shapley values with computational efficiency. 

Understanding and implementing these methods is crucial for AI practitioners who aim to build transparent, accountable, and trustworthy AI systems. By providing insights into the inner workings of AI models, KernelShap and TreeShap enable developers to identify potential biases, improve the decision-making process, and ultimately foster trust in AI-driven technologies.

Any comments or suggestions? Let me know.

To cite this article:

    author  = {Krystian Safjan},
    title   = {KernelShap and TreeShap - Two Most Popular Variations of the SHAP method},
    journal = {Krystian's Safjan Blog},
    year    = {2023},