Alphabeta Math
DefinitionDefinition: 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.

Variational autoencoder model, encoder, and ELBO

Definition

Let (X,AX,μX) and (Z,AZ,μZ) be sigma-finite measure spaces; that is, each has a countable measurable cover by sets of finite measure. Let Θ⊆Rdθ and Φ⊆Rdϕ be parameter sets of finite dimension. A latent-variable model with parameter θ∈Θ consists of a measurable prior density rθ(z)≥0 on Z and a decoder density dθ(x∣z)≥0 on X for each z, with ∫Zrθ(z) dμZ(z)=1,∫Xdθ(x∣z) dμX(x)=1. The decoder is jointly measurable in (x,z), and the joint model density is pθ(x,z)=γθ(z;x):=rθ(z)dθ(x∣z) relative to μX⊗μZ. The decoder is also called the generative model: after drawing z from the prior, it assigns a conditional density to the observation x.

For a fixed observation x, the evidence density and posterior density are Zθ(x):=pθ(x):=∫Zγθ(z;x) dμZ(z),πθ(z∣x):=γθ(z;x)Zθ(x). Use this posterior only when 0<Zθ(x)<∞. A variational encoder is a jointly measurable family of functions qϕ(z∣x)≥0 on Z, parameterized by ϕ∈Φ and normalized by ∫Zqϕ(z∣x) dμZ(z)=1 for every (ϕ,x); the same parameter ϕ is used for each observation. For an admissible triple (θ,ϕ,x) require 0<Zθ(x)<∞ and qϕ(z∣x)=0μZ-almost everywhere on {z:πθ(z∣x)=0},∫Zqϕ(z∣x)(∣log⁡γθ(z;x)∣+∣log⁡qϕ(z∣x)∣) dμZ(z)<∞. Terms multiplied by qϕ=0 are defined to be zero. The evidence lower bound is ELBO⁡θ,ϕ(x):=∫Zqϕ(z∣x)(log⁡γθ(z;x)−log⁡qϕ(z∣x)) dμZ(z).

A pathwise representation of the encoder at x is a probability space (E,F,ρ) whose law ρ is independent of θ and ϕ, together with a measurable map gϕ(ϵ,x) such that the law of gϕ(ϵ,x) for ϵ∼ρ is the measure with density qϕ(⋅∣x) relative to μZ. This representation defines how to generate encoder samples; it does not by itself assert that differentiation may pass through an expectation.

Depends on

Used by

Dependency tree · two levels

16 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