activity
20172026
most citedCLIP: Cheap Lipschitz Training of Neural Networks

21 citations · 75 across the 16 of their papers we have counts for

collaborators
Showing 2021Show all

5 papers · 1 filter

math.OC2021★ 3 cited

First- and Second-Order Analysis for Optimization Problems with Manifold-Valued Constraints

Ronny Bergmann, Roland Herzog, Julián Ortiz López +1

We consider optimization problems with manifold-valued constraints. These generalize classical equality and inequality constraints to a setting in which both the domain and the cod…

cs.LG2021

Neural Architecture Search via Bregman Iterations

Leon Bungert, Tim Roith, Daniel Tenbrinck +1

We propose a novel strategy for Neural Architecture Search (NAS) based on Bregman iterations. Starting from a sparse neural network our gradient-based one-shot algorithm gradually…

cs.LG2021★ 2 cited

A Bregman Learning Framework for Sparse Neural Networks

Leon Bungert, Tim Roith, Daniel Tenbrinck +1

We propose a learning framework based on stochastic Bregman iterations, also known as mirror descent, to train sparse neural networks with an inverse scale space approach. We deriv…

cs.LG2021★ 21 cited

CLIP: Cheap Lipschitz Training of Neural Networks

Leon Bungert, René Raab, Tim Roith +2

Despite the large success of deep neural networks (DNN) in recent years, most neural networks still lack mathematical guarantees in terms of stability. For instance, DNNs are vulne…

cs.LG2021★ 2 cited

Identifying Untrustworthy Predictions in Neural Networks by Geometric Gradient Analysis

Leo Schwinn, An Nguyen, René Raab +5

The susceptibility of deep neural networks to untrustworthy predictions, including out-of-distribution (OOD) data and adversarial examples, still prevent their widespread use in sa…