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.
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.
Depends on
Used by
Dependency tree · two levels
25 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 (standard reference, not scraped)