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 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.
Depends on
- The Axiom of Choice
- Measures on sigma-algebras
- Probability measures and probability spaces
- Standard Borel spaces
- Measure kernel and probability kernel
- The product sigma-algebra and its finite iterates
- Metropolis–Hastings kernel
- Feynman–Kac path targets and normalizers
- Feynman–Kac path Radon–Nikodym weight
- Sequential importance resampling for Feynman–Kac path targets
- The sequential particle estimator is unbiased for Feynman–Kac path integrals
Used by
Dependency tree · two levels
49 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, §§2.4.2, 4.4, Theorem 4 (standard reference, not scraped)
- Särkkä and Svensson, Bayesian Filtering and Smoothing, 2nd ed., §16.3.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), §§3–4 (standard reference, not scraped)