Publications related to Lipschitz continuity

Related publications (28)

Stability of Image-Reconstruction Algorithms

Michaël Unser, Sebastian Jonas Neumayer, Pol del Aguila Pla

Robustness and stability of image-reconstruction algorithms have recently come under scrutiny. Their importance to medical imaging cannot be overstated. We review the known results for the topical variational regularization strategies ( ℓ2 and ℓ1 regulariz ...

2023

Stable parameterization of continuous and piecewise-linear functions

Michaël Unser, Alexis Marie Frederic Goujon, Joaquim Gonçalves Garcia Barreto Campos

Rectified-linear-unit (ReLU) neural networks, which play a prominent role in deep learning, generate continuous and piecewise-linear (CPWL) functions. While they provide a powerful parametric representation, the mapping between the parameter and function s ...

2023

Benign Overfitting in Deep Neural Networks under Lazy Training

Volkan Cevher, Grigorios Chrysos, Fanghui Liu, Zhenyu Zhu

This paper focuses on over-parameterized deep neural networks (DNNs) with ReLU activation functions and proves that when the data distribution is well-separated, DNNs can achieve Bayesoptimal test error for classification while obtaining (nearly) zero-trai ...

2023

Gradient-based optimisation of the conditional-value-at-risk using the multi-level Monte Carlo method

Fabio Nobile, Sundar Subramaniam Ganesh

In this work, we tackle the problem of minimising the Conditional-Value-at-Risk (CVaR) of output quantities of complex differential models with random input data, using gradient-based approaches in combination with the Multi-Level Monte Carlo (MLMC) method ...

2023

Controlling the Complexity and Lipschitz Constant improves Polynomial Nets

Volkan Cevher, Grigorios Chrysos, Fabian Ricardo Latorre Gomez, Zhenyu Zhu

While the class of Polynomial Nets demonstrates comparable performance to neural networks (NN), it currently has neither theoretical generalization characterization nor robustness guarantees. To this end, we derive new complexity bounds for the set of Coup ...

2022

Predicting in Uncertain Environments: Methods for Robust Machine Learning

Paul Thierry Yves Rolland

One of the main goal of Artificial Intelligence is to develop models capable of providing valuable predictions in real-world environments. In particular, Machine Learning (ML) seeks to design such models by learning from examples coming from this same envi ...

EPFL2022

UNDERGRAD: A Universal Black-Box Optimization Method with Almost Dimension-Free Convergence Rate Guarantees

Volkan Cevher, Kimon Antonakopoulos

Universal methods for optimization are designed to achieve theoretically optimal convergence rates without any prior knowledge of the problem’s regularity parameters or the accurarcy of the gradient oracle employed by the optimizer. In this regard, existin ...

2022

An Efficient Sampling Algorithm for Non-smooth Composite Potentials

Nicolas Henri Bernard Flammarion

We consider the problem of sampling from a density of the form p(x) ? exp(-f (x) - g(x)), where f : Rd-+ R is a smooth function and g : R-d-+ R is a convex and Lipschitz function. We propose a new algorithm based on the Metropolis-Hastings framework. Under ...

Microtome Publishing2022

An Accelerated First-Order Method for Non-convex Optimization on Manifolds

Nicolas Boumal, Christopher Arnold Criscitiello

We describe the first gradient methods on Riemannian manifolds to achieve accelerated rates in the non-convex case. Under Lipschitz assumptions on the Riemannian gradient and Hessian of the cost function, these methods find approximate first-order critical ...

SPRINGER2022

Linear Lipschitz and C-1 extension operators through random projection

Federico Stra

We construct a regular random projection of a metric space onto a closed doubling subset and use it to linearly extend Lipschitz and C-1 functions. This way we prove more directly a result by Lee and Naor [5] and we generalize the C-l extension theorem by ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2021

Learning Lipschitz-Controlled Activation Functions in Neural Networks for Plug-and-Play Image Reconstruction Methods

Michaël Unser, Dimitris Perdios, Alexis Marie Frederic Goujon, Pakshal Narendra Bohra

Ill-posed linear inverse problems are frequently encountered in image reconstruction tasks. Image reconstruction methods that combine the Plug-and-Play (PnP) priors framework with convolutional neural network (CNN) based denoisers have shown impressive per ...

2021

A first-order primal-dual method with adaptivity to local smoothness

Volkan Cevher, Maria-Luiza Vladarean

We consider the problem of finding a saddle point for the convex-concave objective

\min_x \max_y f(x) + \langle Ax, y\rangle - g^*(y)

, where

f

is a convex function with locally Lipschitz gradient and

g

is convex and possibly non-smooth. We propose an ...

2021

A Newton Frank-Wolfe method for constrained self-concordant minimization

Volkan Cevher, Quoc Tran Dinh

We develop a new Newton Frank-Wolfe algorithm to solve a class of constrained self-concordant minimization problems using linear minimization oracles (LMO). Unlike L-smooth convex functions, where the Lipschitz continuity of the objective gradient holds gl ...

SPRINGER2022

Lipschitz constant estimation for Neural Networks via sparse polynomial optimization

Volkan Cevher, Fabian Ricardo Latorre Gomez, Paul Thierry Yves Rolland

We introduce LiPopt, a polynomial optimization framework for computing increasingly tighter upper bounds on the Lipschitz constant of neural networks. The underlying optimization problems boil down to either linear (LP) or semidefinite (SDP) programming. W ...

2020

Efficient Proximal Mapping of the 1-path-norm of Shallow Networks

Volkan Cevher, Fabian Ricardo Latorre Gomez, Paul Thierry Yves Rolland, Shaul Nadav Hallak

We demonstrate two new important properties of the 1-path-norm of shallow neural networks. First, despite its non-smoothness and non-convexity it allows a closed form proximal operator which can be efficiently computed, allowing the use of stochastic proxi ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2020

Deep Neural Networks With Trainable Activations and Controlled Lipschitz Constant

Michaël Unser, Shayan Aziznejad, Harshit Gupta, Joaquim Gonçalves Garcia Barreto Campos

We introduce a variational framework to learn the activation functions of deep neural networks. Our aim is to increase the capacity of the network while controlling an upper-bound of the actual Lipschitz constant of the input-output relation. To that end, ...

2020

On the density of the supremum of the solution to the linear stochastic heat equation

Robert Dalang, Fei Pu

We study the regularity of the probability density function of the supremum of the solution to the linear stochastic heat equation. Using a general criterion for the smoothness of densities for locally nondegenerate random variables, we establish the smoot ...

SPRINGER2020

Forward-Backward Splitting for Optimal Transport Based Problems

Pascal Frossard, Mireille El Gheche, Hermina Petric Maretic, Guillermo Ortiz Jimenez, Effrosyni Simou

Optimal transport aims to estimate a transportation plan that minimizes a displacement cost. This is realized by optimizing the scalar product between the sought plan and the given cost, over the space of doubly stochastic matrices. When the entropy regula ...

IEEE2020

On long time behavior of solutions to nonlinear dispersive equations

Stefano Francesco Burzio

In part I, we address the issue of existence of solutions for Cauchy problems involving nonlinear hyperbolic equations for initial data in Sobolev spaces with scaling subcritical regularity. In particular, we analyse nonlinear estimates for null-forms in t ...

EPFL2020

Deep Spline Networks With Control Of Lipschitz Regularity

Michaël Unser, Shayan Aziznejad

The motivation for this work is to improve the performance of deep neural networks through the optimization of the individual activation functions. Since the latter results in an infinite-dimensional optimization problem, we resolve the ambiguity by search ...

IEEE2019