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.
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.
Depends on
Used by
Dependency tree · two levels
31 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
- Andrieu, Doucet, and Holenstein, Particle Markov chain Monte Carlo methods, §§4.3 and 4.5 (standard reference, not scraped)
- 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 (standard reference, not scraped)