Considerations When Learning Additive Explanations for Black-Box Models
Not on the map. Why?
Abstract (arXiv)
Many methods to explain black-box models, whether local or global, are additive. In this paper, we study global additive explanations for non-additive models, focusing on four explanation methods: partial dependence, Shapley explanations adapted to a global setting, distilled additive explanations, and gradient-based explanations. We show that different explanation methods characterize non-additive components in a black-box model's prediction function in different ways. We use the concepts of main and total effects to anchor additive explanations, and quantitatively evaluate additive and non-additive explanations. Even though distilled explanations are generally the most accurate additive explanations, non-additive explanations such as tree explanations that explicitly model non-additive components tend to be even more accurate. Despite this, our user study showed that machine learning practitioners were better able to leverage additive explanations for various tasks. These considerations should be taken into account when considering which explanation to trust and use to explain black-box models.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 26 Jan 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 5; 2025: 3; 2026: 1.
10 papers.
- 2024Towards the Dynamics of a DNN Learning Symbolic Interactionscited by 13
- 2024Unifying Feature-Based Explanations with Functional ANOVA and Cooperative Game Theorycited by 10
- 2024NeurCAM: Interpretable Neural Clustering via Additive Modelscited by 3
- 2024Function Trees: Transparent Machine Learningcited by 1
- 2024T-Explainer: A Model-Agnostic Explainability Framework Based on Gradientscited by 1
- 2025Disentangling Visual Transformers: Patch-level Interpretability for Image Classificationcited by 1
- 2022Deep Explainable Learning with Graph Based Data Assessing and Rule Reasoningcited by 0
- 2025midr: Learning from Black-Box Models by Maximum Interpretation Decompositioncited by 0
- 2025Restricted Receptive Fields for Face Verificationcited by 0
- 2026textttfindr: Transparent and Fair Credit Risk Decisions through Semi-Structured Regressionscited by 0
- 2026textttfindr: Transparent and Fair Credit Risk Decisions through Semi-Structured Regressions25 Aug 2026
- 2025Restricted Receptive Fields for Face Verification12 Oct 2025
- 2025midr: Learning from Black-Box Models by Maximum Interpretation Decomposition10 Jun 2025
- 2025Disentangling Visual Transformers: Patch-level Interpretability for Image Classification24 Feb 2025
- 2024Unifying Feature-Based Explanations with Functional ANOVA and Cooperative Game Theory22 Dec 2024
- 2024NeurCAM: Interpretable Neural Clustering via Additive Models23 Aug 2024
- 2024Towards the Dynamics of a DNN Learning Symbolic Interactions27 Jul 2024
- 2024T-Explainer: A Model-Agnostic Explainability Framework Based on Gradients25 Apr 2024
- 2024Function Trees: Transparent Machine Learning19 Mar 2024
- 2022Deep Explainable Learning with Graph Based Data Assessing and Rule Reasoning9 Nov 2022