English
Related papers

Related papers: Particle-MALA and Particle-mGRAD: Gradient-based M…

200 papers

Stochastic gradient MCMC (SG-MCMC) algorithms have proven useful in scaling Bayesian inference to large datasets under an assumption of i.i.d data. We instead develop an SG-MCMC algorithm to learn the parameters of hidden Markov models…

Machine Learning · Statistics 2017-06-16 Yi-An Ma , Nicholas J. Foti , Emily B. Fox

State-space models are successfully used in many areas of science, engineering and economics to model time series and dynamical systems. We present a fully Bayesian approach to inference \emph{and learning} (i.e. state estimation and system…

Machine Learning · Statistics 2013-12-18 Roger Frigola , Fredrik Lindsten , Thomas B. Schön , Carl E. Rasmussen

State-space models have been widely used to model the dynamics of communicable diseases in populations of interest by fitting to time-series data. Particle filters have enabled these models to incorporate stochasticity and so can better…

Applications · Statistics 2022-05-17 Conor Rosato , John Harris , Jasmina Panovska-Griffiths , Simon Maskell

Particle MCMC involves using a particle filter within an MCMC algorithm. For inference of a model which involves an unobserved stochastic process, the standard implementation uses the particle filter to propose new values for the stochastic…

Computation · Statistics 2016-09-26 Paul Fearnhead , Loukia Meligkotsidou

Particle Marginal Metropolis-Hastings (PMMH) is a general approach to Bayesian inference when the likelihood is intractable, but can be estimated unbiasedly. Our article develops an efficient PMMH method that scales up better to higher…

Computation · Statistics 2023-05-10 David Gunawan , Pratiti Chatterjee , Robert Kohn

When performing Bayesian inference using Sequential Monte Carlo (SMC) methods, two considerations arise: the accuracy of the posterior approximation and computational efficiency. To address computational demands, Sequential Monte Carlo…

Machine Learning · Statistics 2025-07-11 Joshua Murphy , Conor Rosato , Andrew Millard , Lee Devlin , Paul Horridge , Simon Maskell

Poyiadjis et al. (2011) show how particle methods can be used to estimate both the score and the observed information matrix for state space models. These methods either suffer from a computational cost that is quadratic in the number of…

Computation · Statistics 2015-09-07 Christopher Nemeth , Paul Fearnhead , Lyudmila Mihaylova

Probabilistic (or Bayesian) modeling and learning offers interesting possibilities for systematic representation of uncertainty using probability theory. However, probabilistic learning often leads to computationally challenging problems.…

Computation · Statistics 2018-03-14 Andreas Svensson , Thomas B. Schön , Fredrik Lindsten

There has been recent interest in developing scalable Bayesian sampling methods such as stochastic gradient MCMC (SG-MCMC) and Stein variational gradient descent (SVGD) for big-data analysis. A standard SG-MCMC algorithm simulates samples…

Machine Learning · Statistics 2018-07-11 Changyou Chen , Ruiyi Zhang , Wenlin Wang , Bai Li , Liqun Chen

We propose a Markov chain Monte Carlo (MCMC) scheme to perform state inference in non-linear non-Gaussian state-space models. Current state-of-the-art methods to address this problem rely on particle MCMC techniques and its variants, such…

Computation · Statistics 2019-05-15 Alexander Y. Shestopaloff , Arnaud Doucet

High-dimensional state trajectories of state-space models pose challenges for Bayesian inference. Particle Gibbs (PG) methods have been widely used to sample from the posterior of a state space model. Basically, particle Gibbs is a Particle…

Computation · Statistics 2020-08-18 Niharika Gauraha

In this article we consider Bayesian parameter inference associated to partially-observed stochastic processes that start from a set B0 and are stopped or killed at the first hitting time of a known set A. Such processes occur naturally…

Computation · Statistics 2012-01-19 Ajay Jasra , Nikolas Kantas

Density tempering (also called density annealing) is a sequential Monte Carlo approach to Bayesian inference for general state models; it is an alternative to Markov chain Monte Carlo. When applied to state space models, it moves a…

Methodology · Statistics 2022-04-05 David Gunawan , Robert Kohn , Minh Ngoc Tran

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

Particle Markov Chain Monte Carlo methods are used to carry out inference in non-linear and non-Gaussian state space models, where the posterior density of the states is approximated using particles. Current approaches usually perform…

Computation · Statistics 2019-09-30 Eduardo F. Mendes , Christopher K. Carter , David Gunawan , Robert Kohn

Stochastic gradient Markov chain Monte Carlo (SG-MCMC) has been increasingly popular in Bayesian learning due to its ability to deal with large data. A standard SG-MCMC algorithm simulates samples from a discretized-time Markov chain to…

Machine Learning · Statistics 2017-11-30 Changyou Chen , Ruiyi Zhang

Gaussian processes allow for flexible specification of prior assumptions of unknown dynamics in state space models. We present a procedure for efficient Bayesian learning in Gaussian process state space models, where the representation is…

Computation · Statistics 2016-04-18 Andreas Svensson , Arno Solin , Simo Särkkä , Thomas B. Schön

Nonlinear non-Gaussian state-space models arise in numerous applications in statistics and signal processing. In this context, one of the most successful and popular approximation techniques is the Sequential Monte Carlo (SMC) algorithm,…

Computation · Statistics 2016-04-20 Francois Septier , Gareth W. Peters

We consider the generic problem of performing sequential Bayesian inference in a state-space model with observation process y, state process x and fixed parameter theta. An idealized approach would be to apply the iterated batch importance…

Computation · Statistics 2012-01-30 Nicolas Chopin , Pierre E. Jacob , Omiros Papaspiliopoulos

Due to the escalating growth of big data sets in recent years, new Bayesian Markov chain Monte Carlo (MCMC) parallel computing methods have been developed. These methods partition large data sets by observations into subsets. However, for…

Methodology · Statistics 2019-01-21 Zheng Wei , Erin M. Conlon