Algorithm uses neural network verification to compute arbitrarily tight bounds on exact SHAP values for neural networks, recovering the exact values and scaling to larger feature spaces than prior exact methods.
URL https://doi.org /10.1609/aaai.v36i5.20484
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Verified SHAP: Provable Bounds for Exact Shapley Values of Neural Networks
Algorithm uses neural network verification to compute arbitrarily tight bounds on exact SHAP values for neural networks, recovering the exact values and scaling to larger feature spaces than prior exact methods.