Linear Lipschitz and C-1 extension operators through random projection

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Data-driven approaches have been applied to reduce the cost of accurate computational studies on materials, by using only a small number of expensive reference electronic structure calculations for a representative subset of the materials space, and using ...

We consider the problem of comparing several samples of stochastic processes with respect to their second-order structure, and describing the main modes of variation in this second order structure, if present. These tasks can be seen as an Analysis of Vari ...

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

The Lizorkin space is well suited to the study of operators like fractional Laplacians and the Radon transform. In this paper, we show that the space is unfortunately not complemented in the Schwartz space. In return, we show that it is dense in C0(Double- ...

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

In this thesis we present and analyze approximation algorithms for three different clustering problems. The formulations of these problems are motivated by fairness and explainability considerations, two issues that have recently received attention in the ...

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

Collapsing cell complexes was first introduced in the 1930's as a way to deform a space into a topological-equivalent subspace with a sequence of elementary moves. Recently, discrete Morse theory techniques provided an efficient way to construct deformatio ...

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

In this thesis, we reveal that supervised learning and inverse problems share similar mathematical foundations. Consequently, we are able to present a unified variational view of these tasks that we formulate as optimization problems posed over infinite-di ...

In this paper, we consider a compact connected manifold (X, g) of negative curvature, and a family of semi-classical Lagrangian states f(h)(x) = a(x)e(i phi(x)/h) on X. For a wide family of phases phi, we show that f(h), when evolved by the semi-classical ...

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

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

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

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

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

We present a novel algorithm based on the ensemble Kalman filter to solve inverse problems involving multiscale elliptic partial differential equations. Our method is based on numerical homogenization and finite element discretization and allows us to reco ...

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

Let G be the homeomorphism group of a dendrite. We study the normal subgroups of G. For instance, there are uncountably many nonisomorphic such groups G that are simple groups. Moreover, these groups can be chosen so that any isometric G-action on any metr ...

A convolution algebra is a topological vector space X that is closed under the convolution operation. It is said to be inverse-closed if each element of X whose spectrum is bounded away from zero has a convolution inverse that is also part of the algebra. ...

Linear Lipschitz and C-1 extension operators through random projection

Chattez avec Graph Search

Efficient and insightful descriptors for representing molecular and material space

Transportation-based functional ANOVA and PCA for covariance operators

Stability of Image-Reconstruction Algorithms

Explicit representations for Banach subspaces of Lizorkin distributions

Stable parameterization of continuous and piecewise-linear functions

Fairness and Explainability in Clustering Problems

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

Collapse-invariant properties of spaces equipped with signals or directions

Predicting in Uncertain Environments: Methods for Robust Machine Learning

Optimization Over Banach Spaces: A Unified View on Supervised Learning and Inverse Problems

How Lagrangian States Evolve Into Random Waves

A Functional Perspective on Information Measures

Convex optimization in sums of Banach spaces

Global bifurcation at isolated singular points of the Hadamard derivative

Fair colorful k-center clustering

Discretisation and continuity: The emergence of symbols in communication

Ensemble Kalman Filter For Multiscale Inverse Problems

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

Structural Properties Of Dendrite Groups

Beyond Wiener's Lemma: Nuclear Convolution Algebras and the Inversion of Digital Filters