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.

Self-normalized importance sampling

Definition

Let (X,X,μ) be a measure space. The unnormalized target density is a measurable p~≥0 with 0<Zp=∫p~ dμ<∞ and target π(dx)=p~(x)μ(dx)/Zp. Let q≥0 be a measurable proposal probability density against μ, let Q(dx)=q(x)μ(dx), and let f be a measurable real-valued integrand. The input X1,…,Xn is an IID sample from Q in the sense of Identical distribution and IID families, with n≥1. For target interpretation require q>0 π-almost everywhere. Write Wi:={p~(Xi)/q(Xi),q(Xi)>0,0,q(Xi)=0. This is a nonnegative unnormalized importance weight; the value on q=0 is immaterial under Q and under the stated target support condition.

The reciprocal map that is 1/s for s>0 and 0 for s≤0 is Borel. Its composition with q, multiplied by p~, makes Wi measurable by Composition with a Borel measurable outer map preserves measurability and Arithmetic and lattice operations preserve measurability whenever they are defined.

Procedure and output: Compute Sn=∑i=1nWi. If Sn=0, return the status no estimate: zero observed target weight. If Sn>0, return θ^SN:=∑i=1nWif(Xi)Sn. For consistency require EQW1=Zp∈(0,∞) and EQ[W1∣f(X1)∣]<∞. A ratio CLT and its Monte Carlo standard error require finite second moments of W1 and W1f(X1).

Depends on

Used by

Dependency tree · two levels

19 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