Bayesian adaptation of chaos representations using variational inference and sampling on geodesics
Related publications (60)
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.
In the current work we present two generalizations of the Parallel Tempering algorithm in the context of discrete-timeMarkov chainMonteCarlo methods for Bayesian inverse problems. These generalizations use state-dependent swapping rates, inspired by the so ...
Given a family of nearly commuting symmetric matrices, we consider the task of computing an orthogonal matrix that nearly diagonalizes every matrix in the family. In this paper, we propose and analyze randomized joint diagonalization (RJD) for performing t ...
We propose to formulate the problem of repre-senting a distribution of robot configurations (e.g. joint angles)as that of approximating a product of experts. Our approach uses variational inference, a popular method in Bayesian computation, which has sever ...
Higher-order asymptotics provide accurate approximations for use in parametric statistical modelling. In this thesis, we investigate using higher-order approximations in two-specific settings, with a particular emphasis on the tangent exponential model. Th ...
This paper introduces a new modeling and inference framework for multivariate and anisotropic point processes. Building on recent innovations in multivariate spatial statistics, we propose a new family of multivariate anisotropic random fields, and from th ...
Deep neural networks have been empirically successful in a variety of tasks, however their theoretical understanding is still poor. In particular, modern deep neural networks have many more parameters than training data. Thus, in principle they should over ...
EPFL2020
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, ...
2019
Expectation propagation (EP) is a widely successful algorithm for variational inference. EP is an iterative algorithm used to approximate complicated distributions, typically to find a Gaussian approximation of posterior distributions. In many applications ...
We analyze the accuracy of the discrete least-squares approximation of a function u in multivariate polynomial spaces PΛ:=span{y↦yν:ν∈Λ} with Λ⊂N0d over the domain Γ:=[−1,1]d, based on the s ...
A persistent obstacle for constructing kinetic models of metabolism is uncertainty in the kinetic properties of enzymes. Currently, available methods for building kinetic models can cope indirectly with uncertainties by integrating data from different biol ...