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 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.
Depends on
Used by
Dependency tree · two levels
9 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- 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 (standard reference, not scraped)
- Andrieu, Doucet, and Holenstein, Particle Markov chain Monte Carlo methods, §4.5 and Appendix A (standard reference, not scraped)