Convergence of random-weight sequential Monte Carlo methods
Not on the map. Why?
Abstract (arXiv)
We investigate the properties of a sequential Monte Carlo method where the particle weight that appears in the algorithm is estimated by a positive, unbiased estimator. We present broadly-applicable convergence results, including a central limit theorem, and we discuss their relevance for applications in statistical physics. Using these results, we show that the resampling step reduces the impact of the randomness of the weights on the asymptotic variance of the estimator. In addition, we explore the limits of convergence of the sequential Monte Carlo method, with a focus on almost sure convergence. We construct an example algorithm where we can prove convergence in probability, but which does not converge almost surely, even in the non-random-weight case.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 25 Aug 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1.
1 paper.
- 2023Simulating counterfactualscited by 1
- 2023Simulating counterfactuals27 Jun 2023