English
Related papers

Related papers: Particle Metropolis adjusted Langevin algorithms f…

200 papers

Recent research has led to the development of MCMC algorithms with likelihood-informed proposals when targeting posterior distributions supported on discrete state spaces. Our work is placed within this field and puts forward a new MCMC…

Methodology · Statistics 2026-05-22 Luca Aiello , Raffaele Argiento , Alexandros Beskos , Maria De Iorio

Particle Metropolis-Hastings enables Bayesian parameter inference in general nonlinear state space models (SSMs). However, in many implementations a random walk proposal is used and this can result in poor mixing if not tuned correctly…

Computation · Statistics 2016-03-11 Johan Dahlin , Fredrik Lindsten , Thomas B. Schön

The parameters of a discrete stationary Markov model are transition probabilities between states. Traditionally, data consist in sequences of observed states for a given number of individuals over the whole observation period. In such a…

Computation · Statistics 2012-04-30 Alberto Pasanisi , Shuai Fu , Nicolas Bousquet

Constantine et al. (2016) introduced a Metropolis-Hastings (MH) approach that target the active subspace of a posterior distribution: a linearly projected subspace that is informed by the likelihood. Schuster et al. (2017) refined this…

Methodology · Statistics 2025-01-10 Leonardo Ripoli , Richard G. Everitt

Markov Chain Monte Carlo (MCMC) techniques are now widely used for cosmological parameter estimation. Chains are generated to sample the posterior probability distribution obtained following the Bayesian approach. An important issue is how…

Markov chain Monte Carlo (MCMC) methods are powerful computational tools for analysis of complex statistical problems. However, their computational efficiency is highly dependent on the chosen proposal distribution, which is generally…

Statistics Theory · Mathematics 2014-10-02 Isambi S. Mbalawata , Simo Särkkä , Matti Vihola , Heikki Haario

In this paper we consider a new probability sampling methods based on Langevin diffusion dynamics to resolve the problem of existing Monte Carlo algorithms when draw samples from high dimensional target densities. We extent…

Machine Learning · Computer Science 2025-03-31 Z. Zarezadeh , N. Zarezadeh

Recently-proposed particle MCMC methods provide a flexible way of performing Bayesian inference for parameters governing stochastic kinetic models defined as Markov (jump) processes (MJPs). Each iteration of the scheme requires an estimate…

Computation · Statistics 2014-05-19 Andrew Golightly , Daniel A. Henderson , Chris Sherlock

Markov Chain Monte Carlo (MCMC) methods are a powerful tool for computation with complex probability distributions. However the performance of such methods is critically dependant on properly tuned parameters, most of which are difficult if…

Computation · Statistics 2021-10-27 James A. Brofos , Marylou Gabrié , Marcus A. Brubaker , Roy R. Lederman

It has been widely documented that the sampling and resampling steps in particle filters cannot be differentiated. The {\itshape reparameterisation trick} was introduced to allow the sampling step to be reformulated into a differentiable…

Machine Learning · Statistics 2022-08-10 Conor Rosato , Vincent Beraud , Paul Horridge , Thomas B. Schön , Simon Maskell

We present several implementations of the Metropolis method, an adaptive Monte Carlo algorithm, which allow for the calculation of multi-dimensional integrals over arbitrary on-shell four-momentum phase space. The Metropolis technique…

High Energy Physics - Phenomenology · Physics 2009-10-31 Hamid Kharraziha , Stefano Moretti

Particle Markov chain Monte Carlo (pMCMC) is now a popular method for performing Bayesian statistical inference on challenging state space models (SSMs) with unknown static parameters. It uses a particle filter (PF) at each iteration of an…

Computation · Statistics 2019-08-19 Christopher Drovandi , Richard G Everitt , Andrew Golightly , Dennis Prangle

We investigate the impact of filter choice on forecast accuracy in state space models. The filters are used both to estimate the posterior distribution of the parameters, via a particle marginal Metropolis-Hastings (PMMH) algorithm, and to…

Computation · Statistics 2019-08-21 Patrick Leung , Catherine S. Forbes , Gael M. Martin , Brendan McCabe

In the case of a linear state space model, we implement an MCMC sampler with two phases. In the learning phase, a self-tuning sampler is used to learn the parameter mean and covariance structure. In the estimation phase, the parameter mean…

Applications · Statistics 2018-03-22 Zhanglong Cao , David Bryant , Matthew Parry

This tutorial provides a gentle introduction to the particle Metropolis-Hastings (PMH) algorithm for parameter inference in nonlinear state-space models together with a software implementation in the statistical programming language R. We…

Computation · Statistics 2019-03-13 Johan Dahlin , Thomas B. Schön

We propose a new class of learning algorithms that combines variational approximation and Markov chain Monte Carlo (MCMC) simulation. Naive algorithms that use the variational approximation as proposal distribution can perform poorly…

Machine Learning · Computer Science 2013-01-14 Nando de Freitas , Pedro Hojen-Sorensen , Michael I. Jordan , Stuart Russell

We analyse the performance of a recursive Monte Carlo method for the Bayesian estimation of the static parameters of a discrete--time state--space Markov model. The algorithm employs two layers of particle filters to approximate the…

Computation · Statistics 2016-03-31 Dan Crisan , Joaquin Miguez

Twisted particle filters are a class of sequential Monte Carlo methods recently introduced by Whiteley and Lee to improve the efficiency of marginal likelihood estimation in state-space models. The purpose of this article is to extend the…

Computation · Statistics 2024-10-30 Juha Ala-Luhtala , Nick Whiteley , Kari Heine , Robert Piche

The Metropolis implementation of the Monte Carlo algorithm has been developed to study the equilibrium thermodynamics of many-body systems. Choosing small trial moves, the trajectories obtained applying this algorithm agree with those…

Other Quantitative Biology · Quantitative Biology 2009-11-13 G. Tiana , L. Sutto , R. A. Broglia

We present an original simulation-based method to estimate likelihood ratios efficiently for general state-space models. Our method relies on a novel use of the conditional Sequential Monte Carlo (cSMC) algorithm introduced in…

Methodology · Statistics 2018-09-10 Sinan Yıldırım , Christophe Andrieu , Arnaud Doucet