On the Tractability of SHAP Explanations
From MaRDI portal
Publication:5094036
DOI10.1613/JAIR.1.13283OpenAlexW3175110185MaRDI QIDQ5094036FDOQ5094036
Authors: Guy Van den Broeck, Anton Lykov, Maximilian Schleich, Dan Suciu 
Publication date: 2 August 2022
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.08634
Cites Work
- Graph-Based Algorithms for Boolean Function Manipulation
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- On probabilistic inference by weighted model counting
- Title not available (Why is that?)
- Treewidth in Verification: Local vs. Global
- Theory and Applications of Satisfiability Testing
- Title not available (Why is that?)
- A Tractable and Expressive Class of Marginal Contribution Nets and Its Applications
- Explaining individual predictions when features are dependent: more accurate approximations to Shapley values
Cited In (6)
- Using analogical proportions for explanations
- On the failings of Shapley values for explainability
- Explaining robust classification through prime implicants
- Knowledge compilation. Preface.
- Score-based explanations in data management and machine learning: an answer-set programming approach to counterfactual analysis
- Efficient computation of shap explanation scores for neural network classifiers via knowledge compilation
Uses Software
This page was built for publication: On the Tractability of SHAP Explanations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5094036)
