Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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 d,N,T≥1, a data set D=(x0(1),…,x0(N))∈(Rd)N, forward variances β1,…,βT∈(0,1), reverse variances σ12,…,σT2∈(0,∞), a Borel map ϵθ:Rd×{1,…,T}→Rd, and a mode from {weighted-elbo,simple}. Set αt=1−βt and αˉt=∏s=1tαs. Use the noise-prediction means μθ,t(y)=1αt(y−βt1−αˉt ϵθ(y,t)),1≤t≤T, and the reverse Gaussian model with these means, variances σt2, and prior Nd(0,Id) to define pθ. In weighted-elbo mode, require for each x0(i) that 0<pθ(x0(i))<∞, the forward path law be absolutely continuous with respect to the normalized reverse posterior path law, and Eq(⋅∣x0(i)) ⁣[∣log⁡q(x1:T∣x0(i))∣+∣log⁡pθ(x0:T)∣]<∞. In simple mode, require for every i and t that Eϵ∼Nd(0,Id) ⁣[∥ϵ−ϵθ ⁣(αˉtx0(i)+1−αˉtϵ,t)∥22]<∞. This procedure returns one stochastic loss estimate; it does not prescribe a parameter optimizer or claim optimizer convergence.

  1. Choose I uniformly from {1,…,N}, choose J uniformly from {1,…,T} independently of I, and draw ϵ∼Nd(0,Id) independently of both.

  2. Set xJ=αˉJ x0(I)+1−αˉJ ϵ.

  3. If the mode is simple, return ∥ϵ−ϵθ(xJ,J)∥22.

  4. If the mode is weighted-elbo, first compute the exact terminal-prior term KT(x0(I))=12[αˉT∥x0(I)∥22+d(−αˉT−log⁡(1−αˉT))]. If J=1, return KT(x0(I))−Tlog⁡pθ(x0(I)∣xJ). If J≥2, return KT(x0(I))+T[CJ+wJ∥ϵ−ϵθ(xJ,J)∥22], where wJ and CJ are the exact per-step coefficient and variance constant in the DDPM objective theorem.

Each branch returns one sampled objective contribution. The J=1 weighted branch uses the positive-variance learned reconstruction likelihood; it never evaluates a density for the degenerate forward conditional q(x0∣x1,x0). 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.

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