Interacting Particle Markov Chain Monte Carlo
Not on the map. Why?
Abstract (arXiv)
We introduce interacting particle Markov chain Monte Carlo (iPMCMC), a PMCMC method based on an interacting pool of standard and conditional sequential Monte Carlo samplers. Like related methods, iPMCMC is a Markov chain Monte Carlo sampler on an extended space. We present empirical results that show significant improvements in mixing rates relative to both non-interacting PMCMC samplers, and a single PMCMC sampler with an equivalent memory and computational budget. An additional advantage of the iPMCMC method is that it is suitable for distributed and multi-core architectures.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 16 Feb 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 2; 2024: 0; 2025: 0; 2026: 1.
6 papers.
- 2021Nested Variational Inferencecited by 14
- 2022Interacting Contour Stochastic Gradient Langevin Dynamicscited by 9
- 2022Nonlinear MCMC for Bayesian Machine Learningcited by 2
- 2023Rethinking Variational Inference for Probabilistic Programs with Stochastic Supportcited by 2
- 2026Thinned Mean Field Langevin Dynamicscited by 1
- 2023Beyond Bayesian Model Averaging over Paths in Probabilistic Programs with Stochastic Supportcited by 0
- 2026Thinned Mean Field Langevin Dynamics27 May 2026
- 2023Rethinking Variational Inference for Probabilistic Programs with Stochastic Support1 Nov 2023
- 2023Beyond Bayesian Model Averaging over Paths in Probabilistic Programs with Stochastic Support23 Oct 2023
- 2022Interacting Contour Stochastic Gradient Langevin Dynamics20 Feb 2022
- 2022Nonlinear MCMC for Bayesian Machine Learning11 Feb 2022
- 2021Nested Variational Inference21 Jun 2021