Shapley Sets: Feature Attribution via Recursive Function Decomposition

Torty Sivill, Peter Flach
7/4/2023
cs.LG

No confident code implementation found for this paper.

Abstract

Despite their ubiquitous use, Shapley value feature attributions can be misleading due to feature interaction in both model and data. We propose an alternative attribution approach, Shapley Sets, which awards value to sets of features. Shapley Sets decomposes the underlying model into non-separable variable groups using a recursive function decomposition algorithm with log linear complexity in the number of variables. Shapley Sets attributes to each non-separable variable group their combined value for a particular prediction. We show that Shapley Sets is equivalent to the Shapley value over the transformed feature set and thus benefits from the same axioms of fairness. Shapley Sets is value function agnostic and we show theoretically and experimentally how Shapley Sets avoids pitfalls associated with Shapley value based alternatives and are particularly advantageous for data types with complex dependency structure.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{sivill2023shapley,
  title  = {Shapley Sets: Feature Attribution via Recursive Function Decomposition},
  author = {Torty Sivill and Peter Flach},
  year   = {2023},
  eprint = {2307.01777},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.01777v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2307.01777.svg)](https://codeofpaper.com/paper/2307.01777)

Discussion