Interaction Tensor SHAP
Hiroki Hasegawa, Yukihiko Okada

TL;DR
This paper introduces Interaction Tensor SHAP (IT-SHAP), a tensor algebraic approach to efficiently compute higher order interaction indices in model interpretability, with explicit complexity bounds and structural insights.
Contribution
It provides an exact Tensor Train representation of the Shapley Taylor Interaction Index weight tensor and develops a scalable evaluation algorithm based on this structure.
Findings
Tensor Train representation enables parallel computation of interactions.
Evaluation complexity is polynomial under Tensor Train assumptions.
Intractability persists without structural assumptions.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Quantum many-body systems · Constraint Satisfaction and Optimization
