Fast Calculation of Feature Contributions in Boosting Trees
Not on the map. Why?
Abstract (arXiv)
Recently, several fast algorithms have been proposed to decompose predicted value into Shapley values, enabling individualized feature contribution analysis in tree models. While such local decomposition offers valuable insights, it underscores the need for a global evaluation of feature contributions. Although coefficients of determination (R2) allow for comparative assessment of individual features, individualizing R2 is challenged by the underlying quadratic losses. To address this, we propose Q-SHAP, an efficient algorithm that reduces the computational complexity of calculating Shapley values for quadratic losses to polynomial time. Our simulations show that Q-SHAP not only improves computational efficiency but also enhances the accuracy of feature-specific R2 estimates.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 8 of its 30 references that are in the map. First posted on arXiv 3 Jul 2024.
Builds on
8 of 30 references.
References · 8
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2020Interpretability of machine learning based prediction models in healthcarecited by 75
- 2020Efficient nonparametric statistical inference on population feature importance using Shapley valuescited by 61
- 2021RKHS-SHAP: Shapley Values for Kernel Methodscited by 30
- 2021Fast TreeSHAP: Accelerating SHAP Value Computation for Treescited by 28
- 2021SHAFF: Fast and consistent SHApley eFfect estimates via random Forestscited by 22
- 2022Linear TreeShapcited by 12
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.