Linear TreeShap

09/16/2022
by   Peng Yu, et al.
0

Decision trees are well-known due to their ease of interpretability. To improve accuracy, we need to grow deep trees or ensembles of trees. These are hard to interpret, offsetting their original benefits. Shapley values have recently become a popular way to explain the predictions of tree-based machine learning models. It provides a linear weighting to features independent of the tree structure. The rise in popularity is mainly due to TreeShap, which solves a general exponential complexity problem in polynomial time. Following extensive adoption in the industry, more efficient algorithms are required. This paper presents a more efficient and straightforward algorithm: Linear TreeShap. Like TreeShap, Linear TreeShap is exact and requires the same amount of memory.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/28/2016

VHT: Vertical Hoeffding Tree

IoT Big Data requires new machine learning methods able to scale to larg...
research
06/01/2021

Decision Concept Lattice vs. Decision Trees and Random Forests

Decision trees and their ensembles are very popular models of supervised...
research
02/16/2023

On marginal feature attributions of tree-based models

Due to their power and ease of use, tree-based machine learning models h...
research
09/29/2022

Understanding Interventional TreeSHAP : How and Why it Works

Shapley values are ubiquitous in interpretable Machine Learning due to t...
research
05/11/2019

Explainable AI for Trees: From Local Explanations to Global Understanding

Tree-based machine learning models such as random forests, decision tree...
research
10/27/2020

GPUTreeShap: Fast Parallel Tree Interpretability

SHAP (SHapley Additive exPlanation) values provide a game theoretic inte...
research
09/20/2021

Fast TreeSHAP: Accelerating SHAP Value Computation for Trees

SHAP (SHapley Additive exPlanation) values are one of the leading tools ...

Please sign up or login with your details

Forgot password? Click here to reset