.png){kind=icon}
.png){kind=icon}
Return
Sequential Monte Carlo samplers
.png){kind=icon}
OA
AI
DOI：10.1111/j.1467-9868.2006.00553.x.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a methodology to sample sequentially from a sequence of probability distributions that are defined on a common space, each distribution being known up to a normalizing constant. These probability distributions are approximated by a cloud of weighted random samples which are propagated over time by using sequential Monte Carlo methods. This methodology allows us to derive simple algorithms to make parallel Markov chain Monte Carlo algorithms interact to perform global optimization and sequential Bayesian estimation and to compute ratios of normalizing constants. We illustrate these algorithms for various integration tasks arising in the context of Bayesian inference.
Keywords:
importance sampling
Markov chain Monte Carlo methods
ratio of normalizing constants
resampling
sequential Monte Carlo methods
simulated annealing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
J
IF:
3.6
Papers:
1.5K
Citations:
3.2W
Organization
No organization information available