mlsanityData to 14 Oct 2026

Chebyshev Particles

arXiv 2309.06373 ↗First posted 10 Sep 2023cs.AI cs.IT math.ITcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 1 of its 31 references that are in the map. First posted on arXiv 10 Sep 2023.

Builds on

1 of 31 references.

References · 1

  1. 2015Getting Started with Particle Metropolis-Hastings for Inference in Nonlinear Dynamical Modelscited by 6

Built on by

Not cited yet.