Log In Sign Up

The divide-and-conquer sequential Monte Carlo algorithm: theoretical properties and limit theorems

by   Juan Kuntz, et al.

We revisit the divide-and-conquer sequential Monte Carlo (DaC-SMC) algorithm and firmly establish it as a well-founded method by showing that it possesses the same basic properties as conventional sequential Monte Carlo (SMC) algorithms do. In particular, we derive pertinent laws of large numbers, L^p inequalities, and central limit theorems; and we characterize the bias in the normalized estimates produced by the algorithm and argue the absence thereof in the unnormalized ones. We further consider its practical implementation and several interesting variants; obtain expressions for its globally and locally optimal intermediate targets, auxiliary measures, and proposal kernels; and show that, in comparable conditions, DaC-SMC proves more statistically efficient than its direct SMC analogue. We close the paper with a discussion of our results, open questions, and future research directions.


page 1

page 2

page 3

page 4


Simple conditions for convergence of sequential Monte Carlo genealogies with applications

Sequential Monte Carlo algorithms are popular methods for approximating ...

Limit theorems for sequential MCMC methods

Sequential Monte Carlo (SMC) methods, also known as particle filters, co...

Convergence of random-weight sequential Monte Carlo methods

We investigate the properties of a sequential Monte Carlo method where t...

Scalable Monte Carlo Inference and Rescaled Local Asymptotic Normality

Statisticians are usually glad to obtain additional data, but Monte Carl...

Zaionc paradox revisited

Canonical expressions are representative of implicative propositions upt...

A Detailed Analysis of Quicksort Algorithms with Experimental Mathematics

We study several variants of single-pivot and multi-pivot Quicksort algo...