Alphabeta Math
Pipeline-generated
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.

Energy models, score matching, and contrastive divergence

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Energy-based density and partition function

Definition

Let (X,A,μ) be a measure space, let Θ be a parameter set, and for each θ∈Θ let Eθ:X→R be a measurable energy function. Its partition function relative to μ is Zθ:=∫Xe−Eθ(x) dμ(x). The admissible parameter set is Θμ:={θ∈Θ:0<Zθ<∞}. For θ∈Θμ, the energy-based probability measure is the measure with density e−Eθ/Zθ relative to μ: Pθ(A):=1Zθ∫Ae−Eθ(x) dμ(x),A∈A. The restriction 0<Zθ<∞ is part of the definition; parameters outside Θμ do not define a normalized model by this formula.

Definition references

Measure spaces defines the triple (X,A,μ) used here.

A measurable function between measurable spaces defines measurability of Eθ.

The nonnegative Lebesgue integral defines the integral used for Zθ.

The measure with density f relative to μ defines the measure with density e−Eθ relative to μ.

Probability measures and probability spaces defines a probability measure as a measure of total mass one.

An admissibly normalized energy density is a probability measure ↗ establishes the normalization's well-definedness.

LemmaStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

An admissibly normalized energy density is a probability measure

Statement

For every measure space (X,A,μ), measurable real energy Eθ, and parameter θ with 0<Zθ:=∫Xe−Eθ dμ<∞, the normalized measure Pθ(A):=Zθ−1∫Ae−Eθ(x) dμ(x),A∈A, is a probability measure on (X,A).

Statement references

Energy-based density and partition function supplies the notation Zθ and Pθ.

The measure with density f relative to μ identifies the nonnegative density integral as a measure.

Probability measures and probability spaces defines a probability measure by total mass one.

Facts & Assumptions

Given: A measure space (X,A,μ), a measurable real energy Eθ, and 0<Zθ<∞.

[F1]

Energy-based density and partition function: Pθ(A)=Zθ−1∫Ae−Eθ dμ and admissibility requires 0<Zθ<∞.

[F2]

The measure with density f relative to μ: if f≥0 is measurable, then A↦∫Af dμ is a measure.

[F3]

Probability measures and probability spaces: a measure on (X,A) with total mass one is a probability measure.

[F4]

The real exponential function and the number e by a power series and The exponential series converges absolutely for every real argument: the real exponential is the power-series sum exp⁡(t)=∑n≥0tn/n!, with infinite radius of convergence.

[F5]

The sum of a real power series is continuous at every point strictly inside its interval of convergence: a power-series sum is continuous at every point strictly inside its radius of convergence.

[F6]

A continuous map has Borel preimages of Borel sets: a continuous real map has Borel preimages of Borel sets.

[F7]

Composition with a Borel measurable outer map preserves measurability: a measurable map composed with a Borel measurable outer map is measurable.

Proof

1.1givenF1F2F4F5F6F7F8algebra

Define ϕ(t):=exp⁡(−t). By [F4], ϕ(t)=∑n≥0(−1)ntn/n! is a power-series sum with infinite radius, so [F5] makes ϕ continuous on R. Thus [F6] makes it Borel measurable, and [F7] with the measurable energy from [F1] makes x↦exp⁡(−Eθ(x)) measurable. Its values are positive by [F8], hence nonnegative. Put Mθ(A):=∫Ae−Eθ dμ. Now [F2] makes Mθ a measure and Mθ(X)=Zθ. Thus Pθ(∅)=Zθ−1Mθ(∅)=0. For any pairwise disjoint sequence (An)n≥0, [F2] and finite-sum homogeneity give Pθ(⋃n≥0An)=Zθ−1∑n≥0Mθ(An)=lim⁡N→∞∑n=0NZθ−1Mθ(An)=∑n≥0Pθ(An). Therefore Pθ is a measure.

2.1F1F3step 1.1algebra∎

Its total mass is Pθ(X)=Zθ−1Mθ(X)=1, so [F3] makes Pθ a probability measure.

TheoremStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

The score-matching integration-by-parts identity

Statement

Assume the Axiom of Countable Choice used by the library's Lebesgue-measure and weak-derivative representative interfaces. Let d≥1, let λd be Lebesgue measure on Rd, and let p:Rd→[0,∞) be a continuously differentiable probability density, so ∫p dλd=1. Write Pp(A):=∫Ap dλd,A∈L(Rd), which is a probability measure, and let Ep[f]:=∫f dPp for integrable f. Define the data score by sp(x):=∇log⁡p(x) when p(x)>0 and set sp(x):=0 when p(x)=0. For an energy model relative to λd with 0<Zθ=∫e−Eθ dλd<∞, assume Eθ∈C1(Rd) and define its model score field by ψθ:=−∇Eθ. Assume each component of ψθ is locally integrable and has locally integrable weak first derivatives: for each i,j, a locally integrable representative gij satisfies ∫Rdψθ,i ∂jφ dλd=−∫Rdgijφ dλd(φ∈Cc∞(Rd)). Here Cc∞(Rd) denotes the smooth compactly supported test functions. The weak derivatives are unique up to Lebesgue-null sets, and define div⁡ψθ:=∑i=1dgii; the integrals below do not depend on the chosen representatives. The C1 convention is that the first derivative exists everywhere and is continuous. For each admissible θ, assume Ep∥sp∥2<∞,Ep∥ψθ∥2<∞,Ep∣div⁡ψθ∣<∞. Then the score-matching objective J(θ):=12Ep∥ψθ−sp∥2 satisfies J(θ)=Ep[12∥ψθ∥2+div⁡ψθ]+Cp,Cp:=12Ep∥sp∥2, where Cp is independent of θ. No pointwise boundary limit at infinity is assumed.

Statement references

Aapo Hyvärinen, Theorem 1 and Appendix A of the full JMLR paper states the score-matching identity under a pointwise boundary condition.

Kevin P. Murphy, Chapter 24, Sections 24.1–24.3.4 defines energy models, the model score and score matching.

Facts & Assumptions

Given: The hypotheses in the Statement, including Countable Choice for the library Lebesgue measure interface and the three stated finite p-integrability conditions.

[A1]

p is a nonnegative C1 probability density; for each admissible parameter, Eθ∈C1, its score field is locally integrable with locally integrable weak first derivatives, and the score and divergence have the stated finite p-moments.

[A2]

The Axiom of Countable Choice (ACω): every countable family of nonempty sets has a choice function; it is used through [F3], [F8], [F10], [F17], and [F19].

[F1]

Energy-based density and partition function: for 0<Zθ<∞, the model density is e−Eθ/Zθ, and Zθ is independent of x.

[F2]

The measure with density f relative to μ: for a nonnegative measurable density f, f dμ is the measure A↦∫Af dμ.

[F4]

Dominated convergence: almost-everywhere convergence under one integrable majorant implies convergence of the corresponding integrals.

[F5]

Probability measures and probability spaces: a measure of total mass one is a probability measure.

[F6]

Continuously differentiable maps, local inverses, and local diffeomorphisms: a map on an open Euclidean set is C1 when it is differentiable everywhere and its derivative entries are continuous.

[F7]

Weak derivative of a locally integrable function: gij is a weak derivative exactly when its signed test-function identity holds for every smooth compactly supported test function.

[F8]

Uniqueness of a weak derivative as an almost-everywhere class: under Countable Choice, any two locally integrable representatives satisfying the same weak-derivative identity agree almost everywhere.

[F9]

A continuous map has Borel preimages of Borel sets: a continuous map has Borel preimages of Borel sets.

[F10]

Assuming countable choice, every Borel subset of Rn is Lebesgue measurable: under Countable Choice, Borel subsets of Rd are Lebesgue measurable.

[F11]

A smooth bump between concentric Euclidean balls: for 0<r<R, a smooth function χ:Rd→[0,1] can equal 1 on B‾r(0) and have support contained in BR(0).

[F14]

Chain sum product and composition rules for Banach derivatives: total derivatives obey the bounded-bilinear product rule.

[F16]

Monotonicity and nonnegative homogeneity of the nonnegative integral: the nonnegative integral is monotone and positively homogeneous.

[F17]

A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: a C1 diffeomorphism transforms nonnegative Lebesgue integrals by its absolute Jacobian determinant.

[F18]

The mollifier family generated by a unit-mass smooth bump: a unit-mass smooth compactly supported function generates the scaled family ρϵ(x)=ϵ−dρ0(x/ϵ).

[F19]

Convolution with a mollifier is smooth, and derivatives pass under the integral sign: convolution of a locally integrable function with a smooth compactly supported mollifier is smooth.

[F20]

Differentiation under the integral sign: an integrable parameter-independent majorant permits differentiation under the integral sign.

[F21]

Fermat's theorem: an interior differentiable local extremum has zero gradient: a differentiable function at an interior local extremum has zero gradient.

[F22]

The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case: the gradient coordinates of a scalar-valued function are its coordinate partial derivatives.

[F24]

Proof

1.1givenA1A2F1F2F3F5F6F8F9F10F11F12F13F15F16F17F18F23F24

By [F1], the admissible model has density e−Eθ/Zθ, with Zθ independent of x. Since p is C1, [F6, F23] make it continuous; [F9, F10] then make it Lebesgue measurable, so [F2] makes Pp a measure, and [F5] makes it a probability measure. The local increment bound [F23] gives, at each x∈U={p>0}, constants Cx,δx>0 with ∣p(y)−p(x)∣≤Cx∥y−x∥ for ∥y−x∥<δx; taking ∥y−x∥<min⁡{δx,p(x)/(2(Cx+1))} shows p(y)>0, so U is open. On U, [F6, F15, F24] make sp=∇log⁡p continuous. For each open O⊆Rd, its score preimage is the union of the relative-open preimage in U and Uc when 0∈O; hence the zero extension is Borel and Lebesgue measurable by [F10]. By [F8], weak-derivative representatives agree off a Lebesgue-null set; [F2] makes every such set Pp-null, so the divergence integral is representative-independent. Choose χ from [F11] with r=1 and R=2. By [F9, F10], this continuous bump is Lebesgue measurable. Its gradient vanishes outside B2; [F12, F13] make C:=∥∇χ∥∞ finite. The box [−1/(2d),1/(2d))d lies in B1, since its points have norm at most d/(2d)≤1/2, while supp⁡χ⊂B2⊂[−3,3)d and 0≤χ≤1. Thus [F3, F16] give d−d≤M:=∫χ dλd≤6d. Set ρ0=χ/M; positive homogeneity [F16] gives it unit mass. Let ρ0,ε be its scaled family from [F18]; [F18] gives support in B‾2ε and [F17] gives unit mass. For R>0, define χR(x)=χ(x/R). Then χR=1 on B‾R, vanishes outside B2R, and [F24] gives ∥∇χR∥∞≤C/R.

2.1A1F3F4F7F12F13F14F17F19F20F24step 1.1

Fix R and put φ=pχR. The product rule [F14] makes φ a nonnegative C1 function supported in B‾2R. By [F12, F13], φ and its first derivatives are bounded there; the ball lies in a finite-volume box by [F3], so φ is locally integrable. The convolution φε=φ∗ρ0,ε is smooth by [F19] and supported in B‾2R+2 for ε≤1, since supp⁡φ⊆B‾2R and supp⁡ρ0,ε⊆B‾2. By [F17], applied to the nonnegative convolution integrand, φε(x)=∫φ(x−z)ρ0,ε(z) dz. For each coordinate j, [F24] gives the parameter derivative of f(z,t)=φ(x+tej−z)ρ0,ε(z). Its sections are integrable because φ is bounded and the kernel has mass one; its derivative is measurable and bounded by ∥∂jφ∥∞ρ0,ε(z), an integrable majorant. Thus [F20] gives ∂jφε(x)=∫∂jφ(x−z)ρ0,ε(z) dz. The unit mass and shrinking support give, for each x, ∣φε(x)−φ(x)∣≤sup⁡∥z∥≤2ε∣φ(x−z)−φ(x)∣→0, with the same estimate for each first derivative. Since φ and ∇φ are bounded by [F12, F13], the weak-identity integrands are dominated on this common compact support by constants times ∣ψθ,i∣ and ∣gii∣. Local integrability and [F4] pass the identities from φε to φ. Summing over i and expanding ∇(pχR) with [F14] yields ∫χRψθ⋅∇p dλd+∫pψθ⋅∇χR dλd=−∫pχRdiv⁡ψθ dλd.

2.2givenA1F15F21F22F24step 1.1algebra

On {p>0}, [F15, F24] give ∇p=psp. At any point where p=0, nonnegativity makes it an interior local minimum, so [F21, F22] give ∇p=0 there too. Thus ∇p=psp everywhere. Componentwise ∣ψθ⋅sp∣≤∑i∣ψθ,isp,i∣ and 2∣ab∣≤a2+b2 imply ∫∣ψθ⋅∇p∣ dλd≤12Ep(∥ψθ∥2+∥sp∥2)<∞ and ∫p∣div⁡ψθ∣ dλd<∞. Also ∥ψθ∥≤(1+∥ψθ∥2)/2, so the cutoff term from step 1.1 is bounded in absolute value by C2R(1+Ep∥ψθ∥2)→0.

3.1F4step 2.1step 2.2

Let R=n for integers n→∞. Then χn→1 pointwise and ∣χn∣≤1. The first integrand in step 2.1 is dominated by ∣ψθ⋅∇p∣ and the third by p∣div⁡ψθ∣, both integrable by step 2.2. Applying [F4] to both terms and using the vanishing cutoff term from step 2.2 gives ∫ψθ⋅∇p dλd=−∫pdiv⁡ψθ dλd.

4.1givenA1step 2.2step 3.1algebra∎

Expanding the square gives J(θ)=12Ep∥ψθ∥2+12Ep∥sp∥2−∫pψθ⋅sp dλd. Since ∇p=psp by step 2.2, step 3.1 turns the last term into +Ep[div⁡ψθ]; the remaining data-score term is Cp, independent of θ.

Remarks

The cutoff and integration-by-parts argument is choice-free once the Lebesgue measure and weak-derivative classes are available. Countable Choice is used for those two interfaces; no full Axiom of Choice is used. The cutoff estimate supplies the multivariate limit directly and does not rely on pointwise vanishing of pψθ at infinity.

AlgorithmAlgorithm: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Contrastive divergence with k transitions

Definition

Let (X,A,μ) be a measure space, let r be a positive integer and θ∈Rr, and let Eθ:X→R be measurable in x and continuously differentiable in θ. Define the energy model Pθ relative to μ only when 0<Zθ:=∫Xe−Eθ(x) dμ(x)<∞, with density e−Eθ/Zθ. Let Q0 be a data probability measure on (X,A) and let Kθ be a probability kernel from X to itself which leaves Pθ invariant, meaning ∫XKθ(x,A) Pθ(dx)=Pθ(A)(A∈A). Let {∗} carry its full sigma-algebra, let G0,θ(∗,A):=Q0(A), and recursively compose the probability kernel Gj,θ from {∗} to X with Kθ to obtain Gj+1,θ. Define Qj,θ(A):=Gj,θ(∗,A); thus Q0,θ=Q0 and Qj+1,θ(A)=∫XKθ(x,A) Qj,θ(dx),A∈A. Finite probability-kernel composition makes each Qj,θ a probability measure. For an integer k≥1, Qk,θ is the k-step reconstruction law.

If Q0 and Qk,θ have specified nonnegative measurable densities r0,θ and rk,θ relative to Pθ, meaning Qj,θ(A)=∫Arj,θ dPθ for every A∈A for j∈{0,k}, and ∫∣rj,θlog⁡rj,θ∣ dPθ<∞(j∈{0,k}), define their finite contrastive-divergence objective by CD⁡k(θ):=∫r0,θlog⁡r0,θ dPθ−∫rk,θlog⁡rk,θ dPθ, where 0log⁡0:=0 and log⁡ is the natural logarithm. On a finite state space where Pθ has positive mass at every state, write pθ(x):=Pθ({x}) and qj,θ(x):=Qj,θ({x}). Then rj,θ(x)=qj,θ(x)/pθ(x) and the objective equals ∑x:q0,θ(x)>0q0,θ(x)log⁡q0,θ(x)pθ(x)−∑x:qk,θ(x)>0qk,θ(x)log⁡qk,θ(x)pθ(x), since each finite-space integral is the sum of the integrand times the point mass and pθrj,θ=qj,θ.

For a positive integer m, the procedure takes independent data draws x1,…,xm with common law Q0, a transition sampler for Kθ, and a learning rate η>0; the reconstruction chains are drawn independently conditional on their starts. Its output is the updated parameter from the stop-gradient CD-k update:

  1. For each i, set xi,0=xi and draw xi,j+1 from Kθ(xi,j,⋅) for j=0,…,k−1.
  2. Form g^k=1m∑i=1m(∇θEθ(xi)−∇θEθ(xi,k)).
  3. Update θ←θ−ηg^k.

When ∇θEθ is integrable under Q0 and Qk,θ, the associated population CD-k direction is gk(θ):=∫∇θEθ dQ0−∫∇θEθ dQk,θ. The procedure makes no claim that the chain has mixed in k steps. The parameter derivative of Qk,θ is not stopped in the scalar objective's definition; the update above deliberately omits that derivative.

Definition references

Energy-based density and partition function defines the normalized energy law used as the chain target.

Measure kernel and probability kernel defines the probability transition kernels.

Composition of probability kernels defines their iterated composition.

Kernel composition is well defined and associative establishes that finite compositions remain probability kernels.

The measure with density f relative to μ defines a measure from a nonnegative density.

Probability measures and probability spaces defines the data and model laws.

The nonnegative Lebesgue integral defines the nonnegative integrals.

Integrable real and complex functions, and their integrals defines integrability of the relative-entropy terms and parameter gradients.

TheoremStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

The finite-state CD-k gradient includes the chain-distribution derivative

Statement

Let r be a positive integer, let X be finite and nonempty, and let Θ⊆Rr be open. For each x,y∈X, assume the coordinate partial derivatives of Eθ(x) and Kθ(x,y) exist and are continuous on Θ. Let Kθ be strictly positive and row-stochastic, so Kθ(x,y)>0 and ∑yKθ(x,y)=1. Use counting measure as the reference measure, set Zθ:=∑x∈Xe−Eθ(x),pθ(x):=e−Eθ(x)/Zθ, let q0 be a fixed probability vector on X, assume pθ is invariant for Kθ, and fix an integer k≥1. Define Kθ0=I, Kθs+1=KθsKθ, and qk,θ=q0Kθk, where vectors are row vectors, and L(θ):=−∑xq0(x)log⁡pθ(x),CD⁡k(θ):=DKL(q0∥pθ)−DKL(qk,θ∥pθ), where for finite probability mass functions a,b with b(x)>0, DKL(a∥b):=∑x:a(x)>0a(x)log⁡a(x)b(x) with log⁡ the natural logarithm and zero-mass terms contributing zero. For each parameter coordinate j, ∂jL(θ)=∑xq0(x)∂jEθ(x)−∑xpθ(x)∂jEθ(x), while ∂jCD⁡k(θ)=∑xq0(x)∂jEθ(x)−∑xqk,θ(x)∂jEθ(x)−∑x∂jqk,θ(x)log⁡qk,θ(x)pθ(x). The reconstruction-law derivative is ∂jqk,θ=∑s=0k−1q0Kθs(∂jKθ)Kθk−1−s. Thus the population direction used by stop-gradient CD-k is the first two terms of the displayed ∂jCD⁡k formula and omits the explicit derivative through the k transition kernels. It also replaces the model expectation in the exact negative log-likelihood gradient by the finite reconstruction law; no equality between these gradients is asserted.

For the finite-state path calculation, let Ω:=Xk+1 with its full sigma-algebra, let Xs be the sth coordinate map, and define Pθ(A):=∑(x0,…,xk)∈Aq0(x0)∏s=0k−1Kθ(xs,xs+1),A⊆Ω. This is a probability measure. For every real f:X→R, set gf(x):={∑yKθk(x,y)f(y),q0(x)>0,0,q0(x)=0. Then gf(X0) is a version of EPθ[f(Xk)∣σ(X0)].

Statement references

Geoffrey Hinton, Section 2 of the full technical report derives the likelihood and reconstruction updates and notes the omitted contrastive-divergence derivative.

Kevin P. Murphy, Chapter 24, Section 24.2.2 defines the finite-step difference-of-KL contrastive-divergence objective.

The measure definition used for finite path laws.

The probability-measure definition used for finite path laws.

The conditional-expectation definition supplies the event-integral criterion used for the path calculation.

Positivity of the exponential gives positive finite-state model weights.

Facts & Assumptions

Given: A finite nonempty state space, open parameter domain, finite energy model, fixed data probability vector, positive differentiable stochastic matrix with invariant model law, and integer k≥1.

[A1]

For each state or state pair, the energy and transition entries have continuous coordinate partial derivatives on the open set Θ; every entry of Kθ is positive and each row sums to one.

[F1]

Energy-based density and partition function: pθ(x)=e−Eθ(x)/Zθ for an admissibly normalized energy model.

[F2]

Contrastive divergence with k transitions: the reconstruction law obeys Qj+1,θ(A)=∫Kθ(x,A) Qj,θ(dx); on a finite state space this is row-vector multiplication by Kθ.

[F3]

Contrastive divergence with k transitions: the population stop-gradient direction is Eq0∇θEθ−Eqk,θ∇θEθ.

[F4]

Finite probability vectors: a finite probability vector has nonnegative coordinates summing to one.

[F8]

The exponential function is smooth and (exp⁡)′=exp⁡: exp⁡′(u)=exp⁡(u) for every real u.

[F9]

The natural logarithm has derivative 1/x and equals the integral from 1 to x of 1/t: for u>0, log⁡′(u)=1/u for the natural logarithm.

[F10]

Measures on sigma-algebras: a measure vanishes on the empty set and is countably additive on pairwise disjoint sequences.

[F11]

Probability measures and probability spaces: a measure with total mass one is a probability measure.

[F12]

Conditional expectation given a sigma algebra: a conditional-expectation version is integrable, measurable with respect to the conditioning sigma-algebra, and has the same integral as the conditioned variable on every event in that sigma-algebra.

Proof

1.1givenA1F1F4F5F6F7F8F9F13algebra

Fix a coordinate j and vary only θj in a small interval inside the open set Θ. Since X is finite and each energy is real, [F13] makes every e−Eθ(x) positive; hence [F1] gives 0<Zθ<∞. The formula for pθ then gives positive coordinates summing to one, so it is a probability vector by [F4]. By [F6], [F7] and [F8], differentiating the finite sum gives ∂jZθ=−∑xe−Eθ(x)∂jEθ(x). The same chain and quotient rules give ∂jpθ(x)/pθ(x)=−∂jEθ(x)−∂jZθ/Zθ=−∂jEθ(x)+∑ypθ(y)∂jEθ(y); [F9] identifies the left side with ∂jlog⁡pθ(x). Because q0 is fixed and sums to one by [F4], differentiating L=−∑xq0(x)log⁡pθ(x) and summing this identity yields the displayed likelihood-gradient formula.

1.2givenA1F2F4F5F6algebra

The recurrence in [F2] gives qj+1,θ=qj,θKθ, hence qk,θ=q0Kθk and ∑xqk,θ(x)=1. For k=1 the product rule [F6] gives ∂j(q0Kθ)=q0∂jKθ. If ∂j(q0Kθk)=∑s=0k−1q0Kθs(∂jKθ)Kθk−1−s, then entrywise application of [F6] to q0KθkKθ yields ∑s=0k−1q0Kθs(∂jKθ)Kθk−s+q0Kθk(∂jKθ), which is the same formula with k+1 by appending the s=k term. Thus the stated product derivative holds for every k. Differentiating ∑xqk,θ(x)=1 by [F6] gives ∑x∂jqk,θ(x)=0. Strict positivity of Kθ and nonzero mass of q0 imply qk,θ(x)>0 for every x, so the following logarithms are finite.

1.3A1F4F10F11algebraconstruct

Put w(x0,…,xk):=q0(x0)∏s=0k−1Kθ(xs,xs+1). These weights are nonnegative. Summing successively over xk,…,x1 and using the row sums of Kθ reduces ∑ω∈Ωw(ω) to ∑x0q0(x0)=1. The set function Pθ(A)=∑ω∈Aw(ω) vanishes on the empty set and is countably additive: a disjoint sequence of subsets of finite Ω has only finitely many nonempty terms. Thus [F10] makes it a measure, and [F11] makes it a probability measure.

2.1givenA1F5F6F7F9step 1.1step 1.2algebra

By the quotient rule [F6], ∂j(qk,θ(x)/pθ(x))=∂jqk,θ(x)/pθ(x)−qk,θ(x)∂jpθ(x)/pθ(x)2; the chain and logarithm derivative rules [F7, F9] then give ∂jlog⁡(qk,θ(x)/pθ(x))=∂jqk,θ(x)/qk,θ(x)−∂jlog⁡pθ(x). Applying the product rule [F6] to each summand of DKL(qk,θ∥pθ) therefore gives ∂jqk,θ(x)(log⁡(qk,θ(x)/pθ(x))+1)−qk,θ(x)∂jlog⁡pθ(x). Summing the finite terms, the +1 contribution vanishes by step 1.2. Substitution from step 1.1 yields ∂jDKL(qk,θ∥pθ)=∑x∂jqk,θ(x)log⁡(qk,θ(x)/pθ(x))+∑xqk,θ(x)∂jEθ(x)−∑xpθ(x)∂jEθ(x).

2.2A1F4step 1.3algebra

For s=0, Kθ0=I is row-stochastic and its entries are the length-zero path weights. If the entries of Kθs sum the products along all length-s paths, then Kθs+1(x,y)=∑zKθs(x,z)Kθ(z,y) appends the final transition, so its entries sum the length-(s+1) path weights; also ∑yKθs+1(x,y)=∑zKθs(x,z)∑yKθ(z,y)=1. Thus Pθ(X0=x,Xk=y)=q0(x)Kθk(x,y). The function gf is finite-valued; for each Borel C⊆R, {gf(X0)∈C}=X0−1({x:gf(x)∈C}), so gf(X0) is σ(X0)-measurable. Both f(Xk) and gf(X0) are integrable since Ω is finite.

3.1givenF3F4F5F6F9step 1.1step 2.1algebra

Since q0 is fixed, the terms q0(x)log⁡q0(x) in DKL(q0∥pθ) have zero derivative; applying the same product and logarithm rules [F6, F9] and using the log-density formula from step 1.1 and ∑xq0(x)=1 gives ∂jDKL(q0∥pθ)=∑xq0(x)∂jEθ(x)−∑xpθ(x)∂jEθ(x). Subtracting step 2.1 cancels the model expectations and yields the stated ∂jCD⁡k formula. By [F3], the algorithm uses only its first two terms; the remaining sum is the derivative through Kθk. Comparing with step 1.1 also shows that the algorithm replaces the exact likelihood negative phase pθ by qk,θ.

4.1F12step 2.2algebra∎

Every event in σ(X0) has the form {X0∈B} for some B⊆X, since these preimages form a sigma-algebra and generate σ(X0). For every such event, step 2.2 gives ∫1{X0∈B}f(Xk) dPθ=∑x∈Bq0(x)∑yKθk(x,y)f(y)=∫1{X0∈B}gf(X0) dPθ, where terms with q0(x)=0 vanish. The integrability and measurability from step 2.2 and this event-integral identity satisfy [F12], so gf(X0) is the asserted conditional-expectation version.

4 · Examples, counterexamples and false statements

None yet.

Sources