Chebyshev Particles

Xiongming Dai, Gerald Baumgartner
9/10/2023
cs.AIcs.IT

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Markov chain Monte Carlo (MCMC) provides a feasible method for inferring Hidden Markov models, however, it is often computationally prohibitive, especially constrained by the curse of dimensionality, as the Monte Carlo sampler traverses randomly taking small steps within uncertain regions in the parameter space. We are the first to consider the posterior distribution of the objective as a mapping of samples in an infinite-dimensional Euclidean space where deterministic submanifolds are embedded and propose a new criterion by maximizing the weighted Riesz polarization quantity, to discretize rectifiable submanifolds via pairwise interaction. We study the characteristics of Chebyshev particles and embed them into sequential MCMC, a novel sampler with a high acceptance ratio that proposes only a few evaluations. We have achieved high performance from the experiments for parameter inference in a linear Gaussian state-space model with synthetic data and a non-linear stochastic volatility model with real-world data.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{dai2023chebyshev,
  title  = {Chebyshev Particles},
  author = {Xiongming Dai and Gerald Baumgartner},
  year   = {2023},
  eprint = {2309.06373},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2309.06373v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2309.06373.svg)](https://codeofpaper.com/paper/2309.06373)

Discussion