4 citations · 5 across the 5 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.LG2025
SHAP Meets Tensor Networks: Provably Tractable Explanations with Parallelism
Reda Marzouk, Shahaf Bassan, Guy Katz
Although Shapley additive explanations (SHAP) can be computed in polynomial time for simple models like decision trees, they unfortunately become NP-hard to compute for more expres…
cs.LG2025
On the Computational Tractability of the (Many) Shapley Values
Reda Marzouk, Shahaf Bassan, Guy Katz +1
Recent studies have examined the computational complexity of computing Shapley additive explanations (also known as SHAP) across various models and distributions, revealing their t…