mlsanityData to 7 Oct 2026

Linear TreeShap

arXiv 2209.08192 ↗First posted 16 Sep 2022cs.LGcited by 12

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 2 of its 22 references that are in the map. First posted on arXiv 16 Sep 2022.

Builds on

2 of 22 references.

References · 2

  1. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
  2. 2021Fast TreeSHAP: Accelerating SHAP Value Computation for Treescited by 28

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 2; 2026: 8.

12 papers.