Concept

Modèle de Markov caché

Publications associées (32)

Hiding in Plain Sight: The Issue of Hidden Variables

Here we discuss "hidden variables", which are typically introduced during an experiment as a consequence of the application of two independent variables together to create a stimulus. With increased sophistication in modern chemical biology tools and relat ...

AMER CHEMICAL SOC2022

Leveraging Self-Supervision for Cross-Domain Crowd Counting

Pascal Fua, Nikita Durasov, Weizhe Liu

State-of-the-art methods for counting people in crowded scenes rely on deep networks to estimate crowd density. While effective, these data-driven approaches rely on large amount of data annotation to achieve good performance, which stops these models from ...

IEEE COMPUTER SOC2022

GANs for All: Supporting Fun and Intuitive Exploration of GAN Latent Spaces

Pierre Dillenbourg, Richard Lee Davis, Kevin Gonyop Kim, Wei Jiang

We have developed a new tool that makes it possible for people with zero programming experience to intentionally and meaningfully explore the latent space of a GAN. We combine a number of methods from the literature into a single system that includes multi ...

PMLR2022

Multilevel ensemble Kalman filtering for spatio-temporal processes

Fabio Nobile, Hakon Andreas Hoel

We design and analyse the performance of a multilevel ensemble Kalman filter method (MLEnKF) for filtering settings where the underlying state-space model is an infinite-dimensional spatio-temporal process. We consider underlying models that needs to be si ...

2021

Gradient-based Methods for Deep Model Interpretability

Suraj Srinivas

In this dissertation, we propose gradient-based methods for characterizing model behaviour for the purposes of knowledge transfer and post-hoc model interpretation. Broadly, gradients capture the variation of some output feature of the model upon unit vari ...

EPFL2021

MATHICSE Technical Report : Analysis of a class of Multi-Level Markov Chain Monte Carlo algorithms based on Independent Metropolis-Hastings

Fabio Nobile, Juan Pablo Madrigal Cianci

In this work, we present, analyze, and implement a class of Multi-Level Markov chain Monte Carlo (ML-MCMC) algorithms based on independent Metropolis-Hastings proposals for Bayesian inverse problems. In this context, the likelihood function involves solvin ...

MATHICSE2021

Distributionally Robust Optimization with Markovian Data

Daniel Kuhn, Mengmeng Li, Tobias Sutter

We study a stochastic program where the probability distribution of the uncertain problem parameters is unknown and only indirectly observed via finitely many correlated samples generated by an unknown Markov chain with d states. We propose a data-driven d ...

2021

Product of experts for robot learning from demonstration

Emmanuel Pignat

Adaptability and ease of programming are key features necessary for a wider spread of robotics in factories and everyday assistance. Learning from demonstration (LfD) is an approach to address this problem. It aims to develop algorithms and interfaces such ...

EPFL2021

Adaptive Path Interpolation Method for Sparse Systems: Application to a Censored Block Model

Nicolas Macris, Jean François Emmanuel Barbier, Chun Lam Chan

Recently, a new adaptive path interpolation method has been developed as a simple and versatile scheme to calculate exactly the asymptotic mutual information of Bayesian inference problems defined on dense factor graphs. These include random linear and gen ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Learning Analytics for Adaptive and Self-Improving Learning Environments for Inductive Teaching

Louis Pierre Faucon

The emergence of digital technology is changing education in many ways. A particularly interesting aspect of this transformation is the development of learning environments that can automatically adapt to individual students and can collect data in order t ...

EPFL2021

Graph Chatbot

Chattez avec Graph Search

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.

Connectez-vous pour utiliser Chat avec Graph Search