Robust-by-Design Classification via Unitary-Gradient Neural Networks
Not on the map. Why?
Abstract (arXiv)
The use of neural networks in safety-critical systems requires safe and robust models, due to the existence of adversarial attacks. Knowing the minimal adversarial perturbation of any input x, or, equivalently, knowing the distance of x from the classification boundary, allows evaluating the classification robustness, providing certifiable predictions. Unfortunately, state-of-the-art techniques for computing such a distance are computationally expensive and hence not suited for online applications. This work proposes a novel family of classifiers, namely Signed Distance Classifiers (SDCs), that, from a theoretical perspective, directly output the exact distance of x from the classification boundary, rather than a probability score (e.g., SoftMax). SDCs represent a family of robust-by-design classifiers. To practically address the theoretical requirements of a SDC, a novel network architecture named Unitary-Gradient Neural Network is presented. Experimental results show that the proposed architecture approximates a signed distance classifier, hence allowing an online certifiable classification of x at the cost of a single inference.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 32 of its 40 references that are in the map. First posted on arXiv 9 Sep 2022.
Builds on
32 of 40 references.
References · 32
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2013Intriguing properties of neural networkscited by 5,114
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
- 2018Spectral Normalization for Generative Adversarial Networkscited by 1,618
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
- 2015DeepFool: a simple and accurate method to fool deep neural networkscited by 1,315
- 2016Real-Time Single Image and Video Super-Resolution Using an Efficient Sub-Pixel Convolutional Neural Networkcited by 1,199
- 2017Evasion Attacks against Machine Learning at Test Timecited by 686
- 2017Wild Patterns: Ten Years After the Rise of Adversarial Machine Learningcited by 411
20 more
- 2017Parseval Networks: Improving Robustness to Adversarial Examplescited by 288
- 2018Sorting out Lipschitz function approximationcited by 211
- 2018Lipschitz-Margin Training: Scalable Certification of Perturbation Invariance for Deep Neural Networkscited by 193
- 2017Formal Guarantees on the Robustness of a Classifier against Adversarial Manipulationcited by 182
- 2018Evaluating the Robustness of Neural Networks: An Extreme Value Theory Approachcited by 181
- 2018Scaling provable adversarial defensescited by 141
- 2019Orthogonal Convolutional Neural Networkscited by 122
- 2018Decoupling Direction and Norm for Efficient Gradient-Based L2 Adversarial Attacks and Defensescited by 109
- 2021Orthogonalizing Convolutional Layers with the Cayley Transformcited by 105
- 2019Preventing Gradient Attenuation in Lipschitz Constrained Convolutional Networkscited by 86
- 2019Orthogonal Deep Neural Networkscited by 72
- 2021Skew Orthogonal Convolutionscited by 67
- 2021Training Certifiably Robust Neural Networks with Efficient Local Lipschitz Boundscited by 64
- 2021Fast Minimum-norm Adversarial Attacks through Adaptive Norm Constraintscited by 50
- 2021Improved deterministic l2 robustness on CIFAR-10 and CIFAR-100cited by 47
- 2020Augmented Lagrangian Adversarial Attackscited by 28
- 2020Achieving robustness in classification using optimal transport with hinge regularizationcited by 27
- 2016Norm-preserving Orthogonal Permutation Linear Unit Activation Functions (OPLU)cited by 15
- 2021Increasing the Confidence of Deep Neural Networks by Coverage Analysiscited by 9
- 2022On the Minimal Adversarial Perturbation for Deep Neural Networks with Provable Estimation Errorcited by 6
Built on by
Citing papers per year: 2023: 3; 2024: 1.
4 papers.
- 20231-Lipschitz Layers Compared: Memory, Speed, and Certifiable Robustnesscited by 15
- 2023Robust One-Class Classification with Signed Distance Function using 1-Lipschitz Neural Networkscited by 10
- 2024Analyzing Neural Network Robustness Using Graph Curvaturecited by 2
- 20231-Lipschitz Neural Networks are more expressive with N-Activationscited by 1
- 2024Analyzing Neural Network Robustness Using Graph Curvature25 Oct 2024
- 20231-Lipschitz Layers Compared: Memory, Speed, and Certifiable Robustness28 Nov 2023
- 20231-Lipschitz Neural Networks are more expressive with N-Activations10 Nov 2023
- 2023Robust One-Class Classification with Signed Distance Function using 1-Lipschitz Neural Networks26 Jan 2023