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.
Sequential importance resampling for Feynman–Kac path targets
Definition
Use the finite-horizon target and proposal setting of Feynman–Kac path targets and normalizers. For admissible inputs require and, for each , for almost every under the last-coordinate marginal of the proposal path law . Select the joint measurable versions and supplied by Feynman–Kac path Radon–Nikodym weight. Fix and select either multinomial or residual resampling at each time. The algorithm returns a weighted empirical path measure and a normalizer estimate.
- Draw independently from . Set and . If , put ; otherwise put . Each initial path is .
- For , do the following:
- Apply Multinomial and residual offspring resampling to the previous normalized weights , obtaining ancestor indices .
- Given the previous paths and these indices, draw with joint conditional law and set .
- Set and . If , put ; otherwise put .
- Return and the weighted empirical path probability measure . Its last-coordinate marginal is the corresponding empirical filtering approximation.
The all-zero fallback only defines a probability measure for reporting and future sampling. Once a zero average weight occurs, remains zero. The procedure makes no finite-particle accuracy, consistency, or long-time stability claim.
The input convention is that is the requested horizon, is a proposal probability on , are proposal probability kernels for , and with . Thus the opening support condition ranges over , and a resampling scheme is selected for each such . Choose the finite-valued joint measurable versions and constructed in the proof of Feynman–Kac path Radon–Nikodym weight.
Remarks
Resampling can add immediate sampling variance while reducing the chance that low-weight particles are carried forward. A trigger based only on current weight imbalance is a computational rule, not a certificate of target coverage or convergence.
Depends on
Used by
- Conditional particle filter for particle Gibbs Algorithm
- Fixed-lag particle smoother Algorithm
- Full-resampling fixed-level SIR splitting with invariant mutations Algorithm
- Particle backward simulator Algorithm
- Particle Gibbs with backward simulation Algorithm
- Particle marginal Metropolis–Hastings Algorithm
- Rao–Blackwellized particle filter Algorithm
- A particle proposal can miss positive target mass Counterexample
- Conditional future means alone do not bound finite-particle SIR error Counterexample
- Backward-simulation particle Gibbs extended target Definition
- Finite-horizon SMC CLT classes and variance recursions Definition
- Particle Gibbs extended target Definition
- Bootstrap and informed proposals on a two-state particle filter Example
- Conditional mutation and weighted correction CLT Lemma
- Finite-horizon bootstrap particle filters are weakly consistent Lemma
- Finite-horizon SMC empirical laws converge for integrable tests Lemma
- The conditional particle Gibbs sweep is a Gibbs update Theorem
- The particle Gibbs extended target has the exact smoothing marginal Theorem
- The sequential particle estimator is unbiased for Feynman–Kac path integrals Theorem
Dependency tree · two levels
20 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
- Arnaud Doucet and Adam M. Johansen, A Tutorial on Particle Filtering and Smoothing: Fifteen Years Later, §§3.3–3.5 (standard reference, not scraped)
- Simo Särkkä and Lennart Svensson, Bayesian Filtering and Smoothing, 2nd ed., §§11.2–11.5 (standard reference, not scraped)
- Nicolas Chopin, Central Limit Theorem for Sequential Monte Carlo Methods and its Application to Bayesian Inference, §§2.1–2.2 (standard reference, not scraped)