• The computational complexity of understanding binary classifier decisions 

      Wäldchen, Stephan; Macdonald, Jan; Hauch, Sascha; Kutyniok, Gitta Astrid Hildegard (Journal article; Tidsskriftartikkel; Peer reviewed, 2021-01-21)
      For a d-ary Boolean function Φ: {0, 1}<sup>d</sup> → {0, 1} and an assignment to its variables x = (x<sub>1</sub>, x<sub>2</sub>, . . . , x<sub>d</sub>) we consider the problem of finding those subsets of the variables that are sufficient to determine the function value with a given probability δ. This is motivated by the task of interpreting predictions of binary classifiers described as Boolean ...