Research map / Learning theory and algorithms / Prediction and decision losses
From Decision Trees to Boolean Logic: A Fast and Unified SHAP Algorithm
Alexander Nadel, Ron Wettenstein
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use WOODELF instead of PLTreeShap | PLTreeShap · KDD Cup 1999 Background SHAP (CPU) | runtime: 44 min -> 162 sec | Improved |
| run WOODELF on GPU instead of CPU | WOODELF · KDD Cup 1999 Background SHAP | runtime: 162 sec -> 16 sec | Improved |
| use WOODELF instead of PLTreeShap | PLTreeShap · IEEE-CIS Background SHAP (CPU) | runtime: 245 sec -> 12 sec | Improved |
| use WOODELF on CPU instead of FastTreeShap v2 | FastTreeShap v2 · KDD Cup 1999 Path-Dependent SHAP | runtime: 373 sec -> 96 sec | Improved |
| use WOODELF on GPU instead of FastTreeShap v2 | FastTreeShap v2 · IEEE-CIS Path-Dependent SHAP | runtime: 0.9 sec -> 3.3 sec | Hurt |
| use WOODELF CPU instead of FastTreeShap v2 CPU | FastTreeShap v2 · IEEE-CIS Path-Dependent SHAP | runtime: 16 sec -> 6 sec | Improved |
| use WOODELF for Shapley interaction values instead of FastTreeShap v1 | FastTreeShap v1 · KDD Cup 1999 Path-Dependent SHAP IV (CPU) | runtime: 221 min -> 193 sec | Improved |
| use WOODELF instead of PLTreeShap for interaction values | PLTreeShap · KDD Cup 1999 Background SHAP IV (CPU) | runtime: 105 min -> 262 sec | Improved |
Closest papers by meaning
- shapiq: Shapley Interactions for Machine Learning (NeurIPS 2024 · similarity 0.88)
- Fast Estimation of Partial Dependence Functions using Trees (ICML 2025 · similarity 0.87)
- Beyond TreeSHAP: Efficient Computation of Any-Order Shapley Interactions for Tree Ensembles (AAAI 2024 · similarity 0.87)
- On the Tractability of SHAP Explanations under Markovian Distributions (ICML 2024 · similarity 0.87)
- SHAP values via sparse Fourier representation (NeurIPS 2025 · similarity 0.87)
- Provably Accurate Shapley Value Estimation via Leverage Score Sampling (ICLR 2025 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
