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.
Forward path law is admissible for the finite masked model
Statement
Let be finite and nonempty, , , and . For each position, reverse step, state with a masked position, and clean token, assume . Fix , let be the forward path probability vector on conditioned on , let be the finite joint model mass, and put and . Then , wherever , and With weighted log terms set to zero where , as in the variational definition, is an admissible variational density for the finite joint target .
Statement references
Finite masked-diffusion generative model: the joint mass is the terminal point mass times the learned reverse kernels and the decoder.
Finite masking diffusion chain: the forward path starts at , masks are absorbing, and the terminal state is .
Variational family and evidence lower bound: admissibility requires support domination and absolute log-integrability for a finite positive normalizer.
Facts & Assumptions
Given: The finite forward path law, the finite reverse generative model, the strict endpoints, and full-support clean-token vectors at every masked reverse state. Prove the forward path density is admissible for the model's conditional joint target.
Finite masking diffusion chain: a forward path starts at , each clean token either survives or becomes , and remains masked thereafter.
Finite-grid masked reverse sampler: reverse rows copy clean tokens and assign mass to a clean token from a masked position and to retaining the mask.
Finite masking-chain transitions define a probability law: is a normalized probability vector on the finite path space.
Finite masked-diffusion joint model is normalized: the joint model mass is a probability vector, so .
Variational family and evidence lower bound: admissibility is and finite , with zero-density terms set to zero.
Proof
The forward survival ratios telescope to , so for each coordinate the event of remaining clean at has probability zero; hence every -positive path has , while the defining path mass forces . Fix such a path. A clean-to-clean forward transition copies its token, and the learned reverse row assigns that transition probability one. A clean-to-mask transition has learned reverse probability . A mask-to-mask transition can occur only for , because is clean; then and its learned reverse probability . These are all positive-probability forward transitions by [F1]. Thus every factor in the learned reverse path mass is positive, and the terminal prior and clean-state decoder are also positive; hence .
By [F3], at least one path has positive mass. Step 1.1 makes its joint model mass positive, so ; [F4] gives . On every -positive path, step 1.1 gives , hence and .
The path space is finite. On each of its finitely many -positive states, both and are positive finite real numbers, so both logarithms are finite. Their finite weighted sum is finite; on states the variational convention contributes zero. This verifies [F5] and proves admissibility.
Depends on
- Finite-grid masked reverse sampler
- Finite masked-diffusion generative model
- Finite masking diffusion chain
- Variational family and evidence lower bound
- Finite-grid masked sampler defines a normalized law
- Finite masked-diffusion joint model is normalized
- Finite masking-chain transitions define a probability law
Used by
Dependency tree · two levels
22 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
- David M. Blei, Alp Kucukelbir, and Jon D. McAuliffe, Variational Inference: A Review for Statisticians (standard reference, not scraped)