no code implementations • 28 Jul 2020 • Marcelo Arenas, Pablo Barceló Leopoldo Bertossi, Mikaël Monet
While in general computing Shapley values is a computationally intractable problem, it has recently been claimed that the SHAP-score can be computed in polynomial time over the class of decision trees.
