Metraipolis › archive › dc_c60a94017f4c

qshap: Fast Shapley Decomposition of $R^2$ for Gradient-Boosted Trees — arXiv:2608.24104

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.24104
License (as archived)
CC0-1.0
Archived
2026-10-18T06:36:42.919Z
SHA-256 of the archived text
0ed260a2d9391c3f0ffb18c7a361ed3e7d4e7a9b4a00f93445ddb6e9edf5fd95
Stable URL of this page
https://metraipolis.com/documento/dc_c60a94017f4c

How to cite

qshap: Fast Shapley Decomposition of $R^2$ for Gradient-Boosted Trees — arXiv:2608.24104 — arXiv (en), https://arxiv.org/abs/2608.24104 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c60a94017f4c (Metraipolis archive dc_c60a94017f4c, sha256 0ed260a2d9391c3f0ffb18c7a361ed3e7d4e7a9b4a00f93445ddb6e9edf5fd95)
BibTeX
@misc{dcc60a94017f4c,
  title = {qshap: Fast Shapley Decomposition of $R^2$ for Gradient-Boosted Trees — arXiv:2608.24104},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.24104},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c60a94017f4c; sha256 0ed260a2d9391c3f0ffb18c7a361ed3e7d4e7a9b4a00f93445ddb6e9edf5fd95},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.24104. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Numerous methods have been developed to quantify feature attributions in individual predictions for tree ensembles. However, many applications require global measures of feature contributions to overall model performance. Although local attribution scores can be aggregated to characterize feature importance, such summaries do not directly decompose measures of predictive performance, such as $R^2$. This article introduces qshap, available in both R and Python, which provides Shapley decomposition of $R^2$ values for gradient-boosted decision trees (GBDTs) to quantify feature-specific contributions to model performance. By decomposing the quadratic loss of individual observations, qshap provides flexible tools to explore the importance of individual features and observations. qshap currently supports widely used GBDT implementations, including xgboost, lightgbm, and catboost, through a unified tree representation and efficient C++ backends. Its modular design can accommodate other GBDT implementations built from binary decision trees. In addition, we introduce a specialized backend for oblivious trees that exploits their symmetric structure to substantially accelerate computation.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-26 in cs.LG).
Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2608.24104 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T06:28:52.339Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-26?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).