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.
Rare-event efficiency and work criteria
Definition
Let be a family of probability measures and measurable events with and along the stated rare-event limit. An estimator is unbiased with finite variance when and . Its relative error is It has bounded relative error if these relative errors remain bounded for all sufficiently rare indices. For such an unbiased estimator family, it is logarithmically efficient if , its second moment is finite and positive, and Among nonnegative unbiased estimator families, logarithmic efficiency is a weaker asymptotic property than bounded relative error; the definitions impose no implication between an algorithm's efficiency and its proposal-fitting success.
For a specified cost model, let be the expected work of one estimator replication. Record both its variance and its variance-work product ; for relative precision, record . These quantities depend on the cost model. Comparing algorithms requires the same declared work convention.
For a single event under a probability measure , put . If has density with respect to , the zero-variance event proposal is the probability density It is a formal benchmark because its normalizing constant is the unknown event probability . Ordinary importance-sampling estimators and their weighted-second-moment condition are defined in Ordinary importance sampling and Ordinary importance sampling has finite variance and a CLT under a weighted second moment.
Depends on
Used by
Dependency tree · two levels
17 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
- Gino Biondini, An Introduction to Rare Event Simulation and Importance Sampling, Handbook of Statistics 33, Chapter 2, ``3.1–3.3, 8 (standard reference, not scraped)
- Patrick Laub, Algorithms for Rare Event Estimation, Short Course, Lecture 1 Part 2, Importance Sampling and Exponential Tilting (standard reference, not scraped)
- Michele Pagano, Efficient Rare Event Simulation: A Tutorial on Importance Sampling, ``18–31 (standard reference, not scraped)
- Joshua C. C. Chan, Peter W. Glynn, and Dirk P. Kroese, A Comparison of Cross-Entropy and Variance Minimization Strategies, §2 (standard reference, not scraped)