7 papers
Fractal Gadgets for Neural Networks: The Complexity of the Narrow Regime
Olivier Bournez, Johanne Cohen, Laura Cohen +1
We study the verification problem for deep narrow ReLU neural networks: given a network of bounded width computing a piecewise-affine map on [0,1], does some input satisfy a prescr…
Security Properties of Neural Networks as Decision Problems
Adrian Wurm
Certifying a deployed neural network raises decision problems that the verification literature has not classified: whether the model carries a backdoor planted in its training data…
Checking extracted rules in Neural Networks
Adrian Wurm
In this paper we investigate formal verification of extracted rules for Neural Networks under a complexity theoretic point of view. A rule is a global property or a pattern concern…
Some structural complexity results for
Klaus Meer, Adrian Wurm
The complexity class , standing for the complexity of deciding the existential first order theory of the reals as real closed field in the Turing model, has raise…
On Hybrid Gene Regulatory Networks
Adrian Wurm, Honglu Sun
In this work, we study a class of hybrid dynamical systems called hybrid gene regulatory networks (HGRNs) which was proposed to model gene regulatory networks. In HGRNs, there exis…
Robustness Verifcation in Neural Networks
Adrian Wurm
In this paper we investigate formal verification problems for Neural Network computations. Of central importance will be various robustness and minimization problems such as: Given…
Complexity of Reachability Problems in Neural Networks
Adrian Wurm
In this paper we investigate formal verification problems for Neural Network computations. Various reachability problems will be in the focus, such as: Given symbolic specification…