Fast Calculation of Feature Contributions in Boosting Trees.

Zhongli Jiang, Min Zhang, Dabao Zhang
{"title":"Fast Calculation of Feature Contributions in Boosting Trees.","authors":"Zhongli Jiang, Min Zhang, Dabao Zhang","doi":"","DOIUrl":null,"url":null,"abstract":"<p><p>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 <math><mo>(</mo> <msup><mrow><mi>R</mi></mrow> <mrow><mn>2</mn></mrow> </msup> <mo>)</mo></math> allow for comparative assessment of individual features, individualizing <math> <msup><mrow><mi>R</mi></mrow> <mrow><mn>2</mn></mrow> </msup> </math> 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 <math> <msup><mrow><mi>R</mi></mrow> <mrow><mn>2</mn></mrow> </msup> </math> estimates.</p>","PeriodicalId":74504,"journal":{"name":"Proceedings of machine learning research","volume":"286 ","pages":"1859-1875"},"PeriodicalIF":0.0000,"publicationDate":"2025-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC13235423/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of machine learning research","FirstCategoryId":"1085","ListUrlMain":"","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

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 ( R 2 ) allow for comparative assessment of individual features, individualizing R 2 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 R 2 estimates.

增强树中特征贡献的快速计算。
近年来,提出了几种将预测值分解为Shapley值的快速算法,实现了树模型中个性化特征贡献分析。虽然这种局部分解提供了有价值的见解,但它强调了对特征贡献进行全局评估的必要性。虽然决定系数(r2)允许对单个特征进行比较评估,但个性化r2受到潜在的二次损失的挑战。为了解决这个问题,我们提出了Q-SHAP,这是一种有效的算法,可以将计算二次损失的Shapley值的计算复杂度降低到多项式时间。我们的仿真表明,Q-SHAP不仅提高了计算效率,而且提高了特定特征r2估计的准确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书