WOODELF computes Background SHAP for tree ensembles in linear time via pseudo-Boolean formulas that encode trees, features, and background data, with reported speedups of 16x on CPU and 165x on GPU for million-row datasets.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
From Decision Trees to Boolean Logic: A Fast and Unified SHAP Algorithm
WOODELF computes Background SHAP for tree ensembles in linear time via pseudo-Boolean formulas that encode trees, features, and background data, with reported speedups of 16x on CPU and 165x on GPU for million-row datasets.