Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generated
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 Gibbs with backward simulation

Definition

Use the density, support, and positive-denominator hypotheses of Backward-simulation particle Gibbs extended target. Select multinomial resampling with ancestor indices in sampled order. Fix N≥2. Before updating, require the retained parameter-path-index triple (θ,x0:Tj,j) to be in DBS, the set fixed in the Conditional-version convention of Backward-simulation particle Gibbs extended target; otherwise return the unchanged extended state. If a required ratio is undefined or nonfinite, or a required denominator or normalizing sum is zero or nonfinite during a sweep, return the old retained state. A finite zero density ratio is valid: assign that particle zero weight and continue. The factorization theorem proves that the stated failures have conditional probability zero on the designated full-measure set.

A backward-simulation sweep takes the current extended state (θ,U,j), where j=(j0,…,jT) selects the reference path x0:T∗=x0:Tj from U. It returns the updated extended state (θ′,U′,J) and selected path x0:TJ. First draw θ′ from its exact posterior full conditional given x0:T∗ and the observations. If (θ′,x∗,j) is outside DBS, return the old extended state.

The initial proposal, non-reference resampling and propagation, and SIR weight updates use Conditional particle filter for particle Gibbs in its density setting. Because j is a backward index sequence rather than an ancestral lineage, the reference particle's ancestor is sampled from B below instead of being fixed to the preceding reference index.

  1. Initialize the conditional auxiliary particle filter at time 0: set X0j0=x0∗ and independently draw X0i∼qθ′,0 for i≠j0. For each i, compute the SIR initial weight a0i=μθ′,0(X0i)G0(X0i)/qθ′,0(X0i). If ∑ia0i>0, set W0i=a0i/∑ℓa0ℓ; otherwise use the SIR zero-weight convention W0i=1/N.
  2. For t=1,…,T, do the following in order:
    1. For each i≠jt, draw Ati categorically with probabilities Wt−11:N and then draw Xti∼qθ′,t(⋅∣Xt−1Ati).
    2. Set Xtjt=xt∗ and draw its ancestor Atjt categorically with probabilities Bt−11:N(xt∗;U′).
    3. For every i, compute ati=Gt(Xti)fθ′,t(Xti∣Xt−1Ati)/qθ′,t(Xti∣Xt−1Ati). If ∑iati>0, set Wti=ati/∑ℓatℓ; otherwise use the SIR zero-weight convention Wti=1/N.
  3. Draw JT categorically with probabilities WT1:N. For t=T−1,T−2,…,0, draw Jt with probabilities Bt1:N(Xt+1Jt+1;U′). Return the updated extended state and selected path.

The zero-weight conventions above define normalized weights as in Sequential importance resampling for Feynman–Kac path targets. Retain zero individual density ratios, importance weights, and backward probabilities. If a required ratio is undefined or nonfinite, a backward-probability denominator is zero or nonfinite, or a weight sum is zero or nonfinite, return the old extended state as specified above. On the designated good set these exceptional events have conditional probability zero. For T=0, Step 2 is empty and Step 3 draws J0 from W0.

The conditional auxiliary particle filter and the backward simulator are the two particle-coordinate conditionals of Backward-simulation particle Gibbs extended target. Their Gibbs interpretation and exact posterior marginal are separate proved properties.

Depends on

Used by

Dependency tree · two levels

9 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