4 citations · 4 across the 3 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
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…
cs.LG2020★ 4 cited
Distance and Equivalence between Finite State Machines and Recurrent Neural Networks: Computational results
Reda Marzouk, Colin de la Higuera
The need of interpreting Deep Learning (DL) models has led, during the past years, to a proliferation of works concerned by this issue. Among strategies which aim at shedding some…