Automated Design of Linear Bounding Functions for Sigmoidal Nonlinearities in Neural Networks

Published: 01 Jan 2024, Last Modified: 02 Aug 2025ECML/PKDD (7) 2024EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: The ubiquity of deep learning algorithms in various applications has amplified the need for assuring their robustness against small input perturbations such as those occurring in adversarial attacks. Existing complete verification techniques offer provable guarantees for all robustness queries but struggle to scale beyond small neural networks. To overcome this computational intractability, incomplete verification methods often rely on convex relaxation to over-approximate the nonlinearities in neural networks.
Loading