KernelSHAP¶

Regression-based Shapley value approximation using KernelSHAP Lundberg and Lee[1].

from __future__ import annotations

import numpy as np

import shapiq

N_PLAYERS = 8
BUDGET = 200
feature_names = [f"x{i}" for i in range(N_PLAYERS)]

weights = np.array([0.4, 0.3, 0.2, 0.1, 0.05, -0.1, -0.2, -0.3])


def game_fun(coalitions: np.ndarray) -> np.ndarray:
    coalitions = np.atleast_2d(coalitions)
    return (coalitions @ weights) + 0.5 * coalitions[:, 0] * coalitions[:, 1]

Approximate Shapley values¶

approximator = shapiq.KernelSHAP(n=N_PLAYERS, random_state=42)
iv = approximator.approximate(BUDGET, game_fun)
print(iv)
InteractionValues(
    index=SV, max_order=1, min_order=0, estimated=True, estimation_budget=200,
    n_players=8, baseline_value=0.0,
    Top 10 interactions:
        (0,): 0.6455994993035045
        (1,): 0.5572185254509572
        (2,): 0.1823271526700617
        (3,): 0.0977694730512312
        (4,): 0.0365111506541677
        (): 0.0
        (5,): -0.09454436745679151
        (6,): -0.18585630170848302
        (7,): -0.2890251345684169
)

Visualize the result¶

iv.plot_force(feature_names=feature_names)
plot kernelshap

References¶

Total running time of the script: (0 minutes 0.290 seconds)