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.

Conditional particle filter for particle Gibbs

Definition

Fix N≥2, a finite horizon T, a parameter θ, and a reference trajectory x0:T∗ with a reference lineage of particle indices b0,…,bT∈{1,…,N}. 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 (θ,x∗,b) in the measurable full-measure good set D 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 D, 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 D 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 wˉti as Wti. The input is (θ,x0:T∗,b0:T); the output is the conditional particle system, its normalized weights, its ancestry arrays, and either a successful status or “unavailable”.

  1. At time 0, draw each X0i for i≠b0 independently from ν0 and set X0b0=x0∗. Compute the SIR initial weights a0i=G0(X0i)ρ0(X0i) and set Z^0=N−1∑ia0i. If ∑ia0i>0, put W0i=a0i/∑ja0j; otherwise use the SIR zero-weight convention W0i=1/N. A zero or nonfinite normalizing sum makes the sweep unavailable and returns the unchanged retained state.
  2. For t=1,…,T, for every i≠bt draw an ancestor Ati from the categorical distribution with probabilities Wt−11:N and then draw Xti from the proposal kernel conditional on Xt−1Ati. Set Atbt=bt−1 and Xtbt=xt∗. Compute the SIR incremental weights ati=Gt(Xti)rt(Xt−1Ati,Xti) and update Z^t=Z^t−1(N−1∑iati). If the weight sum is positive, put Wti=ati/∑jatj; otherwise use the SIR zero-weight convention Wti=1/N. A zero or nonfinite normalizing sum makes the sweep unavailable and returns the unchanged retained state.
  3. Return the conditional particle system, its normalized weights, and its ancestry arrays.

For a joint parameter-path sweep, retain the current selected path x∗ and its lineage b, draw θ′ from its exact posterior full conditional given x∗, and apply Steps 1–3 at θ′. This parameter draw followed by conditional-particle-filter regeneration is one joint conditional-block update. Then draw K′∼Categorical(WT1:N) and trace its ancestry to obtain the next selected path. Output the new extended state (θ′,U′,K′) 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