mlsanityData to 7 Oct 2026

TaylorPODA: A Taylor Expansion-Based Method to Improve Post-Hoc Attributions for Opaque Models

arXiv 2507.10643 ↗First posted 14 Jul 2025stat.ML cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Post-hoc model-agnostic local attribution (LA) methods have been widely adopted to explain opaque AI models by quantifying feature-wise contributions. However, many existing methods rely on heuristic or only partially justified attribution mechanisms, while the quality of attribution itself is often shaped by downstream objectives without universally accepted standards. In this work, we propose Taylor exPansion-Originated aDaptive Attribution (TaylorPODA), a new post-hoc model-agnostic LA method grounded in the Taylor expansion framework. We first introduce a set of postulates, which formalize principled requirements for explicitly and exhaustively attributing Taylor terms to the corresponding features. Based on these postulates, we analyze existing post-hoc model-agnostic LA methods and identify a fundamental tension between principled attribution and adaptation toward user-defined utilities. To address this challenge, TaylorPODA introduces a controllable allocation mechanism for Taylor interaction effects, enabling attribution results to adapt to downstream objectives while preserving the proposed postulates. Furthermore, although developed from a Taylor-expansion perspective, TaylorPODA also admits a Harsanyi-dividend interpretation, allowing the attribution mechanism to extend beyond model differentiability. Theoretical analysis demonstrates that TaylorPODA satisfies all the proposed postulates together with an additional adaptation property. Empirical results across multiple datasets and both differentiable and non-differentiable models further show that TaylorPODA achieves consistently improved alignment with user-defined utilities while maintaining the communicability of the resulting explanations. Overall, this work provides a starting point toward more trustworthy XAI systems for the deployment of increasingly powerful yet opaque task models.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 16 of its 41 references that are in the map. First posted on arXiv 14 Jul 2025.

Builds on

16 of 41 references.

References · 16

  1. 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
  2. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  3. 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
  4. 2017Axiomatic Attribution for Deep Networkscited by 3,350
  5. 2013Visualizing and Understanding Convolutional Networkscited by 2,278
  6. 2018All Models are Wrong, but Many are Useful: Learning a Variable's Importance by Studying an Entire Class of Prediction Models Simultaneouslycited by 364
  7. 2019Explaining individual predictions when features are dependent: More accurate approximations to Shapley valuescited by 205
  8. 2019The Shapley Taylor Interaction Indexcited by 143
  9. 2021FastSHAP: Real-Time Shapley Value Estimationcited by 123
  10. 2019Asymmetric Shapley values: incorporating causal knowledge into model-agnostic explainabilitycited by 114
  11. 2023A Perspective on Explainable Artificial Intelligence Methods: SHAP and LIMEcited by 42
  12. 2013Correlation and variable importance in random forestscited by 41
4 more
  1. 2022WeightedSHAP: analyzing and improving Shapley based feature attributionscited by 36
  2. 2023Does a Neural Network Really Encode Symbolic Concepts?cited by 27
  3. 2021Rational Shapley Valuescited by 18
  4. 2021Explainable Deep Learning in Healthcare: A Methodological Survey from an Attribution Viewcited by 15

Built on by

Not cited yet.