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.

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 μ0≪ν0 and, for each k≥1, Mk(x,⋅)≪Rk(x,⋅) for almost every x under the last-coordinate marginal of the proposal path law Qk−1. Select the joint measurable versions ρ0=dμ0/dν0 and rk(x,⋅)=dMk(x,⋅)/dRk(x,⋅) supplied by Feynman–Kac path Radon–Nikodym weight. Fix N≥1 and select either multinomial or residual resampling at each time. The algorithm returns a weighted empirical path measure and a normalizer estimate.

  1. Draw X01,…,X0N independently from ν0. Set a0i=G0(X0i)ρ0(X0i) and Z^0=N−1∑i=1Na0i. If ∑ia0i>0, put wˉ0i=a0i/∑ja0j; otherwise put wˉ0i=1/N. Each initial path is X0:0i=X0i.
  2. For k=1,…,t, do the following:
    1. Apply Multinomial and residual offspring resampling to the previous normalized weights (wˉk−11,…,wˉk−1N), obtaining ancestor indices Ak1,…,AkN.
    2. Given the previous paths and these indices, draw (Xk1,…,XkN) with joint conditional law ⨂i=1NRk(Xk−1Aki,⋅) and set X0:ki=(X0:k−1Aki,Xki).
    3. Set aki=Gk(Xki)rk(Xk−1Aki,Xki) and Z^k=Z^k−1(N−1∑i=1Naki). If ∑iaki>0, put wˉki=aki/∑jakj; otherwise put wˉki=1/N.
  3. Return Z^t and the weighted empirical path probability measure π^tN=∑i=1NwˉtiδX0:ti. 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, Z^ remains zero. The procedure makes no finite-particle accuracy, consistency, or long-time stability claim.

The input convention is that t∈{0,…,T} is the requested horizon, ν0 is a proposal probability on X0, Rk are proposal probability kernels for 1≤k≤t, and N∈N with N≥1. Thus the opening support condition ranges over 1≤k≤t, and a resampling scheme is selected for each such k. Choose the finite-valued joint measurable versions ρ0 and rk 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

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