Universal Lipschitz Approximation in Bounded Depth Neural Networks
Not on the map. Why?
Abstract (arXiv)
Adversarial attacks against machine learning models are a rather hefty obstacle to our increasing reliance on these models. Due to this, provably robust (certified) machine learning models are a major topic of interest. Lipschitz continuous models present a promising approach to solving this problem. By leveraging the expressive power of a variant of neural networks which maintain low Lipschitz constants, we prove that three layer neural networks using the FullSort activation function are Universal Lipschitz function Approximators (ULAs). This both explains experimental results and paves the way for the creation of better certified models going forward. We conclude by presenting experimental results that suggest that ULAs are a not just a novelty, but a competitive approach to providing certified classifiers, using these results to motivate several potential topics of further research.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Apr 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 3; 2023: 3; 2024: 1.
11 papers.
- 2021Globally-Robust Neural Networkscited by 106
- 2022Rethinking Lipschitz Neural Networks and Certified Robustness: A Boolean Function Perspectivecited by 48
- 2021Towards Certifying L-infinity Robustness using Neural Networks with L-inf-dist Neuronscited by 40
- 2023Performance Scaling via Optimal Transport: Enabling Data Selection from Partially Revealed Sourcescited by 16
- 2022Approximation of Lipschitz Functions using Deep Spline Neural Networkscited by 15
- 2021Learning Security Classifiers with Verified Global Robustness Propertiescited by 14
- 2021Universal Approximation of Residual Flows in Maximum Mean Discrepancycited by 7
- 2024Novel Quadratic Constraints for Extending LipSDP beyond Slope-Restricted Activationscited by 6
- 2022Universal Time-Uniform Trajectory Approximation for Random Dynamical Systems with Recurrent Neural Networkscited by 1
- 2023Data Topology-Dependent Upper Bounds of Neural Network Widthscited by 1
- 20231-Lipschitz Neural Networks are more expressive with N-Activationscited by 1
- 2024Novel Quadratic Constraints for Extending LipSDP beyond Slope-Restricted Activations25 Jan 2024
- 20231-Lipschitz Neural Networks are more expressive with N-Activations10 Nov 2023
- 2023Performance Scaling via Optimal Transport: Enabling Data Selection from Partially Revealed Sources5 Jul 2023
- 2023Data Topology-Dependent Upper Bounds of Neural Network Widths25 May 2023
- 2022Universal Time-Uniform Trajectory Approximation for Random Dynamical Systems with Recurrent Neural Networks15 Nov 2022
- 2022Rethinking Lipschitz Neural Networks and Certified Robustness: A Boolean Function Perspective4 Oct 2022
- 2022Approximation of Lipschitz Functions using Deep Spline Neural Networks13 Apr 2022
- 2021Learning Security Classifiers with Verified Global Robustness Properties24 May 2021
- 2021Universal Approximation of Residual Flows in Maximum Mean Discrepancy10 Mar 2021
- 2021Globally-Robust Neural Networks16 Feb 2021
- 2021Towards Certifying L-infinity Robustness using Neural Networks with L-inf-dist Neurons10 Feb 2021