How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Particle MCMC: PMMH and particle Gibbs
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Estimators and Randomized Procedures
- Feynman–Kac targets and sequential particle filters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- General-state Markov kernels, invariance, and reversibility
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Infinite Product Measures and Kolmogorov Extension
- Lebesgue-Stieltjes Measures and Distribution Functions
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Loss, Risk and Decision Theory
- Markov Kernels and Markov Chains
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Metropolis–Hastings kernels
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Recurrence Transience and Hitting Times for Markov Chains
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Scientific model contracts and applicability
- SCM, DAGs, adjustment
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Standard-Borel Real Codings and Determining Classes
- State-space model laws
- State-space models and exact Bayesian filtering
- Stationary Markov Chains and Ergodic Limits
- Stationary means and sample autocovariance
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
Particle marginal Metropolis–Hastings (PMMH) is an exact pseudo-marginal Metropolis update when the likelihood estimator is nonnegative, measurable, and unbiased for a finite-horizon state-space likelihood. Its extended state includes all particle randomness, the selected path index, and the likelihood estimate; rejection retains that complete state. Monte Carlo within Metropolis (MCWM) redraws the current estimate and can lose the exact posterior, as the finite counterexample shows.
Particle Gibbs here uses multinomial resampling with ancestor labels in sampled order and a conditional particle filter on a fixed-horizon path target. PMMH may use either declared unbiased offspring scheme. The particle cloud, ancestor indices, and selected trajectory index form an explicit extended target whose selected parameter-path marginal is the exact smoothing posterior for every fixed . In a conditional particle Gibbs sweep, the posterior parameter draw followed by conditional filter regeneration is one joint conditional block given the retained path and lineage; the terminal index is then drawn from its categorical conditional. A density-based backward-simulation variant uses the displayed backward probabilities and a conditional auxiliary particle filter. Its posterior parameter draw and filter regeneration form a joint conditional block, followed by the backward-index conditional. The target and proposal kernels vary measurably with the standard-Borel parameter. Full target-path support, finite positive evidence, and measurable proposal weights are also required. The explicit conditional formulas hold on measurable full-posterior-measure reference sets; exceptional reference values use a measurable unchanged-state fallback. Finite- invariance does not imply fast mixing, as the sticky finite example illustrates.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Particle marginal Metropolis–Hastings
Definition
Fix observations , a standard-Borel parameter space , a prior probability , and the finite-horizon Feynman–Kac path model in Feynman–Kac path targets and normalizers. Write Require every prefix normalizer for and -almost every , together with ; then the parameter posterior is
For fixed particle count , let contain the full output of Sequential importance resampling for Feynman–Kac path targets at and a terminal index drawn conditionally with its final normalized weight. Let be this measurable auxiliary-variable probability kernel and let be jointly measurable and nonnegative in . The required interface is The sequential particle estimator is unbiased for Feynman–Kac path integrals supplies this identity under its finite-horizon support and integrability hypotheses. Define the extended target probability by
Given current , propose and then . Apply the general Metropolis–Hastings construction Metropolis–Hastings kernel to this proposal kernel and target . On rejection retain the entire current pair , including its stored likelihood estimate and selected path index. When and have densities and , and the current extended target density is positive, the acceptance probability is For the displayed density-ratio formula, initialize at a current state where . The density-free version uses the accepted-flow Radon–Nikodym construction in the cited general-state algorithm; it does not evaluate a pointwise prior mass or require this density condition. Proposed zero estimates are rejected. The input is the current extended state ; output the proposed extended state on acceptance and retain on rejection.
The selected path stored in is part of the auxiliary state. Refreshing its estimate after rejection defines the different Monte Carlo within Metropolis procedure, not this algorithm.
PMMH preserves the exact parameter posterior
Statement
Under the hypotheses of Particle marginal Metropolis–Hastings, assume the unbiasedness identity there holds and the evidence is finite and positive. Then is a probability measure whose parameter marginal is . With the terminal index included in , the joint marginal of is the posterior . The PMMH transition kernel is reversible, hence invariant, for ; its parameter and selected-path marginals are therefore exact for every fixed . This is an invariance result only; it asserts no irreducibility, uniqueness, convergence rate, or mixing speed.
Facts & Assumptions
Given: The hypotheses of Particle marginal Metropolis–Hastings, including the finite positive evidence, the unbiased particle likelihood estimate, and retention of the full auxiliary state after rejection.
The Axiom of Choice: the path Radon–Nikodym suppliers assume AC.
Particle marginal Metropolis–Hastings: , and the proposal on is .
The sequential particle estimator is unbiased for Feynman–Kac path integrals: for each nonnegative measurable path test function with finite target integral, ; in particular .
Metropolis–Hastings kernel: the general accepted-flow construction defines the accept/reject transition rule and retains rejected proposals as self-transitions.
Metropolis–Hastings flow is reversible and invariant: that rule is a probability kernel, reversible and invariant for its probability target.
Invariant and stationary distribution for a Markov kernel: invariance means equality of the target measure after integrating the transition kernel.
Proof
Given: [A1] and the hypotheses in the Statement.
Integrating [F1] first in gives by [F2]. Its total mass is , so is a probability and its parameter marginal is .
For a measurable set of parameter-path pairs, summing over the terminal index gives , because the sum is the weighted empirical path integral in [F2]. Thus the selected path marginal is the joint posterior.
The proposal in [F1] is a probability kernel because it is the composition of the probability kernel and the auxiliary probability kernels . Applying [F3] to this target and proposal defines the PMMH accept/reject rule, which is a probability kernel by [F4]; in the common-density case the factors cancel between the target and proposal ratios, leaving exactly the displayed ratio in Particle marginal Metropolis–Hastings. On rejection, [F3] retains the current extended state.
By [F4], this extended-space kernel is reversible and invariant for . Applying the measurable coordinate projections and to the invariant law gives the exact marginals in steps 1.1 and 2.1, in the sense of [F5].
Monte Carlo within Metropolis
Definition
Use the parameter and likelihood-estimator inputs of Particle marginal Metropolis–Hastings, restricted to the common-density case where the prior has density and the proposal kernel has transition density with respect to a common parameter reference measure. Initialize at a parameter with , and assume for -almost every at every parameter that the procedure can propose or visit. These conditions make the displayed ratio defined almost surely. The input is the current parameter ; the output is the next parameter.
At each iteration draw a fresh , propose , and independently draw . Accept with probability Output on acceptance and on rejection. Discard both auxiliary values before the next iteration and draw a new current estimate.
This is Monte Carlo within Metropolis (MCWM). It does not retain a single extended state on rejection, so the pseudo-marginal invariance proof does not apply. This definition makes no exactness or stationarity claim.
Particle Gibbs extended target
Definition
Let be a standard-Borel parameter space with a prior . Use common standard-Borel state spaces and a jointly measurable parameterized target/proposal family: the initial and transition target and proposal laws are probability kernels in and their state arguments, the potentials are jointly measurable, and the chosen Radon–Nikodym weight versions are jointly measurable. Thus and are measure and probability kernels, and the SIR weights and normalizer are jointly measurable in . The prior-kernel law is a probability measure by A prior and model kernel define a joint law.
Use the finite-horizon state path model and proposal support conditions in Feynman–Kac path targets and normalizers, Feynman–Kac path Radon–Nikodym weight, and Sequential importance resampling for Feynman–Kac path targets. Select the multinomial resampling branch, returning ancestor indices in sampled order. Residual resampling is not the labeled particle law used by this genealogical construction. Write for the Feynman–Kac path measure at parameter and set . Assume for -almost every , and For a fixed particle count , write for the full particle system and ancestor indices generated by Sequential importance resampling for Feynman–Kac path targets. Its forward probability law at parameter is . The algorithm defines the product normalizer estimate and final normalized weights ; is a terminal particle index. The path means the states on the ancestral lineage of particle , traced through the arrays .
More explicitly, relative to counting measure on ancestor arrays and the ordered SIR proposal-kernel integrals for the states, Each factor is the categorical mass of that ancestor choice; no state transition density is assumed for the genealogical variant.
The genealogical particle Gibbs extended target is the measure The selected state is . The zero-weight fallback in the particle algorithm defines everywhere; when the extended target assigns the configuration zero mass.
The measure is a probability and has the exact joint smoothing posterior as its selected marginal by The particle Gibbs extended target has the exact smoothing marginal ↗.
Conditional-version convention
All particle variables, indices, parameter and retained-path coordinates are standard Borel. Under AC, Disintegration of a joint law on standard borel spaces supplies everywhere probability-kernel conditional versions of this extended target. The explicit conditional-filter formulas below identify those versions only outside a measurable null set of retained parameter-path-lineage values. Fix a measurable full-measure set on which the formulas are defined and normalized, intersected over the finitely many lineages and conditional updates. Reference paths are admitted through , rather than through an assertion about arbitrary points of topological support. On its complement a particle Gibbs sweep leaves the retained state unchanged. This identity fallback is measurable and changes the kernel only on a posterior-null set. The factorization theorem establishes the required full-measure property; no pointwise validity for arbitrary Radon–Nikodym versions is asserted.
Conditional particle filter for particle Gibbs
Definition
Fix , a finite horizon , a parameter , and a reference trajectory with a reference lineage of particle indices . Use the proposal kernels, incremental weights, and normalized resampling weights of Sequential importance resampling for Feynman–Kac path targets. Use multinomial resampling with indices in sampled order. Require target-path domination as in Feynman–Kac path Radon–Nikodym weight and a retained in the measurable full-measure good set of Particle Gibbs extended target. The formulas are conditional-law versions for posterior-almost every reference path; membership in topological support alone is insufficient. Outside , return status “unavailable” and leave the retained parameter-path-lineage state unchanged in the sweep. If an arithmetic operation in a sampled particle system is undefined or a required normalizing sum is zero/nonfinite, also return “unavailable” and retain the old state; on these events have conditional probability zero by the factorization theorem.
At fixed , use the parameter-specific proposal kernels and weights in Sequential importance resampling for Feynman–Kac path targets, writing its normalized resampling weights as . The input is ; the output is the conditional particle system, its normalized weights, its ancestry arrays, and either a successful status or “unavailable”.
- At time , draw each for independently from and set . Compute the SIR initial weights and set . If , put ; otherwise use the SIR zero-weight convention . A zero or nonfinite normalizing sum makes the sweep unavailable and returns the unchanged retained state.
- For , for every draw an ancestor from the categorical distribution with probabilities and then draw from the proposal kernel conditional on . Set and . Compute the SIR incremental weights and update . If the weight sum is positive, put ; otherwise use the SIR zero-weight convention . A zero or nonfinite normalizing sum makes the sweep unavailable and returns the unchanged retained state.
- Return the conditional particle system, its normalized weights, and its ancestry arrays.
For a joint parameter-path sweep, retain the current selected path and its lineage , draw from its exact posterior full conditional given , and apply Steps 1–3 at . This parameter draw followed by conditional-particle-filter regeneration is one joint conditional-block update. Then draw and trace its ancestry to obtain the next selected path. Output the new extended state together with that path. The correctness of this sweep is a separate result.
The particle Gibbs extended target has the exact smoothing marginal
Statement
Assume the hypotheses of Particle Gibbs extended target and Sequential importance resampling for Feynman–Kac path targets, with multinomial resampling in sampled order, including the finite-horizon support conditions and for prior-almost every , with . Then in Particle Gibbs extended target is a probability measure and its selected marginal is the exact joint parameter and smoothing posterior, for every .
Facts & Assumptions
Given: The finite-horizon path model, full-support proposal conditions, SIR particle system, and .
The Axiom of Choice: AC is assumed through the path Radon–Nikodym and probability-kernel suppliers.
Particle Gibbs extended target: and is the ancestry-traced path.
Sequential importance resampling for Feynman–Kac path targets: the terminal weights sum to one, is the product of average incremental weights, and the output weighted path measure is .
Feynman–Kac path Radon–Nikodym weight: the initial and incremental SIR weights convert each proposal path factor into the corresponding Feynman–Kac path factor under the stated support conditions.
Feynman–Kac path targets and normalizers: the normalized smoothing path target is when .
Proof
Given: [A1] and the hypotheses in the Statement.
Fix a terminal index and let be its ancestry, so . On a positive-weight particle system, [F1] has . In the forward SIR law [F2], the selected lineage contributes and its initial proposal . Substituting cancels all average-weight denominators, giving . The selected path factors are and by [F3]; all off-path factors are probability proposal/resampling kernels by [F2]. If any average weight is zero, the extended-target mass and selected target path measure are both zero at that step.
For each fixed lineage , the right side of step 1.1 integrates over the off-path variables to because those variables have the normalized SIR conditional law. There are exactly index sequences , and summing over them gives total mass one and selected marginal , which is the posterior by [F4].
The conditional particle Gibbs sweep is a Gibbs update
Statement
Under Particle Gibbs extended target and Conditional particle filter for particle Gibbs, for -almost every extended state the conditional law of the terminal index given is . For posterior-almost every retained parameter-trajectory-lineage value, the remaining particles and ancestor indices have exactly the conditional-particle-filter law in Conditional particle filter for particle Gibbs. In a joint sweep, the parameter draw from its posterior full conditional given the selected path, followed by regeneration of the remaining particles and ancestors from the conditional-particle-filter law, is the joint conditional-block update of those variables given the retained selected path and lineage. The terminal index is then drawn from its categorical conditional given the particle system. These two updates preserve the extended target; the measurable exceptional-state identity fallback specified by the algorithm is included. The selected marginal is the exact joint parameter-path posterior. This invariance does not assert fast mixing.
Facts & Assumptions
Given: A finite-horizon Feynman–Kac target, proposal path support, the multinomial SIR particle system with ancestor labels in sampled order, , and the extended target .
The Axiom of Choice: AC is assumed through the Radon–Nikodym weight versions and the standard-Borel disintegration supplying conditional versions.
Particle Gibbs extended target: ; the selected trajectory is the ancestry-traced path of .
Sequential importance resampling for Feynman–Kac path targets: the SIR forward law draws initial particles from , resamples each next ancestor from , propagates from the proposal kernel, and uses incremental weights .
Conditional particle filter for particle Gibbs: it fixes the reference path and lineage, samples every other particle and ancestor by those same SIR conditionals, and fixes each reference ancestor to the preceding reference index.
Feynman–Kac path Radon–Nikodym weight: the initial and transition proposal ratios convert and factors into the Feynman–Kac path measure under the stated support hypotheses.
The particle Gibbs extended target has the exact smoothing marginal: is a probability measure with the exact joint parameter-smoothing posterior as selected marginal.
Disintegration of a joint law on standard borel spaces: under AC a probability on a product of standard-Borel spaces has conditional probability kernels unique outside a single measurable marginal-null set.
Proof
Given: [A1] and the hypotheses in the Statement.
Since the only -dependent factor in [F1] is , and the final normalized weights sum to one, .
Fix a selected index and trace its lineage . On the positive-mass support of [F1], write , so . In the forward density [F2], the selected lineage contributes and its initial proposal . Substituting cancels each , leaving the selected path factor . If any average weight is zero, [F1] assigns the configuration zero extended-target mass, so its conditional law need not be specified there.
By the initial and transition Radon–Nikodym weight identities in [F4], the selected path factor in step 2.1 equals . All remaining factors are exactly the conditional SIR laws for the non-reference particles and ancestors in [F3]. Thus, conditional on the selected path and lineage, the remaining particle variables have the stated conditional-particle-filter law; the same factorization makes the lineage indices uniform given the selected path.
By [F5], the extended target is a probability on a standard-Borel product. Apply [F6] to the particle system conditional on its retained parameter-path-lineage variables. The normalized factorization in step 3.1 identifies its conditional kernel outside a single measurable marginal-null set; pull their exceptional events back to the common extended-state space and take the finite union over lineages and update blocks. This union has target mass zero. Its conditional probability given the retained parameter-path-lineage is therefore zero outside a measurable marginal-null set, by the defining integral identity in [F6]; remove that set to obtain in [F3]. The same restriction excludes infinite or zero denominators on the positive extended-target support. On the exceptional set the algorithm uses the identity transition on the retained state, so it remains an everywhere measurable probability kernel without claiming pointwise Radon–Nikodym identities at null reference values.
In the coordinates consisting of the selected path , its lineage , and the remaining particle variables , the factorization in step 3.1 gives the conditional law of given . Its leading factor is ; the factor makes uniform given and independent of , while the conditional law of given is exactly the conditional-particle-filter law in [F3]. Thus the posterior draw of given , followed by regeneration of with that filter, samples the joint conditional law of given . This is a conditional-block update; the parameter draw alone is not asserted to be conditional on the old full particle system.
The block in step 4.2 is the conditional law of given the retained , so replacing that block preserves by the defining conditional-probability identity. By step 1.1, the subsequent draw of given the regenerated particle system is its conditional law and also preserves . The exceptional-state identity modification changes the target integral only on a target-null set by step 4.1. Therefore their composition preserves , whose selected marginal is the exact posterior by [F5].
Backward-simulation particle Gibbs extended target
Definition
Assume the finite-horizon Feynman–Kac model and proposal support conditions in Feynman–Kac path targets and normalizers and Feynman–Kac path Radon–Nikodym weight. Use the multinomial SIR law with ancestor indices in sampled order. Residual resampling is not included in this labeled-density construction. For this variant, additionally assume that the initial target law has a measurable density , each target transition has a jointly measurable density , and each proposal transition has a density , all with respect to declared sigma-finite coordinate reference measures. Let be the proposal initial density with respect to the initial coordinate reference measure. Retain the proper-prior and positive-finite-evidence assumptions of Particle Gibbs extended target. Then the path measure has density Require positive finite denominators in the backward probabilities below on the extended-target support.
Write for all SIR particles and ancestor indices, for their forward joint density, and for a sequence of particle indices. Let be the path formed from states , without requiring . For , define The backward-simulation extended target is where the displayed expression is a density with respect to the common particle reference measures, counting measure on ancestor and selected indices, and the prior measure on . The complete SIR forward density includes the normalized ancestor probabilities and proposal densities for every particle. This is the backward-simulation extension of the particle Gibbs target; its exact selected-path marginal and Gibbs conditionals are proved in The backward-simulation sweep is a Gibbs update ↗.
Conditional-version convention
Interpret all displayed ratios on their common positive finite denominator sets and set the density to zero elsewhere. The theorem below proves these versions agree with the extended target and its conditional laws almost everywhere. By Disintegration of a joint law on standard borel spaces, fix a common measurable full-posterior-measure good set of retained parameter-path-index values on which the normalized conditional auxiliary filter and backward-index formulas are valid. This also excludes exceptional reference values of the chosen density/Radon–Nikodym versions. Off this set, the sweep is the identity on the retained state. A reference value being in topological support is not a replacement for this almost-everywhere convention.
Particle Gibbs with backward simulation
Definition
Use the density, support, and positive-denominator hypotheses of Backward-simulation particle Gibbs extended target. Select multinomial resampling with ancestor indices in sampled order. Fix . Before updating, require the retained parameter-path-index triple to be in , the set fixed in the Conditional-version convention of Backward-simulation particle Gibbs extended target; otherwise return the unchanged extended state. If a required ratio is undefined or nonfinite, or a required denominator or normalizing sum is zero or nonfinite during a sweep, return the old retained state. A finite zero density ratio is valid: assign that particle zero weight and continue. The factorization theorem proves that the stated failures have conditional probability zero on the designated full-measure set.
A backward-simulation sweep takes the current extended state , where selects the reference path from . It returns the updated extended state and selected path . First draw from its exact posterior full conditional given and the observations. If is outside , return the old extended state.
The initial proposal, non-reference resampling and propagation, and SIR weight updates use Conditional particle filter for particle Gibbs in its density setting. Because is a backward index sequence rather than an ancestral lineage, the reference particle's ancestor is sampled from below instead of being fixed to the preceding reference index.
- Initialize the conditional auxiliary particle filter at time : set and independently draw for . For each , compute the SIR initial weight . If , set ; otherwise use the SIR zero-weight convention .
- For , do the following in order:
- For each , draw categorically with probabilities and then draw .
- Set and draw its ancestor categorically with probabilities .
- For every , compute . If , set ; otherwise use the SIR zero-weight convention .
- Draw categorically with probabilities . For , draw with probabilities . Return the updated extended state and selected path.
The zero-weight conventions above define normalized weights as in Sequential importance resampling for Feynman–Kac path targets. Retain zero individual density ratios, importance weights, and backward probabilities. If a required ratio is undefined or nonfinite, a backward-probability denominator is zero or nonfinite, or a weight sum is zero or nonfinite, return the old extended state as specified above. On the designated good set these exceptional events have conditional probability zero. For , Step 2 is empty and Step 3 draws from .
The conditional auxiliary particle filter and the backward simulator are the two particle-coordinate conditionals of Backward-simulation particle Gibbs extended target. Their Gibbs interpretation and exact posterior marginal are separate proved properties.
The backward-simulation sweep is a Gibbs update
Statement
Under Backward-simulation particle Gibbs extended target and Particle Gibbs with backward simulation, for posterior-almost every retained state in the stated good set, the conditional law of the remaining particle system given is the stated conditional auxiliary particle filter, and the conditional law of the index sequence given is the backward simulator with terminal weights and backward probabilities . In a joint sweep, the posterior draw of given the selected path, followed by conditional auxiliary-particle filter regeneration, is the joint conditional-block update of the parameter and remaining particle variables given the retained path and index sequence. The backward-index draw is then its conditional update given . The extended target is a probability measure whose selected marginal is the exact joint smoothing posterior. With the measurable identity fallback on exceptional retained states, these updates preserve the extended target for every fixed . No fast-mixing or ergodicity claim follows.
Facts & Assumptions
Given: The density-based finite-horizon target, full target-path support, positive finite backward denominators, and the multinomial SIR particle law with ancestor labels in sampled order.
The Axiom of Choice: AC is assumed through the Radon–Nikodym path weights and standard-Borel disintegration.
Backward-simulation particle Gibbs extended target: the extended density is the target path density times the SIR forward density divided by the selected particles' proposal densities, with the product of backward probabilities and uniform index factor .
Particle Gibbs with backward simulation: the conditional auxiliary particle filter fixes reference states, draws their ancestors from , and uses SIR transitions for the other particles; the backward simulator draws by and then each by .
Feynman–Kac path Radon–Nikodym weight: on target support, each proposal weight is the target path factor divided by the corresponding proposal factor.
Feynman–Kac path targets and normalizers: is the unnormalized state-path measure, and is a probability posterior when .
Disintegration of a joint law on standard borel spaces: under AC conditional probability kernels exist and are unique outside a single measurable marginal-null set on standard-Borel products.
Proof
Given: The hypotheses in the Statement.
Write for the unnormalized importance weight of particle using its actual ancestor . On the proposal-support set in [F3], and . These product identities include zero weights and zero transition densities; they require no division by an alternative-parent transition density. Put and . Whenever the prescribed normalizers are positive and finite, and .
Fix a backward index sequence and its reference path. Expanding the forward density in [F1] and canceling the selected initial proposal and each selected joint ancestor-proposal factor gives . The bracketed factors are exactly the non-reference resample-and-propagate law and the categorical backward ancestor law in [F2]. For target-almost every retained path, its initial target factor and all its potentials are positive. The reference initial weight is therefore positive on the supplied proposal-support set. Inductively, a reference ancestor drawn from has positive preceding weight and transition density, so its new importance weight is positive there as well. Thus each weight sum remains positive; zero individual free-particle weights cause no failure. The prescribed support and finite-denominator conventions exclude the remaining exceptional ratios almost everywhere. Each categorical or proposal factor then integrates to one, so this is the normalized conditional auxiliary particle filter.
Fix on its forward-support set with positive finite required normalizers. In [F1], cancel each selected ancestor probability against the numerator of its backward factor, then use the product identities in step 1.1 to absorb each potential into the actual-parent weight. The extended density becomes . This equality merely regroups products; no weight or transition density is divided out. A zero selected weight or path-transition factor gives zero mass on both sides. Index sequences encountering a zero backward denominator likewise have zero mass: a positive terminal weight has a positive actual-parent factor, and a positive backward draw recursively has positive preceding weight. Set these zero-mass terms to zero as prescribed by [F1]. The prefactor is independent of , and summing the remaining factors from through gives one by their categorical normalization. Thus the index conditional is exactly the backward simulator in [F2], including , when the product is empty.
By step 1.2, for each fixed the other particle variables have a normalized conditional law. The leading factor is by [F4]. There are index sequences, so integrating the remaining variables and summing over them gives total mass one and selected marginal .
The standard-Borel state and particle spaces permit [F5] to be applied to the probability target in step 2.2. The normalized factorizations in steps 1.2 and 2.1 identify its conditional kernels outside measurable marginal-null sets. Pull exceptional events back to the common extended-state space and take their finite union over index sequences and sweep blocks; its target mass is zero. By the conditional integral identity in [F5], its conditional probability given the retained variables is zero outside a measurable marginal-null set. Removing this set gives the good set specified in [F1]–[F2]. On its complement the algorithm retains the old state; undefined ratio or normalization events within a conditional factorization have zero conditional mass on this good set. Thus the stated formulas and their measurable fallback define conditional-law versions almost everywhere, without assuming arbitrary reference points admit valid density ratios.
In coordinates consisting of the selected path , its index sequence , and the remaining particle variables , the factorization in step 1.2 shows that the conditional law of given is obtained by first drawing from its posterior full conditional given and then drawing from the conditional auxiliary-particle-filter law. The factor is constant in and , so the old particle system has been marginalized in this joint conditional block. Thus the first two updates in the algorithm, parameter draw and filter regeneration, together preserve the extended target. By step 2.1, the following backward-index draw is the conditional law of given and also preserves that target. The exceptional-state identity modifications do not change its integral by step 3.1, and the selected marginal in step 2.2 remains exact.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Andrieu, Doucet, and Holenstein, Particle Markov chain Monte Carlo methods, §§2.4.2, 4.4, Theorem 4
- Särkkä and Svensson, Bayesian Filtering and Smoothing, 2nd ed., §16.3.5
- Lindsten and Schön, On the use of backward simulation in particle Markov chain Monte Carlo methods (arXiv 1110.2873v2), §§3–4
- Andrieu, Doucet, and Holenstein, Particle Markov chain Monte Carlo methods, §4.4 and Theorem 4
- Andrieu, Doucet, and Holenstein, Particle Markov chain Monte Carlo methods, §4.4 and discussion of pseudo-marginal updates
- Andrieu, Doucet, and Holenstein, Particle Markov chain Monte Carlo methods, §§4.3–4.5 and equation (36)
- Lindsten and Schön, On the use of backward simulation in particle Markov chain Monte Carlo methods (arXiv 1110.2873v2), §4.1 and Proposition 1
- Särkkä and Svensson, Bayesian Filtering and Smoothing, 2nd ed., §§11.2–11.5
- Andrieu, Doucet, and Holenstein, Particle Markov chain Monte Carlo methods, §§4.3 and 4.5
- Lindsten and Schön, On the use of backward simulation in particle Markov chain Monte Carlo methods (arXiv 1110.2873v2), §4.1
- Andrieu, Doucet, and Holenstein, Particle Markov chain Monte Carlo methods, §4.5, equations (36)–(37), and Theorem 5
- Andrieu, Doucet, and Holenstein, Particle Markov chain Monte Carlo methods, §§4.3 and 4.5, equations (33) and (36)
- Lindsten and Schön, On the use of backward simulation in particle Markov chain Monte Carlo methods (arXiv 1110.2873v2), §4.1, equations (6)–(7), Propositions 1–3, Appendix A
- Lindsten and Schön, On the use of backward simulation in particle Markov chain Monte Carlo methods (arXiv 1110.2873v2), §§3–4 and Algorithms 1–3
- Andrieu, Doucet, and Holenstein, Particle Markov chain Monte Carlo methods, §4.5 and Appendix A
- Lindsten and Schön, On the use of backward simulation in particle Markov chain Monte Carlo methods (arXiv 1110.2873v2), §4.1, Propositions 1–3, Appendix A