LGAICVAug 23, 2024

Verification of Geometric Robustness of Neural Networks via Piecewise Linear Approximation and Lipschitz Optimisation

arXiv:2408.13140v35 citationsh-index: 41
Originality Incremental advance
AI Analysis

This addresses the need for robust neural network verification in safety-critical applications, though it is incremental as it builds on existing verification techniques.

The paper tackles the problem of verifying neural networks against geometric transformations like rotation and scaling, achieving up to 32% more resolved verification cases than current methods on MNIST and CIFAR10 benchmarks.

We address the problem of verifying neural networks against geometric transformations of the input image, including rotation, scaling, shearing, and translation. The proposed method computes provably sound piecewise linear constraints for the pixel values by using sampling and linear approximations in combination with branch-and-bound Lipschitz optimisation. The method obtains provably tighter over-approximations of the perturbation region than the present state-of-the-art. We report results from experiments on a comprehensive set of verification benchmarks on MNIST and CIFAR10. We show that our proposed implementation resolves up to 32% more verification cases than present approaches.

Code Implementations1 repo
Foundations

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

Your Notes