Interaction Tensor SHAP
Not on the map. Why?
Abstract (arXiv)
This study proposes Interaction Tensor SHAP (IT-SHAP), a tensor algebraic formulation of the Shapley Taylor Interaction Index (STII) that makes its computational structure explicit. STII extends the Shapley value to higher order interactions, but its exponential combinatorial definition makes direct computation intractable at scale. We reformulate STII as a linear transformation acting on a value function and derive an explicit algebraic representation of its weight tensor. This weight tensor is shown to possess a multilinear structure induced by discrete finite difference operators. When the value function admits a Tensor Train representation, higher order interaction indices can be computed in the parallel complexity class NC squared. In contrast, under general tensor network representations without structural assumptions, the same computation is proven to be P sharp hard. The main contributions are threefold. First, we establish an exact Tensor Train representation of the STII weight tensor. Second, we develop a parallelizable evaluation algorithm with explicit complexity bounds under the Tensor Train assumption. Third, we prove that computational intractability is unavoidable in the absence of such structure. These results demonstrate that the computational difficulty of higher order interaction analysis is determined by the underlying algebraic representation rather than by the interaction index itself, providing a theoretical foundation for scalable interpretation of high dimensional models.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 12 of its 34 references that are in the map. First posted on arXiv 5 Dec 2025.
Builds on
12 of 34 references.
References · 12
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2017Towards A Rigorous Science of Interpretable Machine Learningcited by 1,400
- 2018A Survey Of Methods For Explaining Black Box Modelscited by 970
- 2019Explaining individual predictions when features are dependent: More accurate approximations to Shapley valuescited by 205
- 2019The Shapley Taylor Interaction Indexcited by 143
- 2023SHAP-IQ: Unified Approximation of any-order Shapley Interactionscited by 50
- 2021On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Resultscited by 32
- 2021Using Shapley Values and Variational Autoencoders to Explain Predictive Models with Dependent Mixed Featurescited by 19
- 2024SVARM-IQ: Efficient Approximation of Any-order Shapley Interactions through Stratificationcited by 16
- 2025SHAP Meets Tensor Networks: Provably Tractable Explanations with Parallelismcited by 8
- 2024Efficient Leverage Score Sampling for Tensor Train Decompositioncited by 2
- 2025FINCH: Locally Visualizing Higher-Order Feature Interactions in Black Box Modelscited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.