Home

Publication

Linear Lipschitz and C-1 extension operators through random projection

Related publications (29)

Page 2 of 3

About
Privacy
Disclaimer

Graph Chatbot

A Functional Perspective on Information Measures

Amedeo Roberto Esposito

Since the birth of Information Theory, researchers have defined and exploited various information measures, as well as endowed them with operational meanings. Some were born as a "solution to a problem", like Shannon's Entropy and Mutual Information. Other ...

EPFL2022

Convex optimization in sums of Banach spaces

Michaël Unser, Shayan Aziznejad

We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a finite sum of compo ...

2021

Global bifurcation at isolated singular points of the Hadamard derivative

Charles Stuart

Consider F is an element of C(RxX,Y) such that F(lambda, 0) = 0 for all lambda is an element of R, where X and Y are Banach spaces. Bifurcation from the line Rx{0} of trivial solutions is investigated in cases where F(lambda, center dot ) need not be Frech ...

2021

Fair colorful k-center clustering

Ola Nils Anders Svensson, Xinrui Jia

An instance of colorful k-center consists of points in a metric space that are colored red or blue, along with an integer k and a coverage requirement for each color. The goal is to find the smallest radius rho such that there exist balls of radius rho aro ...

SPRINGER HEIDELBERG2022

Discretisation and continuity: The emergence of symbols in communication

Martin Alois Rohrmeier, Robert Lieck

Vocal signalling systems, as used by humans and various non-human animals, exhibit discrete and continuous properties that can naturally be used to express discrete and continuous information, such as distinct words to denote objects in the world and proso ...

2021

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

JMLR-JOURNAL MACHINE LEARNING RESEARCH2020

A Unifying Representer Theorem for Inverse Problems and Machine Learning

Michaël Unser

Regularization addresses the ill-posedness of the training problem in machine learning or the reconstruction of a signal from a limited number of measurements. The method is applicable whenever the problem is formulated as an optimization task. The standar ...

2021

Fair Colorful k-Center Clustering

Ola Nils Anders Svensson, Xinrui Jia

An instance of colorful k-center consists of points in a metric space that are colored red or blue, along with an integer k and a coverage requirement for each color. The goal is to find the smallest radius ρ such that there exist balls of radius ρ around ...

Springer2020

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

Group Approximation in Cayley Topology and Coarse Geometry, Part II: Fibred Coarse Embeddings

Masato Mimura

The objective of this series is to study metric geometric properties of disjoint unions of Cayley graphs of amenable groups by group properties of the Cayley accumulation points in the space of marked groups. In this Part II, we prove that a disjoint union ...

2019

Page 2 of 3

A Functional Perspective on Information Measures

Amedeo Roberto Esposito

EPFL2022

Convex optimization in sums of Banach spaces

Michaël Unser, Shayan Aziznejad

2021

Fair colorful k-center clustering

Ola Nils Anders Svensson, Xinrui Jia

SPRINGER HEIDELBERG2022

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

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

JMLR-JOURNAL MACHINE LEARNING RESEARCH2020

Fair Colorful k-Center Clustering

Ola Nils Anders Svensson, Xinrui Jia

An instance of colorful k-center consists of points in a metric space that are colored red or blue, along with an integer k and a coverage requirement for each color. The goal is to find the smallest radius ρ such that there exist balls of radius ρ around ...

Springer2020