Efficiently Training Low-Curvature Neural Networks
Not on the map. Why?
Abstract (arXiv)
The highly non-linear nature of deep neural networks causes them to be susceptible to adversarial examples and have unstable gradients which hinders interpretability. However, existing methods to solve these issues, such as adversarial training, are expensive and often sacrifice predictive accuracy. In this work, we consider curvature, which is a mathematical quantity which encodes the degree of non-linearity. Using this, we demonstrate low-curvature neural networks (LCNNs) that obtain drastically lower curvature than standard models while exhibiting similar predictive performance, which leads to improved robustness and stable gradients, with only a marginally increased training time. To achieve this, we minimize a data-independent upper bound on the curvature of a neural network, which decomposes overall curvature in terms of curvatures and slopes of its constituent layers. To efficiently minimize this bound, we introduce two novel architectural components: first, a non-linearity called centered-softplus that is a stable variant of the softplus non-linearity, and second, a Lipschitz-constrained batch normalization layer. Our experiments show that LCNNs have lower curvature, more stable gradients and increased off-the-shelf adversarial robustness when compared to their standard high-curvature counterparts, all without affecting predictive performance. Our approach is easy to use and can be readily incorporated into existing neural network models.
Key facts. Cited by 19 papers in the map (data through 14 Oct 2026). Builds on 31 of its 43 references that are in the map. First posted on arXiv 14 Jun 2022.
Builds on
31 of 43 references.
References · 31
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2022Hierarchical Text-Conditional Image Generation with CLIP Latentscited by 6,585
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
- 2013Intriguing properties of neural networkscited by 5,155
- 2018Spectral Normalization for Generative Adversarial Networkscited by 1,636
- 2020Reliable evaluation of adversarial robustness with an ensemble of diverse parameter-free attackscited by 1,451
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,340
- 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,268
- 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 744
- 2019Square Attack: a query-efficient black-box adversarial attack via random searchcited by 685
19 more
- 2020RobustBench: a standardized adversarial robustness benchmarkcited by 661
- 2020Underspecification Presents Challenges for Credibility in Modern Machine Learningcited by 496
- 2017Sharp Minima Can Generalize For Deep Netscited by 466
- 2017Interpretation of Neural Networks is Fragilecited by 444
- 2018Lipschitz regularity of deep neural networks: analysis and efficient estimationcited by 415
- 2018Regularisation of Neural Networks by Enforcing Lipschitz Continuitycited by 314
- 2017Parseval Networks: Improving Robustness to Adversarial Examplescited by 293
- 2017Improving the Adversarial Robustness and Interpretability of Deep Neural Networks by Regularizing their Input Gradientscited by 236
- 2019Explanations can be manipulated and geometry is to blamecited by 216
- 2019Plug-and-Play Methods Provably Converge with Properly Trained Denoiserscited by 198
- 2017Formal Guarantees on the Robustness of a Classifier against Adversarial Manipulationcited by 185
- 2018Robustness via curvature regularization, and vice versacited by 175
- 2019Adversarial Robustness through Local Linearizationcited by 146
- 2016Technical Report on the CleverHans v2.1.0 Adversarial Examples Librarycited by 124
- 2021Orthogonalizing Convolutional Layers with the Cayley Transformcited by 105
- 2018Interpretable Deep Learning under Firecited by 74
- 2020Towards Robust Explanations for Deep Neural Networkscited by 43
- 2020Second-Order Provable Defenses against Adversarial Attackscited by 40
- 2019Fantastic Four: Differentiable Bounds on Singular Values of Convolution Layerscited by 6
Built on by
Citing papers per year: 2023: 7; 2024: 7; 2025: 4; 2026: 1.
19 papers.
Sort:
By area:
- 2023Protein Design with Guided Discrete Diffusioncited by 157
- 2024SparseCraft: Few-Shot Neural Reconstruction through Stereopsis Guided Geometric Linearizationcited by 19
- 2023Partial Counterfactual Identification of Continuous Outcomes with a Curvature Sensitivity Modelcited by 14
- 2024Gradient-Regularized Out-of-Distribution Detectioncited by 13
- 2023Towards Bridging the Gaps between the Right to Explanation and the Right to be Forgottencited by 10
- 2023Scalable Stochastic Gradient Riemannian Langevin Dynamics in Non-Diagonal Metricscited by 8
- 2024Efficient local linearity regularization to overcome catastrophic overfittingcited by 8
- 2024Characterizing Model Robustness via Natural Input Gradientscited by 6
- 2024Compositional Curvature Bounds for Deep Neural Networkscited by 4
- 2025Curvature Tuning: Provable Training-free Model Steering From a Single Parametercited by 4
- 2023On Minimizing the Impact of Dataset Shifts on Actionable Explanationscited by 3
- 2023Characterizing Data Point Vulnerability via Average-Case Robustnesscited by 3
7 more
- 2024Verified Training for Counterfactual Explanation Robustness under Data Shiftcited by 2
- 2025Can Hessian-Based Insights Support Fault Diagnosis in Attention-based Models?cited by 2
- 2025Informative Post-Hoc Explanations Only Exist for Simple Functionscited by 2
- 2023Revisiting DeepFool: generalization and improvementcited by 1
- 2024Deep Submodular Peripteral Networkscited by 1
- 2025Catastrophic Overfitting, Entropy Gap and Participation Ratio: A Noiseless lp Norm Solution for Fast Adversarial Trainingcited by 1
- 2026Disentangling Optimization Scale from Preference Scale in DPOcited by 0
- 2026Disentangling Optimization Scale from Preference Scale in DPO27 Aug 2026
- 2025Informative Post-Hoc Explanations Only Exist for Simple Functions15 Aug 2025
- 2025Can Hessian-Based Insights Support Fault Diagnosis in Attention-based Models?9 Jun 2025
- 2025Catastrophic Overfitting, Entropy Gap and Participation Ratio: A Noiseless lp Norm Solution for Fast Adversarial Training5 May 2025
- 2025Curvature Tuning: Provable Training-free Model Steering From a Single Parameter11 Feb 2025
- 2024Characterizing Model Robustness via Natural Input Gradients30 Sep 2024
- 2024SparseCraft: Few-Shot Neural Reconstruction through Stereopsis Guided Geometric Linearization19 Jul 2024
- 2024Compositional Curvature Bounds for Deep Neural Networks7 Jun 2024
- 2024Gradient-Regularized Out-of-Distribution Detection18 Apr 2024
- 2024Deep Submodular Peripteral Networks13 Mar 2024
- 2024Verified Training for Counterfactual Explanation Robustness under Data Shift6 Mar 2024
- 2024Efficient local linearity regularization to overcome catastrophic overfitting21 Jan 2024
7 more
- 2023Characterizing Data Point Vulnerability via Average-Case Robustness26 Jul 2023
- 2023On Minimizing the Impact of Dataset Shifts on Actionable Explanations11 Jun 2023
- 2023Partial Counterfactual Identification of Continuous Outcomes with a Curvature Sensitivity Model2 Jun 2023
- 2023Protein Design with Guided Discrete Diffusion31 May 2023
- 2023Revisiting DeepFool: generalization and improvement22 Mar 2023
- 2023Scalable Stochastic Gradient Riemannian Langevin Dynamics in Non-Diagonal Metrics9 Mar 2023
- 2023Towards Bridging the Gaps between the Right to Explanation and the Right to be Forgotten8 Feb 2023
- 2023Protein Design with Guided Discrete Diffusioncited by 157
- 2023Protein Design with Guided Discrete Diffusion31 May 2023
- 2024SparseCraft: Few-Shot Neural Reconstruction through Stereopsis Guided Geometric Linearizationcited by 19
- 2023Partial Counterfactual Identification of Continuous Outcomes with a Curvature Sensitivity Modelcited by 14
- 2024Gradient-Regularized Out-of-Distribution Detectioncited by 13
- 2023Towards Bridging the Gaps between the Right to Explanation and the Right to be Forgottencited by 10
- 2023Scalable Stochastic Gradient Riemannian Langevin Dynamics in Non-Diagonal Metricscited by 8
- 2024Efficient local linearity regularization to overcome catastrophic overfittingcited by 8
- 2024Characterizing Model Robustness via Natural Input Gradientscited by 6
- 2024Compositional Curvature Bounds for Deep Neural Networkscited by 4
- 2025Curvature Tuning: Provable Training-free Model Steering From a Single Parametercited by 4
- 2023On Minimizing the Impact of Dataset Shifts on Actionable Explanationscited by 3
- 2023Characterizing Data Point Vulnerability via Average-Case Robustnesscited by 3
- 2024Verified Training for Counterfactual Explanation Robustness under Data Shiftcited by 2
12 most cited of 17 All 17 (JSON)
- 2025Informative Post-Hoc Explanations Only Exist for Simple Functions15 Aug 2025
- 2025Can Hessian-Based Insights Support Fault Diagnosis in Attention-based Models?9 Jun 2025
- 2025Catastrophic Overfitting, Entropy Gap and Participation Ratio: A Noiseless lp Norm Solution for Fast Adversarial Training5 May 2025
- 2025Curvature Tuning: Provable Training-free Model Steering From a Single Parameter11 Feb 2025
- 2024Characterizing Model Robustness via Natural Input Gradients30 Sep 2024
- 2024SparseCraft: Few-Shot Neural Reconstruction through Stereopsis Guided Geometric Linearization19 Jul 2024
- 2024Compositional Curvature Bounds for Deep Neural Networks7 Jun 2024
- 2024Gradient-Regularized Out-of-Distribution Detection18 Apr 2024
- 2024Deep Submodular Peripteral Networks13 Mar 2024
- 2024Verified Training for Counterfactual Explanation Robustness under Data Shift6 Mar 2024
- 2024Efficient local linearity regularization to overcome catastrophic overfitting21 Jan 2024
- 2023Characterizing Data Point Vulnerability via Average-Case Robustness26 Jul 2023
12 newest of 17 All 17 (JSON)