On The Robustness of a Neural Network
El Mahdi El Mhamdi, Rachid Guerraoui, Sebastien Rouault

TL;DR
This paper provides a theoretical upper bound on neural network robustness to neuron failures, demonstrating that robustness can be estimated without exhaustive testing or training data access.
Contribution
It introduces a novel theoretical bound on expected output error due to neuron crashes, linking robustness to network parameters and failure depth.
Findings
The upper bound involves polynomial dependence on the Lipschitz constant.
The bound exhibits exponential dependence on the failure layer depth.
Experimental results support the theoretical predictions of robustness dependencies.
Abstract
With the development of neural networks based machine learning and their usage in mission critical applications, voices are rising against the \textit{black box} aspect of neural networks as it becomes crucial to understand their limits and capabilities. With the rise of neuromorphic hardware, it is even more critical to understand how a neural network, as a distributed system, tolerates the failures of its computing nodes, neurons, and its communication channels, synapses. Experimentally assessing the robustness of neural networks involves the quixotic venture of testing all the possible failures, on all the possible inputs, which ultimately hits a combinatorial explosion for the first, and the impossibility to gather all the possible inputs for the second. In this paper, we prove an upper bound on the expected error of the output when a subset of neurons crashes. This bound involves…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
