BriefGPT.xyz
Apr, 2018
面向Relu网络的快速计算认证鲁棒性
Towards Fast Computation of Certified Robustness for ReLU Networks
HTML
PDF
Tsui-Wei Weng, Huan Zhang, Hongge Chen, Zhao Song, Cho-Jui Hsieh...
TL;DR
本文提供了两种计算和证明最小失真非平凡下界的算法Fast-Lin和Fast-Lip,可以用于解决具有ReLU结构的神经网络的鲁棒性问题。相比于现有的解决方法,这两种方法计算速度更快,下界的质量更高,同时作者还证明了除非NP=P,否则无法用多项式时间算法求解最小的l1失真。
Abstract
Verifying the robustness property of a general Rectified Linear Unit (
relu
) network is an NP-complete problem [Katz, Barrett, Dill, Julian and Kochenderfer CAV17]. Although finding the exact minimum adversarial
distorti
→