{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/beyond-treeshap-efficient-computation-of-any","title":"Beyond TreeSHAP: Efficient Computation of Any-Order Shapley Interactions for Tree Ensembles","arxiv_id":"2401.12069","date":"2024-01-22","proceeding":null,"authors":["Maximilian Muschalik","Fabian Fumagalli","Barbara Hammer","Eyke Hüllermeier"],"abstract":"While shallow decision trees may be interpretable, larger ensemble models like gradient-boosted trees, which often set the state of the art in machine learning problems involving tabular data, still remain black box models. As a remedy, the Shapley value (SV) is a well-known concept in explainable artificial intelligence (XAI) research for quantifying additive feature attributions of predictions. The model-specific TreeSHAP methodology solves the exponential complexity for retrieving exact SVs from tree-based models. Expanding beyond individual feature attribution, Shapley interactions reveal the impact of intricate feature interactions of any order. In this work, we present TreeSHAP-IQ, an efficient method to compute any-order additive Shapley interactions for predictions of tree-based models. TreeSHAP-IQ is supported by a mathematical framework that exploits polynomial arithmetic to compute the interaction scores in a single recursive traversal of the tree, akin to Linear TreeSHAP. We apply TreeSHAP-IQ on state-of-the-art tree ensembles and explore interactions on well-established benchmark datasets.","url_abs":"https://arxiv.org/abs/2401.12069v1","url_pdf":"https://arxiv.org/pdf/2401.12069v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"beyond-treeshap-efficient-computation-of-any","repo_url":"https://github.com/mmschlk/treeshap-iq","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"xai","task_name":"Explainable Artificial Intelligence (XAI)"},{"task_slug":"explainable-artificial-intelligence","task_name":"Explainable artificial intelligence"}],"methods":[{"method_slug":"set","method_name":"SET"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2401.12069","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.12069"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mmschlk/treeshap-iq","reach":null}],"summary":{"ran":2,"unverified":2},"by_repo_kind":{"official":{"samples":4,"ran":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":4,"samples":[{"code_sha256_prefix":"08f7edd641cf11ae","entry":"EdgeTree","repo":"mmschlk/treeshap-iq","repo_kind":"official","path":"tree_shap_iq/base.py","file_url":"https://github.com/mmschlk/treeshap-iq/blob/HEAD/tree_shap_iq/base.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"08f7edd641cf11ae"}},{"code_sha256_prefix":"c91049741a5a0707","entry":"TreeModel","repo":"mmschlk/treeshap-iq","repo_kind":"official","path":"tree_shap_iq/base.py","file_url":"https://github.com/mmschlk/treeshap-iq/blob/HEAD/tree_shap_iq/base.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"c91049741a5a0707"}},{"code_sha256_prefix":"66c91e40b99c767f","entry":"TreeShapIQ","repo":"mmschlk/treeshap-iq","repo_kind":"official","path":"tree_shap_iq/base.py","file_url":"https://github.com/mmschlk/treeshap-iq/blob/HEAD/tree_shap_iq/base.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"66c91e40b99c767f"}},{"code_sha256_prefix":"118c868ccdfb2ce5","entry":"extract_edge_information_from_tree","repo":"mmschlk/treeshap-iq","repo_kind":"official","path":"tree_shap_iq/base.py","file_url":"https://github.com/mmschlk/treeshap-iq/blob/HEAD/tree_shap_iq/base.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"118c868ccdfb2ce5"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}