Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2402.09947 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910665729376256 |
|---|---|
| author | Franceschi, Luca Donini, Michele Archambeau, Cédric Seeger, Matthias |
| author_facet | Franceschi, Luca Donini, Michele Archambeau, Cédric Seeger, Matthias |
| contents | A large branch of explainable machine learning is grounded in cooperative game theory. However, research indicates that game-theoretic explanations may mislead or be hard to interpret. We argue that often there is a critical mismatch between what one wishes to explain (e.g. the output of a classifier) and what current methods such as SHAP explain (e.g. the scalar probability of a class). This paper addresses such gap for probabilistic models by generalising cooperative games and value operators. We introduce the distributional values, random variables that track changes in the model output (e.g. flipping of the predicted class) and derive their analytic expressions for games with Gaussian, Bernoulli and Categorical payoffs. We further establish several characterising properties, and show that our framework provides fine-grained and insightful explanations with case studies on vision and language models. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_09947 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Explaining Probabilistic Models with Distributional Values Franceschi, Luca Donini, Michele Archambeau, Cédric Seeger, Matthias Machine Learning A large branch of explainable machine learning is grounded in cooperative game theory. However, research indicates that game-theoretic explanations may mislead or be hard to interpret. We argue that often there is a critical mismatch between what one wishes to explain (e.g. the output of a classifier) and what current methods such as SHAP explain (e.g. the scalar probability of a class). This paper addresses such gap for probabilistic models by generalising cooperative games and value operators. We introduce the distributional values, random variables that track changes in the model output (e.g. flipping of the predicted class) and derive their analytic expressions for games with Gaussian, Bernoulli and Categorical payoffs. We further establish several characterising properties, and show that our framework provides fine-grained and insightful explanations with case studies on vision and language models. |
| title | Explaining Probabilistic Models with Distributional Values |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2402.09947 |