One model: predict only when and . One instance: . Five explainability methods from this course, all pointed at the exact same question — does or matter more here? They don't all give the same answer.
Tree importance, Shapley values, and integrated gradients, applied to the same model and the same instance. Switch between them and watch which feature comes out on top change depending on which question you asked.
Five methods, five different questions about the same :
- None of these is wrong
Each method is answering a genuinely different question about the same instance — disagreement between them isn't a bug in any one of them.
- Each draws on different information
- Tree importance reads a training dataset's split structure
- Shapley plays a coalition game over feature presence
- Integrated gradients integrates a smooth surrogate's gradient field
- PDP and anchors work directly off the raw grid itself
Shapley and integrated gradients agree perfectly — both are symmetric in and , and both split credit exactly down the middle. Tree importance doesn't: whichever feature happens to win the root split (a near-arbitrary tie here) ends up with less total credit than the feature that gets to clean up the remaining impurity deeper in the tree.
- Shapley values: perfectly symmetric
Coalition values:
Two orderings, each feature's marginal contribution depending on whether it joins first or second:
- Order : joins an empty coalition, contributing ; joins after , contributing
- Order : joins first, contributing ; joins after , contributing
Averaging each feature's two contributions:
Exactly equal, exactly summing to the total change in value ().
- Integrated gradients: also symmetric, and nearly exact
The surrogate is integrated along via a 500-step Riemann sum of at each . At the endpoint — the point itself — , giving one term of that sum, : one of 500 such terms that get averaged and scaled by . Carrying that out for both features gives , summing to — within of the surrogate's true output change, just like the completeness check from earlier in this part.
- Tree importance: the tie-break at the root cascades
Training a tree on this model's own grid gives:
- the root split (a tie with , broken arbitrarily) with gain , weighted by all 49 samples:
- 's only split happens one level deeper, on just 21 samples, at a far higher gain :
Net importance: actually edges out , despite the two features being logically interchangeable in the true rule.
Find the one method, among the three, whose verdict on x1 vs x2 disagrees with the other two.
This is the honest state of model explainability: there is no single number that "the" importance of a feature. Shapley values answer a precise, symmetric, game-theoretic question and get a clean answer here because the underlying model happens to be symmetric. Tree importance answers a different question — "what did this particular training procedure find useful, in this particular tree structure" — and that answer is sensitive to arbitrary tie-breaks in a way Shapley values structurally cannot be. Anchors and PDP — short for Partial Dependence Plot — don't rank features against each other at all; they answer their own separate questions about reliability and average behavior. Auditing a model well means running several of these, expecting some disagreement, and understanding why they disagree — not searching for the one that confirms what you already believed. This closes Part XI — Explainability, Continued. The next part turns to multimodal AI, continued: audio, video, and text-conditioned generation.