Variational Inference with Mixture Model Approximation for Applications in Robotics
Graph Chatbot
Chat with Graph Search
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.
This paper i) compares parametric and semi-parametric representations of unobserved heterogeneity in hierarchical Bayesian logit models and ii) applies these methods to infer distributions of willingness to pay for features of shared automated vehicle (SAV ...
We present an improved analysis of the Euler-Maruyama discretization of the Langevin diffusion. Our analysis does not require global contractivity, and yields polynomial dependence on the time horizon. Compared to existing approaches, we make an additional ...
The efficiency of stochastic particle schemes for large scale simulations relies on the ability to preserve a uniform distribution of particles in the whole physical domain. While simple particle split and merge algorithms have been considered previously, ...
Travel time distributions (TTDs) are concise descriptions of transport processes in catchments based on water ages, and they are particularly efficient as lumped hydrological models to simulate tracers in outflows. Past studies have approximated catchment ...
A novel approach is presented for constructing polynomial chaos representations of scalar quantities of interest (QoI) that extends previously developed methods for adaptation in Homogeneous Chaos spaces. In this work, we develop a Bayesian formulation of ...
We introduce an online outlier detection algorithm to detect outliers in a sequentially observed data stream. For this purpose, we use a two-stage filtering and hedging approach. In the first stage, we construct a multimodal probability density function to ...
We consider the previously unsolved problem of sampling paths according to a given distribution from a general network. The problem is difficult because of the combinatorial number of alternatives, which prohibits a complete enumeration of all paths and he ...
We propose a new variational inference method based on a proximal framework that uses the Kullback-Leibler (KL) divergence as the proximal term. We make two contributions towards exploiting the geometry and structure of the variational bound. Firstly, we p ...
The currently adopted practice for uncertainty quantification of thermal-hydraulics code predictions is done through statistical sampling where the code is evaluated multiple times using different values of input parameters that are randomly generated acco ...
This study presents a method for computing likelihood ratios (LRs) from multimodal score distributions, as the ones produced by some commercial off-the-shelf automated fingerprint identification systems (AFISs). The AFIS algorithms used to compare fingerma ...
