InconsistentKernelSHAPIQ

Faster variant of KernelSHAPIQ that does not converge to true SII, using InconsistentKernelSHAPIQ.

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 k-SII values

approximator = shapiq.InconsistentKernelSHAPIQ(n=N_PLAYERS, max_order=2, random_state=42)
iv = approximator.approximate(BUDGET, game_fun)
print(iv)

InteractionValues(
    index=k-SII, max_order=2, min_order=0, estimated=True, estimation_budget=200,
    n_players=8, baseline_value=0.0,
    Top 10 interactions:
        (0, 1): 0.5000000000000002
        (0,): 0.4000000000000001
        (1,): 0.2999999999999989
        (2,): 0.199999999999998
        (3,): 0.0999999999999989
        (4,): 0.049999999999998254
        (3, 4): 7.363235009362746e-16
        (5,): -0.10000000000000149
        (6,): -0.20000000000000173
        (7,): -0.3000000000000015
)

Force plot

iv.plot_force(feature_names=feature_names)

Network plot

iv.plot_network(feature_names=feature_names)