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.
DDPM variational objective and weighted noise-prediction terms
Statement
Assume AC. Fix a finite Gaussian forward chain and reverse model as defined above, with finite-valued Borel reverse means and fixed variances . For the noise-prediction parameterization, let be Borel and set For each fixed observed , require , define the proper posterior density and let and be the path probability measures with Lebesgue densities and . Require and Here means the integral of against the path law with density . Define Then The negative ELBO has the exact decomposition In particular, for , write If with , then the corresponding per-step KL term is At , the reconstruction term is the separate learned likelihood with variance ; no Lebesgue density for is used. For finite , the terminal-prior KL is retained; no equality is assumed. The common unweighted objective drops the schedule weights and replaces the separate endpoint terms with noise-prediction losses, so it is not in general the exact maximum-likelihood objective.
Statement references
Finite-chain ELBO decomposition and exact Gaussian posterior: Ho, Jain, and Abbeel, §§2–3 and Appendix A, Eqs. (5)–(7), (17)–(22).
Weighted noise prediction and the unweighted simple objective: Ho, Jain, and Abbeel, §3.2 and §3.4, Eqs. (8)–(14).
Pedagogical ELBO and noise-prediction derivation; its simplification approximates the finite-horizon terminal-prior term by zero: Prince, Chapter 18, “The diffusion ELBO” and “Simplifying it”.
Facts & Assumptions
Given: AC, a finite forward chain and reverse Gaussian model with positive finite variances, a fixed , a Borel noise predictor, and finite absolute -expectations of the log path densities in the Statement.
AC is assumed by the Gaussian conditional-law supplier and the library KL/ELBO interface. The Axiom of Choice.
The forward and reverse path densities factor into normalized Gaussian transitions; their variances are finite and strictly positive. Finite Gaussian forward chain and Gaussian reverse model.
The forward marginal and, for , the exact Gaussian law of conditioned on are as stated. Closed Gaussian forward marginal and conditioned posterior.
The variational-family interface requires before it normalizes . Variational family and evidence lower bound.
An admissible density has the required support and finite -integrability of . Variational family and evidence lower bound.
Under those conditions, the log-evidence equals the ELBO plus reverse KL under AC, and the KL is nonnegative. Evidence lower bound is log evidence minus reverse KL.
For positive isotropic Gaussian variances, the reverse KL is the sum of the variance term and squared-mean term in the proved formula. Reverse KL between isotropic Gaussian laws.
Expectation of an integrable function is its integral with respect to the stated probability law. Expectation of a nonnegative or integrable random variable.
A probability law is the pushforward probability measure of its random element. Law or distribution of a random element.
The library KL is directional: its first argument must be absolutely continuous with respect to its second. Kullback–Leibler divergence.
A multivariate normal law has its specified mean and covariance, so a standard -dimensional normal residual has second moment . Multivariate normal law, including singular covariance.
Proof
Given: The hypotheses in the Statement.
The reverse path density is strictly positive and finite at every finite path because every Gaussian variance is positive and each mean is finite. Its path marginal on is a probability density by successive integration of its reverse kernels and prior. For fixed , the decoder density satisfies , so integrating against that path marginal gives . It is strictly positive: on the positive-measure box , the sets for positive integers cover the box because the density is positive everywhere. If all these sets had measure zero, their countable union would have measure zero, contradicting the positive measure of the box; one set therefore has positive measure, and the integral is positive. Thus is a proper positive density.
The forward path density is a probability density and is positive everywhere. Its log is the finite sum . Under , each normalized residual has law and finite second moment by [F10], so . Since the reverse density is also positive everywhere, everywhere and the support condition holds.
Let on path space with base measure . Step 1.1 gives and the normalized target ; step 1.2 gives the support condition, and the Statement's integrability hypothesis together with step 1.2 gives . The direction is , as required by [F8]. Therefore [F3], [F6], and [F9] apply, and [F4] gives the exact log-evidence identity and nonnegative reverse KL.
For , the Markov property and positive Gaussian densities give . Substitute this into . The ratios telescope, leaving . Each reverse Gaussian log-density factor is bounded above; the assumed integrability of their finite sum therefore makes each factor integrable. The forward marginals and conditioned laws are Gaussian with finite quadratic moments, so their log-density terms are integrable as well. Taking expectations term by term now gives the stated endpoint-plus-step decomposition, with the term .
For , substitute into the posterior mean in [F2]. Using and gives . The reverse mean is the same expression with in place of , so . Both posterior and reverse variances are positive for , so [F5] applies with and ; it gives exactly the coefficient and constant in the Statement.
The terminal term remains in step 2.2 because finite and give ; the term remains the separate positive-variance decoder log-likelihood. For an explicit counterexample, take , , , , , and . Then , , , and . For a fixed datum , set and , with any . These are finite Borel maps, and their Gaussian log densities have finite -expectations because they are quadratic functions of finite-dimensional Gaussian variables. The first map makes , so the decoder density at its mean is ; integrating it against the normalized reverse path density gives for every . Under the forward chain, the noise error is zero and the error is , so , while the exact weighted ELBO contribution is and its prior term is independent of . Taking gives but exact negative log-likelihood . Thus the unweighted loss is a surrogate, not in general the maximum-likelihood objective.
Source notes
Variational-family support and log-integrability requirements: Variational family and evidence lower bound.
Exact ELBO/KL identity and its AC branch: Evidence lower bound is log evidence minus reverse KL.
Exact Gaussian posterior conditional and its positive observed-covariance hypothesis: Closed Gaussian forward marginal and conditioned posterior.
Isotropic Gaussian reverse-KL calculation: Reverse KL between isotropic Gaussian laws.
Depends on
- The Axiom of Choice
- Expectation of a nonnegative or integrable random variable
- Finite Gaussian forward chain and Gaussian reverse model
- Kullback–Leibler divergence
- Law or distribution of a random element
- Multivariate normal law, including singular covariance
- Variational family and evidence lower bound
- Reverse KL between isotropic Gaussian laws
- Evidence lower bound is log evidence minus reverse KL
- Closed Gaussian forward marginal and conditioned posterior
Used by
Dependency tree · two levels
60 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)