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.
Diminishing adaptation
Definition
Let and be nonempty measurable spaces (Measurable spaces and measurable sets). Let be a probability measure on , and let be a jointly measurable family of probability kernels on : for every , is -measurable and each is a probability kernel (Measure kernel and probability kernel). Assume that is invariant for every fixed kernel, meaning (Invariant and stationary distribution for a Markov kernel).
An adaptive MCMC process is a pair of measurable processes with , , and natural filtration , such that for every , The update rule for may depend on the history through time ; it is required only to make a measurable random variable.
For , define the adaptation size where total variation uses the convention (Total variation distance for probability laws). Assume each is measurable; it lies in . The process has diminishing adaptation if in probability as . This condition does not require to converge.
Depends on
Used by
- Common drift and minorization give containment under diminishing adaptation, strong aperiodicity, and a finite initial V-moment Corollary
- Diminishing adaptation and uniform ergodicity need not give a strong law Counterexample
- Containment for adaptive MCMC Definition
- A uniformly ergodic adaptive refresh family Example
- Diminishing adaptation with loss of containment Example
- Finite-block perturbation bound for adaptive MCMC Lemma
- Adaptive MCMC marginal convergence under diminishing adaptation with uniform ergodicity or containment Theorem
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
- Gareth O. Roberts and Jeffrey S. Rosenthal, Coupling and Ergodicity of Adaptive MCMC (standard reference, not scraped)
- Gersende Fort, Adaptive MCMC: theory and methods, Warwick lecture notes (standard reference, not scraped)