A Quantitative Geometric Approach to Neural-Network Smoothness
Zi Wang, Gautam Prakriya, Somesh Jha

TL;DR
This paper introduces a unified geometric framework for estimating neural network Lipschitz constants, revealing theoretical hardness, providing scalable algorithms, and improving precision over existing methods, with implications for network robustness.
Contribution
The paper presents a novel geometric approach to Lipschitz constant estimation, including theoretical insights and a practical SDP-based tool, GeoLIP, that outperforms existing methods.
Findings
GeoLIP is more scalable and precise than existing tools.
Theoretical results on the hardness and approximability of Lipschitz estimation.
Insights into norm transferability issues in neural network regularization.
Abstract
Fast and precise Lipschitz constant estimation of neural networks is an important task for deep learning. Researchers have recently found an intrinsic trade-off between the accuracy and smoothness of neural networks, so training a network with a loose Lipschitz constant estimation imposes a strong regularization and can hurt the model accuracy significantly. In this work, we provide a unified theoretical framework, a quantitative geometric approach, to address the Lipschitz constant estimation. By adopting this framework, we can immediately obtain several theoretical results, including the computational hardness of Lipschitz constant estimation and its approximability. Furthermore, the quantitative geometric perspective can also provide some insights into recent empirical observations that techniques for one norm do not usually transfer to another one. We also implement the algorithms…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Adversarial Robustness in Machine Learning · Advanced Optimization Algorithms Research
