The Shapley-Taylor index decomposes a model's prediction into additive components representing the marginal contribution of individual features and their interactions up to a specified order k. It extends the standard Shapley value, which captures only first-order effects, by applying a truncated Taylor expansion to the coalitional game theory value function. This allows an analyst to explicitly attribute credit not just to a single feature, but to a specific pair or triplet of features working in concert.
Glossary
Shapley-Taylor Index

What is Shapley-Taylor Index?
The Shapley-Taylor index is a generalization of SHAP values that quantifies the importance of feature interactions of any specified order for a model prediction.
Computing the index involves summing over all subsets of features of size less than or equal to k, using discrete derivatives to isolate the pure interaction effect. A Shapley-Taylor interaction index of order 2, for instance, captures pairwise synergies that a standard additive explanation would miss. This provides a rigorous, axiomatically justified method for auditing complex, non-linear dependencies in black-box models.
Key Properties of the Shapley-Taylor Index
The Shapley-Taylor Index generalizes SHAP values to quantify the importance of feature interactions of any specified order, providing a rigorous game-theoretic decomposition of a model's prediction into main effects and higher-order synergies.
Interaction Index Definition
The Shapley-Taylor index distributes credit among all subsets of features of size k rather than just individual features. For a given order k, it computes the fair allocation of the model's output to each k-way interaction by applying the Shapley value formula to the lattice of feature subsets. This generalizes the standard SHAP value, which is the order-1 Shapley-Taylor index, to capture pairwise synergies (k=2), three-way interactions (k=3), and beyond.
Efficiency Over Interactions
A fundamental property of the Shapley-Taylor index is that the sum of all interaction effects across all orders exactly equals the model's prediction minus the baseline. Formally, summing the attributions for all subsets of size 1 through d (where d is the total number of features) reconstructs the full model output. This guarantees a complete and lossless decomposition of the prediction into main effects and interaction effects of increasing complexity.
Interaction Faithfulness
The Shapley-Taylor index satisfies an interaction faithfulness axiom: if a model's output can be perfectly represented as a sum of functions depending on at most k features, then all interaction indices for orders greater than k are exactly zero. This property ensures the index does not hallucinate spurious high-order interactions when the model's decision function is inherently simpler, providing a truthful representation of the model's interaction structure.
Recursive Computation
The Shapley-Taylor index can be computed recursively from lower-order indices. The order-k interaction effect for a feature set S is derived by taking the discrete derivative of the model's prediction with respect to S and subtracting all lower-order effects that are subsumed within S. This recursive structure mirrors the Möbius inversion on the Boolean lattice and ensures that each interaction index captures only the pure k-way synergy not explained by any subset of the interacting features.
Relationship to ANOVA Decomposition
The Shapley-Taylor index is closely related to the functional ANOVA decomposition of a model. While ANOVA decomposes a function into orthogonal components of increasing interaction order under a uniform input distribution, the Shapley-Taylor index weights these components by Shapley-style coalitional coefficients. This weighting ensures the decomposition satisfies the efficiency and symmetry axioms of cooperative game theory, making it more robust for feature attribution than standard ANOVA.
Computational Complexity
Computing the exact Shapley-Taylor index for all interactions of order k requires evaluating the model on O(d^k) subsets in the worst case, where d is the number of features. For pairwise interactions (k=2), this scales quadratically with the number of features. Practical implementations use sampling approximations and leverage the recursive structure to reduce the number of model evaluations, trading exactness for tractability in high-dimensional settings.
Shapley-Taylor Index vs. SHAP Interaction Values
Comparing the Shapley-Taylor Index, which quantifies feature interactions of any specified order, against standard pairwise SHAP Interaction Values.
| Feature | Shapley-Taylor Index | SHAP Interaction Values |
|---|---|---|
Interaction Order | Arbitrary (k-order) | Pairwise (2nd-order) |
Theoretical Foundation | Generalized Shapley values with Taylor expansion | Shapley interaction index |
Captures 3-way interactions | ||
Captures pairwise interactions | ||
Computational Complexity | O(2^n) exact; sampling approximations available | O(n^2) for TreeSHAP; higher for model-agnostic |
Efficiency Property | Satisfies k-order efficiency | Satisfies interaction-level efficiency |
Primary Use Case | Identifying complex multi-feature synergies | Visualizing pairwise feature dependencies |
Output Granularity | Interaction tensors of specified order | Symmetric interaction matrix |
Frequently Asked Questions
Clear, technically precise answers to the most common questions about the Shapley-Taylor interaction index and its role in model explainability.
The Shapley-Taylor Index is a feature attribution method that generalizes the Shapley value to quantify the importance of interactions among any specified number of features, not just individual contributions. While standard SHAP values decompose a prediction into the additive sum of single-feature effects, the Shapley-Taylor index decomposes the prediction into a sum of effects attributed to all feature subsets up to a chosen interaction order k. It does this by applying a truncated Taylor expansion to the discrete set function representing the model, distributing credit according to the discrete derivatives (or interaction effects) of that function. This provides a principled, game-theoretic allocation of importance to feature pairs, triplets, and higher-order coalitions, offering a more complete picture of a model's decision logic than marginal, single-feature attributions alone.
Enabling Efficiency, Speed & Accuracy
Intelligent Analysis, Decision & Execution
We build AI systems for teams that need search across company data, workflow automation across tools, or AI features inside products and internal software.
Talk to Us
Search across company data
Give teams answers from docs, tickets, runbooks, and product data with sources and permissions.
Useful when people spend too long searching or get different answers from different systems.

Automate internal workflows
Use AI to route work, draft outputs, trigger actions, and keep approvals and logs in place.
Useful when repetitive work moves across multiple tools and teams.

Add AI to products and internal tools
Build assistants, guided actions, or decision support into the software your team or customers already use.
Useful when AI needs to be part of the product, not a separate tool.
Related Terms
The Shapley-Taylor index generalizes SHAP to quantify interactions among any specified number of features. These related concepts form the theoretical and practical foundation for understanding and computing feature interactions.
SHAP Interaction Values
A direct extension of SHAP that captures pairwise feature interaction effects by distributing credit among all pairs of features. Unlike the Shapley-Taylor index, which handles interactions of any order, standard SHAP interaction values decompose a prediction into a matrix of main effects and second-order interactions. The sum of all main effects and interactions equals the difference between the prediction and the baseline.
- Computed by applying the Shapley value to pairs of features
- Requires O(2^M) model evaluations for M features
- Visualized using dependence plots with interaction coloring
Discrete Derivative
The mathematical operator at the core of the Shapley-Taylor interaction index. For a set of features A, the discrete derivative Δ_A f(S) measures the change in the model's output when all features in A are added to coalition S simultaneously. The Shapley-Taylor index of order k is a weighted average of these discrete derivatives over all coalitions.
- Generalizes the marginal contribution concept
- For k=1, reduces to the standard Shapley value
- For k=2, captures pairwise synergies beyond additive effects
- Higher-order derivatives reveal complex feature interdependencies
Efficiency Property
A fundamental Shapley axiom ensuring that the sum of all attributions exactly equals the difference between the model's prediction and the baseline value. For the Shapley-Taylor index, the efficiency property generalizes: the sum of all interaction indices across all subsets of features up to order k, weighted appropriately, reconstructs the total model output.
- Guarantees complete decomposition of the prediction
- Prevents unexplained residual variance
- Essential for audit and compliance scenarios
- Mathematically: Σ_{A⊆N, |A|≤k} I_A = f(x) - E[f(X)]
Global Feature Importance
A measure of overall feature impact derived by aggregating absolute SHAP values across all instances. For interaction analysis, global importance can be extended to rank feature tuples by their average Shapley-Taylor interaction index magnitude. This reveals which feature combinations consistently drive model behavior across the dataset.
- Computed as mean(|SHAP value|) per feature
- Interaction importance: mean(|I_A|) for feature set A
- Identifies systematic synergies vs. instance-specific interactions
- Used to prune irrelevant feature combinations in high-dimensional data

About the author
Prasad Kumkar
CEO & MD, Inference Systems
Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.
His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.
Partnered with leading AI, data, and software stack.
How We Work
Custom AI workflows for your Business
One-fit-all AI don't work for modern businesses. At Inferensys, we aim to understand your business & custom requirements; which we use to define most efficient agentic workflows, the data, and the tools for your business.
01
Review the use case
We understand the task, the users, and where AI can actually help.
Read more02
Pick the right approach
We define what needs search, automation, or product integration.
Read more03
Build the first useful version
We implement the part that proves the value first.
Read more04
Improve from there
We add the checks and visibility needed to keep it useful.
Read moreThe first call is a practical review of your use case and the right next step.
Talk to Us