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.
Augmented ABC tolerance target
Definition
Use the prior and simulator setup of Approximate Bayesian computation and the tolerance-conditioned target: standard-Borel parameter and data spaces and , a prior probability , a probability kernel , a measurable summary map with , an observed summary , and tolerance . Let The prior-simulator joint law on the product sigma-algebra is which is a probability measure by A prior and model kernel define a joint law. The finite product is standard Borel by Finite products of standard Borel spaces are standard Borel. Put Thus , and is the prior-predictive probability in Approximate Bayesian computation and the tolerance-conditioned target. Only when define the augmented ABC tolerance target It is the prior-simulator joint law conditioned on the summary-tolerance event. Its parameter marginal is identified in The augmented ABC target has the tolerance posterior as its parameter marginal. The definition does not assert that summary reduction or a positive tolerance preserves the full-data posterior.
Depends on
- Approximate Bayesian computation and the tolerance-conditioned target
- Bayesian model as a prior and sampling kernel
- Measure kernel and probability kernel
- Probability measures and probability spaces
- The product sigma-algebra and its finite iterates
- Standard Borel spaces
- Finite products of standard Borel spaces are standard Borel
- A prior and model kernel define a joint law
Used by
- ABC Metropolis–Hastings on simulator-augmented states Algorithm
- Sequential ABC importance-resampling with tolerance populations Algorithm
- A finite ABC-SMC tolerance schedule and its mixture weights Example
- A positive-tolerance ABC-MH stationary law can differ from the exact-data posterior Example
- ABC acceptance probability vanishes with the tolerance Example
- Finite ABC-SMC particles can miss target support despite a valid mixture weight Example
- The augmented ABC target has the tolerance posterior as its parameter marginal Lemma
- ABC Metropolis–Hastings preserves its augmented tolerance target Theorem
- Sequential ABC Radon–Nikodym weights target each tolerance law Theorem
Dependency tree · two levels
44 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
- Jarno Lintusaari, Michael U. Gutmann, Ritabrata Dutta, Samuel Kaski, and Jukka Corander, Fundamentals and Recent Developments in Approximate Bayesian Computation, §4 (standard reference, not scraped)
- Osvaldo A. Martin, Ravin Kumar, and Junpeng Lao, Bayesian Modeling and Computation in Python, Chapter 8 (standard reference, not scraped)
- Paul Fearnhead and Dennis Prangle, Constructing Summary Statistics for Approximate Bayesian Computation: Semi-automatic ABC, §§2–3 (standard reference, not scraped)