Divide-and-Conquer SMC for Complex Graphical Models

• Divide-and-Conquer SMC is a generalization of Sequential Monte Carlo that recursively decomposes complex inference tasks via an auxiliary tree structure.
• It enables efficient computation of integrals, normalization constants, and posterior expectations through local particle merging and adaptive resampling.
• The method supports parallel execution and optimal auxiliary design to improve estimation accuracy and reduce computational cost in high-dimensional models.

Divide-and-Conquer Sequential Monte Carlo (DaC-SMC) is a generalization of classical Sequential Monte Carlo (SMC) methodology designed for efficient inference in complex probabilistic graphical models, particularly those with non-chain structures such as high-dimensional fields or deeply nested hierarchies. DaC-SMC replaces the classical chain of particle approximations with a recursive process structured by an auxiliary tree, enabling recursive subproblem decomposition, parallelism, and increased estimation accuracy for marginal likelihoods and posterior expectations (Lindsten et al., 2014, Kuntz et al., 2021).

1. Tree-Structured Decomposition and Local Distributions

DaC-SMC targets computation of integrals and normalization constants for a distribution $\pi(x) = \gamma(x)/Z$ on a space $\mathcal X$. The method introduces an auxiliary rooted tree $T$ with nodes $t \in T$. Each node corresponds to a “sub-model” described by variables $X_t$ and an unnormalized density $\gamma_t$ over $X_t$, where

$$X_t = (\bigotimes_{c \in \mathcal C(t)} X_c) \times \tilde X_t,$$

$\mathcal C(t)$ denotes the set of children of node $t$, $\mathcal X$0 collects any new local variables introduced at $\mathcal X$1. The root node $\mathcal X$2 satisfies $\mathcal X$3, with the normalization $\mathcal X$4 for each $\mathcal X$5. This decomposition ensures that the support at each node is consistent with its subtree (Lindsten et al., 2014, Kuntz et al., 2021).

For each $\mathcal X$6, $\mathcal X$7 encodes the joint “potential” for the subgraph rooted at $\mathcal X$8. Marginals for children, $\mathcal X$9, are approximated independently and later merged. This enables recursive and modular particle approximations at multiple levels of the graphical model.

2. Algorithmic Structure and Pseudocode

The DaC-SMC algorithm recursively constructs weighted particle approximations at each tree node. The essential operations at each node $T$0 are:

• Child Recursion: For each child $T$1, recursively generate $T$2 weighted samples $T$3 approximating $T$4.
• Resampling: Optionally resample to produce $T$5 equally weighted samples per child.
• Particle Merging: Merge the $T$6 samples across children; simple merging takes the $T$7th sample from each child to form tuples.
• Local Mutation: For each merged tuple, sample $T$8 from a proposal $T$9 if new variables are introduced, and form $t \in T$0.
• Importance Weighting:

$t \in T$1

• Normalization and Output: Normalize weights, estimate marginal likelihood ($t \in T$2), and return the particle cloud to the parent.

Mixture-resampling and node-specific tempering/SMC samplers can be incorporated. Mixture-based merging samples tuples from a distribution adjusted by an approximate marginal to capture dependencies, with cost scaling as $t \in T$3 ($t \in T$4 = branching factor) (Lindsten et al., 2014).

Pseudocode for the core recursion (Lindsten et al., 2014):

1. For each child $t \in T$5: Run DaC-SMC$t \in T$6, resample to $t \in T$7 equally weighted samples.
2. Merge samples into $t \in T$8 tuples.
3. For $t \in T$9:
   • Sample $X_t$0 (if needed).
   • Set $X_t$1.
   • Compute $X_t$2 as above.
4. Normalize weights, estimate $X_t$3.
5. Return $X_t$4, $X_t$5.

Tempering can be added at each node via a sequence of intermediate distributions $X_t$6 with MCMC mutation kernels, providing controlled bridging between proposals and the target (Lindsten et al., 2014).

3. Theoretical Properties

DaC-SMC inherits and generalizes the strong asymptotic and unbiasedness properties of standard SMC algorithms:

• Unbiasedness: The unnormalized estimator $X_t$7 for the root's normalizing constant is unbiased: $X_t$8, given mild positivity and support conditions (Lindsten et al., 2014, Kuntz et al., 2021).
• Law of Large Numbers (LLN): As $X_t$9, all node-approximated integrals converge almost surely to their true values, including normalization constants and particle-approximated posteriors (Kuntz et al., 2021).
• $\gamma_t$0 Bounds: For all bounded test functions and $\gamma_t$1, estimation errors decay as $\gamma_t$2; normalized estimators incur bias of order $\gamma_t$3 under boundedness and positivity (Kuntz et al., 2021).
• Central Limit Theorems (CLT): Particle estimators for summations, normalization constants, and posteriors satisfy CLTs, with variances described via sums over the descendant subtrees and depend on the dependencies induced by the tree (Kuntz et al., 2021).
• Variance Growth: For balanced trees, the variance of $\gamma_t$4 grows at most linearly with tree size; this generalizes single-chain SMC results (Lindsten et al., 2014).

4. Optimality and Statistical Efficiency

The selection of auxiliary measures $\gamma_t$5 and local proposals $\gamma_t$6 critically affects the variance and efficiency of DaC-SMC:

• Globally Optimal (Zero-Variance) Choice: If the regular conditional distributions for the subtrees, $\gamma_t$7, and Markov proposals $\gamma_t$8 are available, setting $\gamma_t$9 and $X_t$0 yields a zero-variance estimator for the normalization constant (infeasible in general) (Kuntz et al., 2021).
• Locally Optimal Choices: For fixed $X_t$1, a locally optimal auxiliary is proportional to $X_t$2 (with $X_t$3). For fixed $X_t$4, $X_t$5 is optimal. Joint minimization yields the best local variance (Kuntz et al., 2021).
• Superiority to Standard SMC: For identical proposal kernels, DaC-SMC achieves asymptotic variance no greater than standard (chain-structured) SMC under comparable conditions, due to better exploitation of factorization and independence (Kuntz et al., 2021).

The following table summarizes the main optimality regimes: | Regime | Auxiliary Choice | Proposal Choice | Variance Result | |---------------------------|------------------------|-----------------------|-------------------------| | Globally optimal | $X_t$6 | $X_t$7 | Zero variance ($X_t$8) | | Locally optimal (fixed $X_t$9) | Function of $$X_t = (\bigotimes_{c \in \mathcal C(t)} X_c) \times \tilde X_t,$$0 and $$X_t = (\bigotimes_{c \in \mathcal C(t)} X_c) \times \tilde X_t,$$1 | $$X_t = (\bigotimes_{c \in \mathcal C(t)} X_c) \times \tilde X_t,$$2 as given | Minimum achievable for $$X_t = (\bigotimes_{c \in \mathcal C(t)} X_c) \times \tilde X_t,$$3 | | Locally optimal (fixed $$X_t = (\bigotimes_{c \in \mathcal C(t)} X_c) \times \tilde X_t,$$4) | $$X_t = (\bigotimes_{c \in \mathcal C(t)} X_c) \times \tilde X_t,$$5 as given | $$X_t = (\bigotimes_{c \in \mathcal C(t)} X_c) \times \tilde X_t,$$6 | Minimum achievable for $$X_t = (\bigotimes_{c \in \mathcal C(t)} X_c) \times \tilde X_t,$$7 |

5. Parallelization, Complexity, and Implementation

DaC-SMC’s tree-based structure enables natural parallelism and modularity:

• Parallelization: Sub-problems at each node’s children are independent and thus can be sampled and resampled in parallel; only merging and communication across cut edges are required (Lindsten et al., 2014).
• Complexity: Serial computational cost is $$X_t = (\bigotimes_{c \in \mathcal C(t)} X_c) \times \tilde X_t,$$8, where $$X_t = (\bigotimes_{c \in \mathcal C(t)} X_c) \times \tilde X_t,$$9 is the number of nodes. With small, balanced node degrees, complexity remains comparable to standard SMC but can be distributed to achieve much lower wall-clock time (Lindsten et al., 2014, Kuntz et al., 2021).
• Auxiliary Factorization: If auxiliary distributions at a node factor across children, both correction and resampling scale as $\mathcal C(t)$0. Use of mixture resampling or incomplete permutations allows further variance-cost control.
• Adaptive and Low-Variance Resampling: Resampling only when effective sample size (ESS) drops is viable; standard low-variance resampling schemes (stratified, systematic) can be applied without increasing computational cost.
• Resource Allocation: The number of particles $\mathcal C(t)$1 at different nodes can be assigned adaptively for targeted variance reduction (Kuntz et al., 2021).

Common practical recommendations include designing binary or low-degree trees, exploiting factorized auxiliaries, and adaptively tuning computational effort per subtree to manage overall variance.

6. Empirical Results and Applications

Empirical evaluations demonstrate DaC-SMC’s advantages in diverse settings (Lindsten et al., 2014):

• 64×64 Ising Model: DaC-SMC (with SIR, mixture, annealing, or hybridized) achieves significantly reduced root-mean-squared error (RMSE) in marginal likelihood and posterior expectation estimates compared to standard SMC for equal CPU times. Annealing and mixture resampling together halve the number of Markov chain Monte Carlo (MCMC) steps needed compared to pure annealing.
• Hierarchical Bayesian Logistic Regression: On NYC math test data, DaC-SMC achieves higher effective sample size per minute (ESS $\mathcal C(t)$2 600) than standard SMC ($\mathcal C(t)$3 540), Metropolis-within-Gibbs ($\mathcal C(t)$4 0.2), and Stan/NUTS ($\mathcal C(t)$5). With 10,000 particles, it reaches lower standard error in log marginal likelihood than standard SMC with ten times as many particles. In a parallel implementation (32 nodes), wall-clock time for $\mathcal C(t)$6 particles reduces from 75 minutes (serial) to under 5 minutes (distributed).

7. Extensions, Open Problems, and Research Directions

Current and future research on DaC-SMC includes:

• Optimal Auxiliary Design: Determining $\mathcal C(t)$7 that optimally trades statistical efficiency for computational cost remains an open question.
• Capturing General Dependence: Beyond product-form auxiliaries, exploring “partial U-statistic” patterns could allow richer conditional dependencies without losing linear sampling cost.
• Automatic and Adaptive Tree Construction: Strategies for data-driven or adaptive partitioning and tree structure selection to minimize variance or cost in complex models are an active area for development.
• Resampling and PMCMC Integration: Efficient, parallel resampling schemes for tree structures, and embedding DaC-SMC as proposal or transition kernels in Particle MCMC frameworks (Particle Metropolis–Hastings, particle Gibbs) require further theoretical and empirical analysis (Kuntz et al., 2021).
• Relaxing Technical Conditions: Asymptotic analysis under heavy-tailed weight distributions or infinite-dimensional local spaces.
• Benchmarking and Software: Open-source, large-scale benchmarks comparing DaC-SMC with standard SMC and MCMC approaches in real-world applications are identified as a community priority (Kuntz et al., 2021).

Key implications are that DaC-SMC provides a principled, parallelizable inference framework for broad classes of graphical models, maintaining unbiasedness, consistency, and in many cases improved efficiency relative to classical SMC, particularly for non-chain, hierarchical, or spatially structured models (Lindsten et al., 2014, Kuntz et al., 2021).