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.
Many techniques for data science and uncertainty quantification demand efficient tools to handle Gaussian random fields, which are defined in terms of their mean functions and covariance operators. Recently, parameterized Gaussian random fields have gained ...
We consider the problem of comparing several samples of stochastic processes with respect to their second-order structure, and describing the main modes of variation in this second order structure, if present. These tasks can be seen as an Analysis of Vari ...
Functional time series is a temporally ordered sequence of not necessarily independent random curves. While the statistical analysis of such data has been traditionally carried out under the assumption of completely observed functional data, it may well ha ...
EPFL2021
, ,
Aims. We investigate the contribution of shot-noise and sample variance to uncertainties in the cosmological parameter constraints inferred from cluster number counts, in the context of the Euclid survey. Methods. By analysing 1000 Euclid-like light cones, ...
EDP SCIENCES S A2021
,
The extension of convolutional neural networks to irregular domains has pavedthe way to promising graph data analysis methods. It has however come at theexpense of a reduced representation power, as most of these new network archi-tectures can only learn i ...
2019
,
Is it possible to detect if the sample paths of a stochastic process almost surely admit a finite expansion with respect to some/any basis? The determination is to be made on the basis of a finite collection of discretely/noisily observed sample paths. We ...
ACADEMIC PRESS INC ELSEVIER SCIENCE2023
, , ,
We consider the estimation of a signal from the knowledge of its noisy linear random Gaussian projections. A few examples where this problem is relevant are compressed sensing, sparse superposition codes, and code division multiple access. There has been a ...
This thesis concerns the theory of positive-definite completions and its mutually beneficial connections to the statistics of function-valued or continuously-indexed random processes, better known as functional data analysis. In particular, it dwells upon ...
EPFL2023
In this paper, we focus on isotropic and stationary sphere-cross-time random fields. We first introduce the class of spherical functional autoregressive-moving average processes (SPHARMA), which extend in a natural way the spherical functional autoregressi ...
In this paper, we study the compressibility of random processes and fields, called generalized Levy processes, that are solutions of stochastic differential equations driven by d-dimensional periodic Levy white noises. Our results are based on the estimati ...
