Friedman's H-statistic
If there is no interaction we can decompose the PDP into
PDjk(xj,xk)=PDj(xj)+PDk(xk)
and the prediction function into
f^(x)=PDj(xj)+PD−j(x−j).
Here −j means all features that are not j.
The two statistics are
Hjk2=∑i=1nPDjk2(xj(i),xk(i))∑i=1n[PDjk(xj(i),xk(i))−PDj(xj(i))−PDk(xk(i))]2
(interaction of feature j with k)
and
Hj2=∑i=1nf^2(x(i))∑i=1n[f^(x(i))−PDj(xj(i))−PD−j(x−j(i))]2
(interaction of feature j with all other features).
The statistic is expensive to evaluate, it takes 2n2 and 3n2 calls to the model.
Examples

Pros
- underlying theory
- meaningful interpretation
- dimensionless (comparable across features and models)
- detects all interactions
- arbitrarily high interactions
Cons
- computationally expensive
- estimates have variance
- no test for strong enough interaction
- same as PDP → Correlation can lead to high values