Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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 y1:T, a standard-Borel parameter space (Θ,T), a prior probability π0, and the finite-horizon Feynman–Kac path model in Feynman–Kac path targets and normalizers. Write Lθ(y1:T)=γθ,T(1),C=∫ΘLθ(y1:T) π0(dθ). Require every prefix normalizer 0<Zθ,t<∞ for t=0,…,T and π0-almost every θ, together with 0<C<∞; then the parameter posterior is πy(dθ)=C−1Lθ(y1:T) π0(dθ).

For fixed particle count N≥1, let U contain the full output of Sequential importance resampling for Feynman–Kac path targets at θ and a terminal index K∈{1,…,N} drawn conditionally with its final normalized weight. Let mθ(du) be this measurable auxiliary-variable probability kernel and let L^θ(U)=Z^T be jointly measurable and nonnegative in (θ,U). The required interface is ∫L^θ(u) mθ(du)=Lθ(y1:T); 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 π~(dθ,du)=C−1π0(dθ)mθ(du)L^θ(u).

Given current (θ,U), propose θ′∼R(θ,⋅) and then U′∼mθ′. Apply the general Metropolis–Hastings construction Metropolis–Hastings kernel to this proposal kernel and target π~. On rejection retain the entire current pair (θ,U), including its stored likelihood estimate and selected path index. When π0 and R have densities p0 and r, and the current extended target density is positive, the acceptance probability is 1∧p0(θ′)L^θ′(U′)r(θ∣θ′)p0(θ)L^θ(U)r(θ′∣θ). For the displayed density-ratio formula, initialize at a current state where p0(θ)L^θ(U)>0. 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 (θ,U); output the proposed extended state (θ′,U′) on acceptance and retain (θ,U) on rejection.

The selected path stored in U is part of the auxiliary state. Refreshing its estimate after rejection defines the different Monte Carlo within Metropolis procedure, not this algorithm.

Depends on

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