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.
Epsilon-prediction diffusion objective estimator
Definition
Fix finite integers , a data set , forward variances , reverse variances , a Borel map , and a mode from . Set and . Use the noise-prediction means and the reverse Gaussian model with these means, variances , and prior to define . In weighted-elbo mode, require for each that , the forward path law be absolutely continuous with respect to the normalized reverse posterior path law, and In simple mode, require for every and that This procedure returns one stochastic loss estimate; it does not prescribe a parameter optimizer or claim optimizer convergence.
-
Choose uniformly from , choose uniformly from independently of , and draw independently of both.
-
Set
-
If the mode is , return
-
If the mode is , first compute the exact terminal-prior term If , return If , return where and are the exact per-step coefficient and variance constant in the DDPM objective theorem.
Each branch returns one sampled objective contribution. The weighted branch uses the positive-variance learned reconstruction likelihood; it never evaluates a density for the degenerate forward conditional . This algorithm specifies the sampling procedure only; it makes no optimizer-convergence claim.
Definition references
Finite Gaussian chain and reverse likelihood: Finite Gaussian forward chain and Gaussian reverse model.
Terminal KL and weighted per-step terms: DDPM variational objective and weighted noise-prediction terms.
Gaussian KL formula used for the terminal term: Reverse KL between isotropic Gaussian laws.
Stochastic epsilon-prediction objective and simple-loss convention: Ho, Jain, and Abbeel, Algorithm 1 and Eqs. (12)–(14).
Pedagogical treatment of weighted noise-prediction terms and the simplified training objective; its ELBO discussion approximates the terminal-prior term by zero: Prince, Chapter 18, “The diffusion ELBO” and “Simplifying it”.
Remarks
Finite expectation and the exact objective estimated in each mode are proved in lem-diffusion-objective-estimator-expectation.
Remarks references
Depends on
Used by
Dependency tree · two levels
20 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
- Jonathan Ho, Ajay Jain, and Pieter Abbeel, Denoising Diffusion Probabilistic Models (2020) (standard reference, not scraped)
- Simon J. D. Prince, Understanding Deep Learning, Chapter 18: Diffusion models (2026), pp. 363–387 (standard reference, not scraped)