Stephan Waeldchen
YOU?
Author Swipe
The Computational Complexity of Understanding Binary Classifier Decisions Open
For a d-ary Boolean function Φ: {0, 1}d → {0, 1} and an assignment to its variables x = (x1, x2, . . . , xd) we consider the problem of finding those subsets of the variables that are sufficient to determine the function value with a given…