Tight and Efficient Upper Bound on Spectral Norm of Convolutional Layers
Not on the map. Why?
Abstract (arXiv)
Controlling the spectral norm of the Jacobian matrix, which is related to the convolution operation, has been shown to improve generalization, training stability and robustness in CNNs. Existing methods for computing the norm either tend to overestimate it or their performance may deteriorate quickly with increasing the input and kernel sizes. In this paper, we demonstrate that the tensor version of the spectral norm of a four-dimensional convolution kernel, up to a constant factor, serves as an upper bound for the spectral norm of the Jacobian matrix associated with the convolution operation. This new upper bound is independent of the input image resolution, differentiable and can be efficiently calculated during training. Through experiments, we demonstrate how this new bound can be used to improve the performance of convolutional architectures.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 19 of its 33 references that are in the map. First posted on arXiv 18 Sep 2024.
Builds on
19 of 33 references.
References · 19
- 2018Spectral Normalization for Generative Adversarial Networkscited by 1,618
- 2018Lipschitz regularity of deep neural networks: analysis and efficient estimationcited by 413
- 2017A PAC-Bayesian Approach to Spectrally-Normalized Margin Bounds for Neural Networkscited by 309
- 2017Parseval Networks: Improving Robustness to Adversarial Examplescited by 288
- 2019Plug-and-Play Methods Provably Converge with Properly Trained Denoiserscited by 197
- 2017Spectral Norm Regularization for Improving the Generalizability of Deep Learningcited by 178
- 2018Dynamical Isometry and a Mean Field Theory of CNNs: How to Train 10,000-Layer Vanilla Convolutional Neural Networkscited by 176
- 2019Orthogonal Convolutional Neural Networkscited by 122
- 2018The Singular Values of Convolutional Layerscited by 95
- 2018Generalizable Adversarial Training via Spectral Normalizationcited by 68
- 2021Skew Orthogonal Convolutionscited by 67
- 2021A Dynamical System Perspective for Lipschitz Neural Networkscited by 59
7 more
- 2021Improved deterministic l2 robustness on CIFAR-10 and CIFAR-100cited by 47
- 2023Efficient Bound of Lipschitz Constant for Convolutional Layers by Gram Iterationcited by 19
- 2022Towards Practical Control of Singular Values of Convolutional Layerscited by 9
- 2024Spectrum Extraction and Clipping for Implicitly Linear Layerscited by 7
- 2024Spectral Norm of Convolutional Layers with Circular and Zero Paddingscited by 4
- 2017Best rank-k approximations for tensors: generalizing Eckart-Youngcited by 3
- 2018Spectral norm of a symmetric tensor and its computationcited by 3
Built on by
Citing papers per year: 2025: 4; 2026: 3.
7 papers.
- 2025An Adaptive Orthogonal Convolution Scheme for Efficient and Flexible CNN Architecturescited by 8
- 2025Improved Scalable Lipschitz Bounds for Deep Neural Networkscited by 2
- 2025On the Interaction of Compressibility and Adversarial Robustnesscited by 2
- 2025Unpaired Image-to-Image Translation for Segmentation and Signal Unmixingcited by 1
- 2026Tensorion: A Tensor-Aware Generalization of the Muon Optimizercited by 1
- 2026Orthogonium : A Unified, Efficient Library of Orthogonal and 1-Lipschitz Building Blockscited by 0
- 2026Lipschitz-Based Robustness Certification Under Floating-Point Executioncited by 0
- 2026Tensorion: A Tensor-Aware Generalization of the Muon Optimizer24 Jun 2026
- 2026Lipschitz-Based Robustness Certification Under Floating-Point Execution6 Mar 2026
- 2026Orthogonium : A Unified, Efficient Library of Orthogonal and 1-Lipschitz Building Blocks20 Jan 2026
- 2025On the Interaction of Compressibility and Adversarial Robustness23 Jul 2025
- 2025Unpaired Image-to-Image Translation for Segmentation and Signal Unmixing27 May 2025
- 2025Improved Scalable Lipschitz Bounds for Deep Neural Networks18 Mar 2025
- 2025An Adaptive Orthogonal Convolution Scheme for Efficient and Flexible CNN Architectures14 Jan 2025