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.
Interactions are ubiquitous in our world, spanning from social interactions between human individuals to physical interactions between robots and objects to mechanistic interactions among different components of an intelligent system. Despite their prevale ...
Recently, there have been multiple proposals for faster methods to calculate glare metrics, daylight glare probability (DGP) in particular. This is driven simultaneously by the lengthy times required to simulate DGP with a conventional image-based approach ...
Humans can rapidly estimate the statistical properties of groups of stimuli, including their average and variability. But recent studies of so-called Feature Distribution Learning (FDL) have shown that observers can quickly learn even more complex aspects ...
We consider three classes of linear differential equations on distribution functions, with a fractional order alpha is an element of [0; 1]. The integer case alpha = 1 corresponds to the three classical extreme families. In general, we show that there is a ...
The spectral distribution plays a key role in the statistical modelling of multivariate extremes, as it defines the dependence structure of multivariate extreme-value distributions and characterizes the limiting distribution of the relative sizes of the co ...
We study the phenomenon of intransitivity in models of dice and voting. First, we follow a recent thread of research for n-sided dice with pairwise ordering induced by the probability, relative to 1/2, that a throw from one die is higher than the other. We ...
In this work, we borrow tools from the field of adversarial robustness, and propose a new framework that permits to relate dataset features to the distance of samples to the decision boundary. Using this framework we identify the subspace of features used ...
The randomized query complexity 𝖱(f) of a boolean function f: {0,1}ⁿ → {0,1} is famously characterized (via Yao’s minimax) by the least number of queries needed to distinguish a distribution 𝒟₀ over 0-inputs from a distribution 𝒟₁ over 1-inputs, maximized ...
Schloss Dagstuhl - Leibniz-Zentrum für Informatik2020
We study stochastic programs where the decision-maker cannot observe the distribution of the exogenous uncertainties but has access to a finite set of independent samples from this distribution. In this setting, the goal is to find a procedure that transfo ...
In this work, we borrow tools from the field of adversarial robustness, and propose a new framework that permits to relate dataset features to the distance of samples to the decision boundary. Using this framework we identify the subspace of features used ...
