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.
The transmission eigenvalue problem is a system of two second-order elliptic equations of two unknowns equipped with the Cauchy data on the boundary. In this work, we establish the Weyl law for the eigenvalues and the completeness of the generalized eigenf ...
The goal of this paper is to characterize function distributions that general neural networks trained by descent algorithms (GD/SGD), can or cannot learn in polytime. The results are: (1) The paradigm of general neural networks trained by SGD is poly-time ...
When learning from data, leveraging the symmetries of the domain the data lies on is a principled way to combat the curse of dimensionality: it constrains the set of functions to learn from. It is more data efficient than augmentation and gives a generaliz ...
Cakoni and Nguyen recently proposed very general conditions on the coefficients of Maxwell equations for which they established the discreten ess of the set of eigenvalues of the transmission problem and studied their locations. In this paper, we establish ...
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 ...
Shadows for bicategories, defined by Ponto, provide a useful framework that generalizes classical and topological Hochschild homology. In this paper, we define Hochschild-type invariants for monoids in a symmetric monoidal, simplicial model category V, as ...
Robust and distributionally robust optimization are modeling paradigms for decision-making under uncertainty where the uncertain parameters are only known to reside in an uncertainty set or are governed by any probability distribution from within an ambigu ...
Given a level set E of an arbitrary multiplicative function f, we establish, by building on the fundamental work of Frantzikinakis and Host [14, 15], a structure theorem that gives a decomposition of 1E into an almost periodic and a pseudo-random part ...
We generalize the fixed-point property for discrete groups acting on convex cones given by Monod in [23] to topological groups. At first, we focus on describing this fixed-point property from a functional point of view, and then we look at the class of gro ...
We introduce a general framework for the reconstruction of periodic multivariate functions from finitely many and possibly noisy linear measurements. The reconstruction task is formulated as a penalized convex optimization problem, taking the form of a sum ...