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.
Humans are comparison machines: comparing and choosing an item among a set of alternatives (such as objects or concepts) is arguably one of the most natural ways for us to express our preferences and opinions. In many applications, the analysis of data con ...
The relationship between collapsibility and confounding has been subject to an extensive and ongoing discussion in the methodological literature. We discuss two subtly different definitions of collapsibility, and show that by considering causal effect meas ...
We propose and analyse randomized cubature formulae for the numerical integration of functions with respect to a given probability measure μ defined on a domain Γ⊆ℝ^d, in any dimension d. Each cubature formula is conceived to be exact on a given finite dim ...
We are living in the era of "Big Data", an era characterized by a voluminous amount of available data. Such amount is mainly due to the continuing advances in the computational capabilities for capturing, storing, transmitting and processing data. However, ...
Confronted with complex societal problems, science funding bodies have been calling for the participation of non-scientific actors in the production of allegedly more ‘robust’ knowledge. While in the field of sustainability these trends in science policy h ...
We generalize the ham sandwich theorem to d +1 measures on R-d as follows. Let mu(1), mu(2),..., mu(d+1) be absolutely continuous finite Borel measures on R-d. Let omega(i) = mu(i) (R-d) for i is an element of [d + 1], omega = min{omega(i) : i is an elemen ...
Information concentration of probability measures have important implications in learning theory. Recently, it is discovered that the information content of a log-concave distribution concentrates around their differential entropy, albeit with an unpleasan ...
Bounding the generalization error of learning algorithms has a long history, which yet falls short in explaining various generalization successes including those of deep learning. Two important difficulties are (i) exploiting the dependencies between the h ...
There has been definite progress recently in proving the variational single-letter formula given by the heuristic replica method for various estimation problems. In particular, the replica formula for the mutual information in the case of noisy linear esti ...
Somewhere around the late 60's, the architectural studio underwent a 'conceptual' turn which, some fifty years later, would unknowingly become the model for the now fashionable 'start-up', 'business incubator' and 'think-tank' spaces that have sprung up fr ...
