paper-with-me

Papers

LipKernel: Lipschitz-Bounded Convolutional Neural Networks via Dissipative Layers

2024-10-29 · Patricia Pauli, Ruigang Wang, Ian Manchester, Frank Allgöwer

We propose a novel layer-wise parameterization for convolutional neural networks (CNNs) that includes built-in robustness guarantees by enforcing a prescribed Lipschitz bound. Each layer in our parameterization is designed to satisfy a linear matrix inequality (LMI), which in turn implies dissipativity with respect to a specific supply rate. Collectively, these layer-wise LMIs ensure Lipschitz boundedness for the input-output mapping of the neural network, yielding a more expressive parameterization than through spectral bounds or orthogonal layers. Our new method LipKernel directly parameterizes dissipative convolution kernels using a 2-D Roesser-type state space model. This means that the convolutional layers are given in standard form after training and can be evaluated without computational overhead. In numerical experiments, we show that the run-time using our method is orders of magnitude faster than state-of-the-art Lipschitz-bounded networks that parameterize convolutions in the Fourier domain, making our approach particularly attractive for improving robustness of learning-based real-time perception or control in robotics, autonomous vehicles, or automation systems. We focus on CNNs, and in contrast to previous works, our approach accommodates a wide variety of layers typically used in CNNs, including 1-D and 2-D convolutional layers, maximum and average pooling layers, as well as strided and dilated convolutions and zero padding. However, our approach naturally extends beyond CNNs as we can incorporate any layer that is incrementally dissipative.

📄 PDF Abstract BibTeX arXiv:2410.22258

Code (1)

ppauli/2D-LipCNNs 공식 구현 pytorch

Tasks

Autonomous Vehicles

Methods 이 논문이 사용한 방법론

Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Average Pooling 설명 없음
Focus 설명 없음

Similar Papers 제목 키워드 기반

Lipschitz-bounded 1D convolutional neural networks using the Cayley transform and the controllability Gramian

2023-03-20 · Patricia Pauli, Ruigang Wang, Ian R. Manchester, Frank Allgöwer

We establish a layer-wise parameterization for 1D convolutional neural networks (CNNs) with built-in end-to-end robustness guarantees. In doing so, we use the Lipschitz constant of the input-output mapping characterized …

1-Lipschitz Layers Compared: Memory, Speed, and Certifiable Robustness

2023-11-28 · Bernd Prach, Fabio Brau, Giorgio Buttazzo, Christoph H. Lampert

The robustness of neural networks against input perturbations with bounded magnitude represents a serious concern in the deployment of deep learning models in safety-critical systems. Recently, the scientific community h…

Uniform Convergence of Deep Neural Networks with Lipschitz Continuous Activation Functions and Variable Widths

2023-06-02 · Yuesheng Xu, Haizhang Zhang

We consider deep neural networks with a Lipschitz continuous activation function and with weight matrices of variable widths. We establish a uniform convergence analysis framework in which sufficient conditions on weight…

1-Lipschitz Layers Compared: Memory Speed and Certifiable Robustness

2024-01-01 · CVPR 2024 1 · Bernd Prach, Fabio Brau, Giorgio Buttazzo, Christoph H. Lampert

The robustness of neural networks against input perturbations with bounded magnitude represents a serious concern in the deployment of deep learning models in safety-critical systems. Recently the scientific communit…

Orthogonalizing Convolutional Layers with the Cayley Transform

2021-04-14 · ICLR 2021 1 · Asher Trockman, J. Zico Kolter

Recent work has highlighted several advantages of enforcing orthogonality in the weight layers of deep networks, such as maintaining the stability of activations, preserving gradient norms, and enhancing adversarial robu…

Adversarial Robustness