The Application of Zig-Zag Sampler in Sequential Markov Chain Monte Carlo

• URL: http://arxiv.org/abs/2111.10210v1
• Date: Thu, 18 Nov 2021 02:15:41 GMT
• Title: The Application of Zig-Zag Sampler in Sequential Markov Chain Monte Carlo
• Authors: Yu Han, Kazuyuki Nakamura
• Abstract summary: In high-dimensional state space model, traditional particle filtering methods suffer the weight degeneracy. We propose to construct the Sequential Makov chian Monte Carlo framework by implementing the Composite-Hasting (MH) Kernel. We show that the proposed method improves estimation accuracy and increases the acceptance ratio compared with state-of-the-art filtering methods.
• Score: 4.278434189549703
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Particle filtering methods are widely applied in sequential state estimation within nonlinear non-Gaussian state space model. However, the traditional particle filtering methods suffer the weight degeneracy in the high-dimensional state space model. Currently, there are many methods to improve the performance of particle filtering in high-dimensional state space model. Among these, the more advanced method is to construct the Sequential Makov chian Monte Carlo (SMCMC) framework by implementing the Composite Metropolis-Hasting (MH) Kernel. In this paper, we proposed to discrete the Zig-Zag Sampler and apply the Zig-Zag Sampler in the refinement stage of the Composite MH Kernel within the SMCMC framework which is implemented the invertible particle flow in the joint draw stage. We evaluate the performance of proposed method through numerical experiments of the challenging complex high-dimensional filtering examples. Nemurical experiments show that in high-dimensional state estimation examples, the proposed method improves estimation accuracy and increases the acceptance ratio compared with state-of-the-art filtering methods.

Related papers

• Deep Variational Sequential Monte Carlo for High-Dimensional Observations [39.455729393887786]
  This work introduces a differentiable particle filter that leverages the unsupervised variational SMC objective to parameterize the proposal and transition distributions with a neural network. Experimental results demonstrate that our approach outperforms established baselines in tracking the challenging Lorenz attractor from high-dimensional and partial observations.
  arXiv  Detail & Related papers  (2025-01-10T14:10:19Z)
• Closed-form Filtering for Non-linear Systems [83.91296397912218]
  We propose a new class of filters based on Gaussian PSD Models, which offer several advantages in terms of density approximation and computational efficiency. We show that filtering can be efficiently performed in closed form when transitions and observations are Gaussian PSD Models. Our proposed estimator enjoys strong theoretical guarantees, with estimation error that depends on the quality of the approximation and is adaptive to the regularity of the transition probabilities.
  arXiv  Detail & Related papers  (2024-02-15T08:51:49Z)
• Iterated Denoising Energy Matching for Sampling from Boltzmann Densities [109.23137009609519]
  Iterated Denoising Energy Matching (iDEM) iDEM alternates between (I) sampling regions of high model density from a diffusion-based sampler and (II) using these samples in our matching objective. We show that the proposed approach achieves state-of-the-art performance on all metrics and trains $2-5times$ faster.
  arXiv  Detail & Related papers  (2024-02-09T01:11:23Z)
• Online Variational Sequential Monte Carlo [49.97673761305336]
  We build upon the variational sequential Monte Carlo (VSMC) method, which provides computationally efficient and accurate model parameter estimation and Bayesian latent-state inference. Online VSMC is capable of performing efficiently, entirely on-the-fly, both parameter estimation and particle proposal adaptation.
  arXiv  Detail & Related papers  (2023-12-19T21:45:38Z)
• Chebyshev Particles [0.0]
  We are first to consider the posterior distribution of the objective as a mapping of samples in an infinite-dimensional Euclidean space. We propose a new criterion by maximizing the weighted Riesz polarization quantity, to discretize rectifiable submanifolds via pairwise interaction. We have achieved high performance from the experiments for parameter inference in a linear state-space model with synthetic data and a non-linear volatility model with real-world data.
  arXiv  Detail & Related papers  (2023-09-10T16:40:30Z)
• Computational Doob's h-transforms for Online Filtering of Discretely Observed Diffusions [65.74069050283998]
  We propose a computational framework to approximate Doob's $h$-transforms. The proposed approach can be orders of magnitude more efficient than state-of-the-art particle filters.
  arXiv  Detail & Related papers  (2022-06-07T15:03:05Z)
• Hamiltonian Monte Carlo Particle Swarm Optimizer [0.0]
  Hamiltonian Particle Swarm (HMCPSO) is an optimization algorithm that reaps the benefits of both Exponentially Average sampling and HMC position and velocity.
  arXiv  Detail & Related papers  (2022-05-08T04:47:34Z)
• Flow-based sampling in the lattice Schwinger model at criticality [54.48885403692739]
  Flow-based algorithms may provide efficient sampling of field distributions for lattice field theory applications. We provide a numerical demonstration of robust flow-based sampling in the Schwinger model at the critical value of the fermion mass.
  arXiv  Detail & Related papers  (2022-02-23T19:00:00Z)
• Sampling in Combinatorial Spaces with SurVAE Flow Augmented MCMC [83.48593305367523]
  Hybrid Monte Carlo is a powerful Markov Chain Monte Carlo method for sampling from complex continuous distributions. We introduce a new approach based on augmenting Monte Carlo methods with SurVAE Flows to sample from discrete distributions. We demonstrate the efficacy of our algorithm on a range of examples from statistics, computational physics and machine learning, and observe improvements compared to alternative algorithms.
  arXiv  Detail & Related papers  (2021-02-04T02:21:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.