English
Related papers

Related papers: Langevin and Hamiltonian based Sequential MCMC for…

200 papers

Sequential Monte Carlo (SMC) methods comprise one of the most successful approaches to approximate Bayesian filtering. However, SMC without good proposal distributions struggle in high dimensions. We propose nested sequential Monte Carlo…

Computation · Statistics 2016-12-30 Christian A. Naesseth , Fredrik Lindsten , Thomas B. Schön

Advances in digital sensors, digital data storage and communications have resulted in systems being capable of accumulating large collections of data. In the light of dealing with the challenges that massive data present, this work proposes…

Computation · Statistics 2015-12-09 Allan De Freitas , François Septier , Lyudmila Mihaylova

Sequential Monte Carlo (SMC), or particle filtering, is widely used in nonlinear state-space systems, but its performance often suffers from poorly approximated proposal and state-transition distributions. This work introduces a…

Machine Learning · Computer Science 2026-05-14 Wessel L. van Nierop , Nir Shlezinger , Ruud J. G. van Sloun

In many problems, complex non-Gaussian and/or nonlinear models are required to accurately describe a physical system of interest. In such cases, Monte Carlo algorithms are remarkably flexible and extremely powerful approaches to solve such…

Computation · Statistics 2015-04-23 Thi Le Thu Nguyen , Francois Septier , Gareth W. Peters , Yves Delignon

Sequential Monte Carlo Squared (SMC$^2$) is a Bayesian method which can infer the states and parameters of non-linear, non-Gaussian state-space models. The standard random-walk proposal in SMC$^2$ faces challenges, particularly with…

Machine Learning · Statistics 2024-07-25 Conor Rosato , Joshua Murphy , Alessandro Varsi , Paul Horridge , Simon Maskell

Switching state-space models (SSSM) are a very popular class of time series models that have found many applications in statistics, econometrics and advanced signal processing. Bayesian inference for these models typically relies on Markov…

Computation · Statistics 2010-11-11 Nick Whiteley , Christophe Andrieu , Arnaud Doucet

Sequential optimization methods are often confronted with the curse of dimensionality in high-dimensional spaces. Current approaches under the Gaussian process framework are still burdened by the computational complexity of tracking…

Machine Learning · Computer Science 2024-01-08 Zeji Yi , Yunyue Wei , Chu Xin Cheng , Kaibo He , Yanan Sui

The Hamiltonian Monte Carlo (HMC) sampling algorithm exploits Hamiltonian dynamics to construct efficient Markov Chain Monte Carlo (MCMC), which has become increasingly popular in machine learning and statistics. Since HMC uses the gradient…

Machine Learning · Computer Science 2019-06-04 Minghao Gu , Shiliang Sun

One of the key challenges in identifying nonlinear and possibly non-Gaussian state space models (SSMs) is the intractability of estimating the system state. Sequential Monte Carlo (SMC) methods, such as the particle filter (introduced more…

An effective approach for sampling from unnormalized densities is based on the idea of gradually transporting samples from an easy prior to the complicated target distribution. Two popular methods are (1) Sequential Monte Carlo (SMC), where…

Machine Learning · Statistics 2025-09-09 Junhua Chen , Lorenz Richter , Julius Berner , Denis Blessing , Gerhard Neumann , Anima Anandkumar

Hamiltonian Monte Carlo (HMC) sampling methods provide a mechanism for defining distant proposals with high acceptance probabilities in a Metropolis-Hastings framework, enabling more efficient exploration of the state space than standard…

Methodology · Statistics 2014-05-13 Tianqi Chen , Emily B. Fox , Carlos Guestrin

Langevin algorithms are popular Markov chain Monte Carlo (MCMC) methods for large-scale sampling problems that often arise in data science. We propose Monte Carlo algorithms based on the discretizations of $P$-th order Langevin dynamics for…

Machine Learning · Statistics 2025-08-26 Thanh Dang , Mert Gurbuzbalaban , Mohammad Rafiqul Islam , Nian Yao , Lingjiong Zhu

We consider a class of high-dimensional spatial filtering problems, where the spatial locations of observations are unknown and driven by the partially observed hidden signal. This problem is exceptionally challenging as not only is…

Methodology · Statistics 2024-03-07 Hamza Ruzayqat , Alexandros Beskos , Dan Crisan , Ajay Jasra , Nikolas Kantas

Sequential Monte Carlo (SMC) methods, also known as particle filters, constitute a class of algorithms used to approximate expectations with respect to a sequence of probability distributions as well as the normalising constants of those…

Computation · Statistics 2026-01-14 Axel Finke , Arnaud Doucet , Adam M. Johansen

Along with the recent advances in scalable Markov Chain Monte Carlo methods, sampling techniques that are based on Langevin diffusions have started receiving increasing attention. These so called Langevin Monte Carlo (LMC) methods are based…

Computation · Statistics 2017-06-14 Umut Şimşekli

Hamiltonian Monte Carlo (HMC) is a Markov chain Monte Carlo (MCMC) approach that exhibits favourable exploration properties in high-dimensional models such as neural networks. Unfortunately, HMC has limited use in large-data regimes and…

Machine Learning · Statistics 2020-10-15 Adam D. Cobb , Brian Jalaian

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

Sequential Monte Carlo (SMC), or particle filtering, is a popular class of methods for sampling from an intractable target distribution using a sequence of simpler intermediate distributions. Like other importance sampling-based methods,…

Machine Learning · Computer Science 2015-11-18 Shixiang Gu , Zoubin Ghahramani , Richard E. Turner

Markov Chain Monte Carlo (MCMC) is a well-established family of algorithms primarily used in Bayesian statistics to sample from a target distribution when direct sampling is challenging. Existing work on Bayesian decision trees uses MCMC.…

Computation · Statistics 2023-01-24 Efthyvoulos Drousiotis , Paul G. Spirakis , Simon Maskell

In Bayesian inference, Hamiltonian Monte Carlo (HMC) is a popular Markov Chain Monte Carlo (MCMC) algorithm known for its efficiency in sampling from complex probability distributions. However, its application to models with latent…

Computation · Statistics 2025-04-15 Alaa Amri , Víctor Elvira , Amy L. Wilson
‹ Prev 1 2 3 10 Next ›