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.
Let X={Xu}u is an element of U be a real-valued Gaussian process indexed by a set U. We show that X can be viewed as a graphical model with an uncountably infinite graph, where each Xu is a vertex. This graph is characterized by the reproducing property of X's covariance kernel, without restricting U to be finite or countable, allowing the modelling of stochastic processes in continuous time/space. Unlike traditional methods, this characterization is not based on zero entries of an inverse covariance, posing challenges for structure estimation. We propose a plug-in methodology that targets graph recovery up to a finite resolution and shows consistency for graphs which are sufficiently regular and that can be applied to virtually any measurement regime. Furthermore, we derive convergence rates and finite-sample guarantees for the method, and demonstrate its performance through a simulation study and two data analyses.
Michel Bierlaire, Timothy Michael Hillel, Janody Pougala