Research map / Learning theory and algorithms / Prediction and decision losses
Linear tree shap
Peng Yu, Albert Bifet, Jesse Read, Chao Xu
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 |
|---|---|---|---|
| replace TreeShap and FastTreeShap with Linear TreeShap | Tree Shapley value computation · adult, tree depth 2-18 | speedup over TreeShap | Improved |
| replace TreeShap and FastTreeShap with Linear TreeShap | Tree Shapley value computation · conductor, tree depth 2-18 | speedup over TreeShap | Improved |
| increase tree depth on a dataset with many features | Linear TreeShap · conductor | speedup over TreeShap | Improved |
| use Fast TreeShap V2 at depth 18 | Fast TreeShap · conductor, depth 18 | memory / version used | Hurt |
Closest papers by meaning
- Beyond TreeSHAP: Efficient Computation of Any-Order Shapley Interactions for Tree Ensembles (AAAI 2024 · similarity 0.85)
- A Unified Framework for Provably Efficient Algorithms to Estimate Shapley Values (NeurIPS 2025 · similarity 0.82)
- Near-Optimal Decision Trees in a SPLIT Second (ICML 2025 · similarity 0.82)
- Prediction via Shapley Value Regression (ICML 2025 · similarity 0.81)
- Multistage Defer Trees for Hybrid Interpretability: If at First You Can't Succeed, Tree Again (NeurIPS 2026 · similarity 0.81)
- Compressing tree ensembles through Level-wise Optimization and Pruning (ICML 2025 · similarity 0.80)
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.
