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.
We present upper and lower bounds for Steklov eigenvalues for domains in RN+1 with C-2 boundary compatible with the Weyl asymptotics. In particular, we obtain sharp upper bounds on Riesz-means and the trace of corresponding Steklov heat kernel. The key res ...
We continue the study of renewal contact processes initiated in a companion paper, where we showed that if the tail of the interarrival distribution mu is heavier than t(-alpha) for some alpha < 1 (plus auxiliary regularity conditions) then the critical va ...
We prove equidistribution at shrinking scales for the monochromatic ensemble on a compact Riemannian manifold of any dimension. This ensemble on an arbitrary manifold takes a slowly growing spectral window in order to synthesize a random function. With hig ...
Randomized trace estimation is a popular and well-studied technique that approximates the trace of a large-scale matrix B by computing the average of x(T) Bx for many samples of a random vector X. Often, B is symmetric positive definite (SPD) but a number ...
In this work, the probability of an event under some joint distribution is bounded by measuring it with the product of the marginals instead (which is typically easier to analyze) together with a measure of the dependence between the two random variables. ...
In this paper, we study the compression of a target two-layer neural network with N nodes into a compressed network with M < N nodes. More precisely, we consider the setting in which the weights of the target network are i.i.d. sub-Gaussian, and we minimiz ...
The lack of detection to date of electromagnetic technosignatures implies either that we have been unable to detect them due to incomplete sampling of the search space or that we cannot detect them because the Earth has been located during the entire histo ...
We derive confidence intervals (CIs) and confidence sequences (CSs) for the classical problem of estimating a bounded mean. Our approach generalizes and improves on the celebrated Chernoff method, yielding the best closed-form "empirical-Bernstein" CSs and ...
Let P be a partially ordered set. The function La* (n, P) denotes the size of the largest family F subset of 2([n]) that does not contain an induced copy of P. It was proved by Methuku and Palvolgyi that there exists a constant C-P (depending only on P) su ...
The goal of regression and classification methods in supervised learning is to minimize the empirical risk, that is, the expectation of some loss function quantifying the prediction error under the empirical distribution. When facing scarce training data, ...