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 use the method of interlacing families of polynomials to derive a simple proof of Bourgain and Tzafriri's Restricted Invertibility Principle, and then to sharpen the result in two ways. We show that the stable rank can be replaced by the Schatten 4-norm ...
Let c denote the largest constant such that every C-6-free graph G contains a bipartite and C-4-free subgraph having a fraction c of edges of G. Gyori, Kensell and Tompkins showed that 3/8
We give a new proof of a sumset conjecture of Furstenberg that was first proved by Hochman and Shmerkin in 2012: if logr/logs is irrational and X and Y are ×r- and ×s-invariant subsets of [0,1], respectively, then $\dim_\text{ ...
Even with correct training, up to 25% of children never master handwriting like their peers. While research shows a correlation between handwriting difficulties and school failure, these difficulties can also impact children in their self esteem and behavi ...
The nematode Caenorhabditis elegans has been extensively used as a model multicellular organism to study the influence of osmotic stress conditions and the toxicity of chemical compounds on developmental and motility-associated phenotypes. However, the sev ...
In this work, we revisit a classical incremental implementation of the primal-descent dual-ascent gradient method used for the solution of equality constrained optimization problems. We provide a short proof that establishes the linear (exponential) conver ...
In a previous article, we introduced the first passage set (FPS) of constant level -aof the two-dimensional continuum Gaussian free field (GFF) on finitely connected domains. Informally, it is the set of points in the domain that can be connected to the bo ...
In this paper we show that every set A ⊂ ℕ with positive density contains B + C for some pair B, C of infinite subsets of ℕ , settling a conjecture of Erdős. The proof features two different decompositions of an arbitrary bounded sequence into a structured ...
Grippers, currently used in Industry, are not suited for clean room application. Thus, a novel type of smart gripper is being designed using Shape Memory Alloys (SMA). In the development of this Smart Gripper, the modelling of the material is quite critica ...
It has been shown that neural network classifiers are not robust. This raises concerns about their usage in safety-critical systems. We propose in this paper a regularization scheme for ReLU networks which provably improves the robustness of the classifier ...