LGCRMLJun 14, 2019

Towards Stable and Efficient Training of Verifiably Robust Neural Networks

arXiv:1906.06316v2389 citationsHas Code
Originality Highly original
AI Analysis

This addresses the problem of efficient and stable certified adversarial training for machine learning practitioners, representing a strong incremental improvement over existing methods.

The paper tackles the challenge of training neural networks with verifiable robustness guarantees by proposing CROWN-IBP, a method that combines fast interval bound propagation with tight linear relaxation bounds, achieving state-of-the-art verified test errors of 7.02% on MNIST and 66.94% on CIFAR-10.

Training neural networks with verifiable robustness guarantees is challenging. Several existing approaches utilize linear relaxation based neural network output bounds under perturbation, but they can slow down training by a factor of hundreds depending on the underlying network architectures. Meanwhile, interval bound propagation (IBP) based training is efficient and significantly outperforms linear relaxation based methods on many tasks, yet it may suffer from stability issues since the bounds are much looser especially at the beginning of training. In this paper, we propose a new certified adversarial training method, CROWN-IBP, by combining the fast IBP bounds in a forward bounding pass and a tight linear relaxation based bound, CROWN, in a backward bounding pass. CROWN-IBP is computationally efficient and consistently outperforms IBP baselines on training verifiably robust neural networks. We conduct large scale experiments on MNIST and CIFAR datasets, and outperform all previous linear relaxation and bound propagation based certified defenses in $\ell_\infty$ robustness. Notably, we achieve 7.02% verified test error on MNIST at $ε=0.3$, and 66.94% on CIFAR-10 with $ε=8/255$. Code is available at https://github.com/deepmind/interval-bound-propagation (TensorFlow) and https://github.com/huanzhang12/CROWN-IBP (PyTorch).

Code Implementations2 repos
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes