DeepSplit: Scalable Verification of Deep Neural Networks via Operator Splitting

06/16/2021
by   Shaoru Chen, et al.
0

Analyzing the worst-case performance of deep neural networks against input perturbations amounts to solving a large-scale non-convex optimization problem, for which several past works have proposed convex relaxations as a promising alternative. However, even for reasonably-sized neural networks, these relaxations are not tractable, and so must be replaced by even weaker relaxations in practice. In this work, we propose a novel operator splitting method that can directly solve a convex relaxation of the problem to high accuracy, by splitting it into smaller sub-problems that often have analytical solutions. The method is modular and scales to problem instances that were previously impossible to solve exactly due to their size. Furthermore, the solver operations are amenable to fast parallelization with GPU acceleration. We demonstrate our method in obtaining tighter bounds on the worst-case performance of large convolutional networks in image classification and reinforcement learning settings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/18/2023

Connections between Operator-splitting Methods and Deep Neural Networks with Applications in Image Segmentation

Deep neural network is a powerful tool for many tasks. Understanding why...
research
10/11/2017

Local Convergence of Proximal Splitting Methods for Rank Constrained Problems

We analyze the local convergence of proximal splitting algorithms to sol...
research
10/10/2020

On The Convergence of First Order Methods for Quasar-Convex Optimization

In recent years, the success of deep learning has inspired many research...
research
09/14/2021

ROMAX: Certifiably Robust Deep Multiagent Reinforcement Learning via Convex Relaxation

In a multirobot system, a number of cyber-physical attacks (e.g., commun...
research
01/31/2023

Faster Predict-and-Optimize with Three-Operator Splitting

In many practical settings, a combinatorial problem must be repeatedly s...
research
11/28/2016

Efficient Convolutional Auto-Encoding via Random Convexification and Frequency-Domain Minimization

The omnipresence of deep learning architectures such as deep convolution...
research
11/14/2018

Computing the Minkowski Sum of Convex Polytopes in ^d

We propose a method to efficiently compute the Minkowski sum, denoted by...

Please sign up or login with your details

Forgot password? Click here to reset