Towards Fast Computation of Certified Robustness for ReLU Networks

@inproceedings{Hardness2018TowardsFC,
  title={Towards Fast Computation of Certified Robustness for ReLU Networks},
  author={A. Hardness},
  year={2018}
}
  • A. Hardness
  • Published 2018
In this section we show that finding the minimum adversarial distortion with a certified approximation ratio is hard. We first introduce some basic definitions and theorems in Section A.1. We provide some backgrounds about in-approximability reduction in Section A.2. Section A.3 gives a warmup proof for boolean case and then Section A.4 provides the proof of our main hardness result (for network with real inputs). 
Highly Cited
This paper has 25 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 18 extracted citations

Similar Papers

Loading similar papers…