--- title: Bidirectional Monte Carlo (BDMC) url: https://www.emergentmind.com/topics/bidirectional-monte-carlo-bdmc type: topic --- # Bidirectional Monte Carlo (BDMC) Bidirectional Monte Carlo (BDMC) is a technique for obtaining accurate stochastic upper and lower bounds on the marginal likelihood (log-ML) or, more generally, for bounding the divergence between approximate and true posterior distributions in probabilistic models. BDMC operates by running annealed importance sampling (AIS) or sequential Monte Carlo (SMC) both in the forward (prior to posterior) and reverse (posterior to prior) directions, capitalizing on the reversibility of these algorithms when initialized with exact samples from the target distribution. This framework yields sandwich bounds on log marginal likelihood, facilitates precise model evidence estimation, and underpins key diagnostics for Markov chain Monte Carlo (MCMC) inference—especially within the context of simulated data where exact posterior samples are available [1606.02275][1511.02543]. ## 1. Foundations: Annealed Importance Sampling and Marginal Likelihood Estimation Marginal likelihood estimation is central to Bayesian model selection but typically involves intractable integrals over latent variables and parameters. Annealed importance sampling (AIS) addresses this challenge by defining a sequence of unnormalized densities $\{f_t(x)\}_{t=1}^T$, each associated with a distribution $p_t(x) = f_t(x)/Z_t$. The sequence interpolates from an initial distribution ($p_1$, e.g., the prior with known $Z_1$) to the posterior ($p_T$) [1511.02543]. The process involves reversible MCMC kernels $T_t(\cdot|\cdot)$ to transition between successive distributions. An AIS run produces a nonnegative unbiased estimate $\hat W$ of the partition function ratio $R = Z_T/Z_1$ and an approximate sample from the terminal distribution. The estimator has key properties: - $\mathbb{E}[\hat W] = R$, thus $\log \hat W$ is a stochastic lower bound on $\log R$. - The marginal distribution of the final AIS sample, $q(x_T)$, does not generally coincide with $p_T$ due to potential lack of kernel mixing [1606.02275]. ## 2. The BDMC Method: Forward and Reverse AIS BDMC extends AIS by running the chain in both directions—forward (prior to posterior) and reverse (posterior to prior)—exploiting the fact that, with an exact sample $x_T \sim p_T$, one can run the same sequence backward to obtain unbiased importance weights for $Z_1/Z_T$ [1511.02543]. Pseudocode outlining both passes: | Step | Forward AIS | Reverse AIS | |-------------------------|--------------------------------------------------------|-----------------------------------------------------------------| | Initialization | $x_1 \sim p_1$ | $x_T \sim p_T$ (exact) | | Weight update | $w \leftarrow w \cdot [f_t(x_{t-1})/f_{t-1}(x_{t-1})]$ | $w \leftarrow w \cdot [f_{t-1}(x_t)/f_t(x_t)]$ | | State transition | $x_t \sim T_t(\cdot|x_{t-1})$ | $x_{t-1} \sim T_t(\cdot|x_t)$ | | Output | $L = \log w_F$ (lower bound) | $U = -\log w_R$ (upper bound) | With these, BDMC provides: - $L \leq \log R$ (stochastic lower bound) - $U \geq \log R$ (stochastic upper bound) - As $T \rightarrow \infty$ and kernels mix, $L \rightarrow \log R \leftarrow U$ [1511.02543][1606.02275]. ## 3. Divergence Bounding and Theoretical Guarantees The gap $\Delta = U - L$ serves not only as a diagnostic for marginal likelihood estimation but also upper-bounds, in expectation, the symmetrized Kullback–Leibler (Jeffreys) divergence between the distribution of AIS samples $q(x_T)$ and the true posterior $p_T(x)$. Formally, $$ \mathbb{E}[U - L] \geq D_{\mathrm{KL}}(q||p_T) + D_{\mathrm{KL}}(p_T||q) \equiv J(q, p_T) $$ Thus, $B \equiv \mathbb{E}[\Delta]$ is an upper bound on the Jeffreys divergence, making BDMC a tool not only for model evidence calibration but also posterior quality diagnostics [1606.02275]. ## 4. The BREAD Protocol for Real-Data Validation Exact posterior samples are available on simulated data but not on real datasets. The BREAD (Bounding Divergences with REverse Annealing) protocol addresses this by: 1. Running the chosen inference method (e.g., Stan, WebPPL) on real data to estimate hyperparameters $\hat\theta$. 2. Simulating synthetic data $\tilde{D} \sim p(D | \hat\theta)$. 3. Performing BDMC on $\tilde{D}$ to compute $(L_{\mathrm{synth}}, U_{\mathrm{synth}})$ and $\Delta_{\mathrm{synth}}$. 4. Comparing convergence curves for $L_{\mathrm{real}}(T)$ versus $L_{\mathrm{synth}}(T)$ across $T$. If these are similar, one can trust $\Delta_{\mathrm{synth}}$ as a proxy for the true Jeffreys divergence on real data. 5. In hierarchical models, a brief MCMC warm-up initialized at $\hat\theta$ may approximate posterior draws for the reverse AIS pass; empirically, a small number of steps suffice [1606.02275]. ## 5. Implementation in Probabilistic Programming Systems BDMC and BREAD require several system-level features: - **Tempering hooks:** Evaluating unnormalized log-densities at arbitrary inverse temperatures $\beta_t$. Stan required a power-posterior API; WebPPL involved trace-based evaluation with a $\beta$ exponent on likelihood terms. - **Reversible kernels:** Choice of Metropolis–Hastings (WebPPL) or Hamiltonian Monte Carlo/No-U-Turn Sampler (HMC/NUTS in Stan), ensuring correct invariance per $p_t$. - **AIS weight tracking:** Inference engine modifications to return $L$ and allow reverse-path execution. - **Orchestration scripts:** Automating the BREAD protocol—hyperparameter estimation, synthetic dataset simulation, BDMC runs, and curve comparison [1606.02275]. Empirical studies demonstrated that the representation of latent-variable models (collapsed vs. uncollapsed) can have significant effects on convergence rates and computational cost, motivating BDMC/BREAD as practical design tools. ## 6. Empirical Performance and Comparative Findings Application of BDMC to small-dimension latent-variable models (mixtures, matrix factorization, binary-attribute linear-Gaussian) showed the following: - The gap $\log U - \log L$ can routinely be driven below 1 nat, yielding near-oracle accuracy for log marginal likelihood. - The upper bound $B$ on the Jeffreys divergence is within 10–30% of the exact value, even with poor mixing. - Standard estimators (BIC, simple SIS, harmonic mean estimator, VB) were often inaccurate compared to BDMC, with only AIS, SMC (single-particle), and Nested Sampling achieving $\sim$10 nat RMSE efficiently [1511.02543]. - BDMC identified implementation bugs (e.g., in WebPPL's multivariate-Gaussian sampler) by detecting reversals of the expected $U