Publications related to Lipschitz continuity

Linear Lipschitz and C-1 extension operators through random projection

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, Pakshal Narendra Bohra, Alexis Marie Frederic Goujon, Sébastien Alexandre Emery

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 ...

SPRINGER2021

Lipschitz constant estimation for Neural Networks via sparse polynomial optimization

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

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, Paul Thierry Yves Rolland, Fabian Ricardo Latorre Gomez, 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 ...

2020

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, ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Forward-Backward Splitting for Optimal Transport Based Problems

Pascal Frossard, Guillermo Ortiz Jimenez, Mireille El Gheche, Hermina Petric Maretic, 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 ...

2020

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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

Lipschitz continuity

Linear Lipschitz and C-1 extension operators through random projection

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

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

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

Lipschitz constant estimation for Neural Networks via sparse polynomial optimization

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

Deep Neural Networks With Trainable Activations and Controlled Lipschitz Constant

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

Forward-Backward Splitting for Optimal Transport Based Problems

On long time behavior of solutions to nonlinear dispersive equations

Graph Chatbot

Chat with Graph Search

Lipschitz constant estimation for Neural Networks via sparse polynomial optimization

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

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

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

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

Deep Neural Networks With Trainable Activations and Controlled Lipschitz Constant

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

Forward-Backward Splitting for Optimal Transport Based Problems

On long time behavior of solutions to nonlinear dispersive equations

Linear Lipschitz and C-1 extension operators through random projection