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

Ben Batten, Yang Zheng, Alessandro De Palma, Panagiotis Kouvaros, Alessio Lomuscio
8/23/2024
cs.LGcs.AIcs.CV

No official code found. Best implementation: benbatten/PWL-Geometric-Verification (0 stars, last commit 2024-11-28).

Abstract

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.

View on arXivView PDF

Code Implementations(1)

01PythonAug 25, 20241 years ago

Similar Papers

Cite this paper

@article{batten2024verification,
  title  = {Verification of Geometric Robustness of Neural Networks via Piecewise Linear Approximation and Lipschitz Optimisation},
  author = {Ben Batten and Yang Zheng and Alessandro De Palma and Panagiotis Kouvaros and Alessio Lomuscio},
  year   = {2024},
  eprint = {2408.13140},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2408.13140v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2408.13140.svg)](https://codeofpaper.com/paper/2408.13140)

Discussion