On the Complexity of SHAP-Score-Based Explanations: Tractability via
Knowledge Compilation and Non-Approximability Results

On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results

16 April 2021

Leopoldo Bertossi

Papers citing "On the Complexity of SHAP-Score-Based Explanations: Tractability via Knowledge Compilation and Non-Approximability Results"

6 / 6 papers shown

Title
Feature Relevancy, Necessity and Usefulness: Complexity and Algorithms Tomás Capdevielle Santiago Cifuentes FAtt 45 0 0 06 May 2025
On the Complexity of Global Necessary Reasons to Explain Classification M. Calautti Enrico Malizia Cristian Molinaro FAtt 63 0 0 12 Jan 2025
Attribution-Scores and Causal Counterfactuals as Explanations in Artificial Intelligence Leopoldo Bertossi XAI CML 31 5 0 06 Mar 2023
Logic-Based Explainability in Machine Learning Sasha Rubin LRM XAI 50 39 0 24 Oct 2022
A Multilinear Sampling Algorithm to Estimate Shapley Values Ramin Okhrati Aldo Lipani TDI FAtt 80 38 0 22 Oct 2020
Causality-based Explanation of Classification Outcomes Leopoldo Bertossi Jordan Li Maximilian Schleich Dan Suciu Zografoula Vagena XAI CML FAtt 150 46 0 15 Mar 2020