<-- Go back

The Computational Complexity of Understanding Binary Classifier Decisions

by Stephan Wäldchen, Jan Macdonald, Sascha Hauch, Gitta Kutyniok




JAIR, Vol. 70


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 probability δ. This is motivated by the task of interpreting predictions of binary classifiers described as Boolean circuits, which can be seen as special cases of neural networks.


Read the paper

Additional Information

Brief introduction of the dida co-author(s) and relevance for dida's ML developments.

About the Co-Author

During his studies in mathematics (TU Berlin) Jan focussed on applied topics in optimization, functional analysis, and image processing. His doctoral studies (TU Berlin) explored the interplay between theoretical and empirical research on neural networks. This resulted in his PhD thesis investigating the reliability of deep learning for imaging and computer vision tasks in terms of interpretability, robustness, and accuracy. At dida he works as a Machine Learning Researcher at the interface of scientific research and software development.