Training Characteristic Functions with Reinforcement Learning: XAI-methods play Connect Four
Stephan Wäldchen, Sebastian Pokutta, Felix Huber
Abstract
One of the goals of Explainable AI (XAI) is to determine which input components were relevant for a classifier decision. This is commonly know as saliency attribution. Characteristic functions (from cooperative game theory) are able to evaluate partial inputs and form the basis for theoretically"fair"attribution methods like Shapley values. Given only a standard classifier function, it is unclear how partial input should be realised. Instead, most XAI-methods for black-box classifiers like neural networks consider counterfactual inputs that generally lie off-manifold. This makes them hard to evaluate and easy to manipulate. We propose a setup to directly train characteristic functions in the form of neural networks to play simple two-player games. We apply this to the game of Connect Four by randomly hiding colour information from our agents during training. This has three advantages for comparing XAI-methods: It alleviates the ambiguity about how to realise partial input, makes off-manifold evaluation unnecessary and allows us to compare the methods by letting them play against each other.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on5
- The Many Shapley Values for Model ExplanationMukund Sundararajan, Amir NajmiICML 2020 · 799 citations
- Counterfactual Explanations Can Be ManipulatedDylan Slack, Anna Hilgard, Himabindu Lakkaraju, Sameer SinghNeurIPS 2021 · 182 citations
- Shapley explainability on the data manifoldChristopher Frye, Damien de Mijolla, Tom Begley, Laurence Cowton et al.ICLR 2021 · 125 citations
- Fairwashing explanations with off-manifold detergentChristopher J. Anders, Plamen Pasliev, Ann-Kathrin Dombrowski, Klaus-Robert Müller et al.ICML 2020 · 104 citations
- Interpretable Neural Networks with Frank-Wolfe: Sparse Relevance Maps and Relevance OrderingsJan MacDonald, Mathieu Besançon, Sebastian PokuttaICML 2022 · 13 citations
Related papers
- Neural Payoff Machines: Predicting Fair and Stable Payoff Allocations Among Team MembersDaphne Cornelisse, Thomas Rood, Yoram Bachrach, Mateusz Malinowski et al.NeurIPS 2022 · 10 citations
- Rethinking Shapley Value for Negative Interactions in Non-convex GamesWonjoon Chang, Myeongjin Lee, Jaesik ChoiICLR 2025
- Towards Trustable SHAP ScoresOlivier Létoffé, Xuanxiang Huang, João Marques-SilvaAAAI 2025 · 23 citations
- A Unifying Framework to the Analysis of Interaction Methods using Synergy FunctionsDaniel Lundström, Meisam RazaviyaynICML 2023 · 4 citations
- Towards Attributions of Input Variables in a CoalitionXinhao Zheng, Huiqi Deng, Quanshi ZhangICML 2025
