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.

Expectation-maximization

Definition

Inputs. Supply a measurable parameter space (Θ,T), sigma-finite measure spaces (X,A,ν) and (Z,C,μ), and a jointly measurable complete-data density p(θ,x,z) relative to ν⊗μ that integrates to one on each parameter fiber, as in Latent-variable joint and observed-data factorization. This joint measurability is supplied explicitly and is not inferred from separate likelihood-density versions (Likelihood densities). Also supply fixed observed data x, an initial value θ0, a mode exact or generalized, and a candidate selector that returns either a candidate or unavailable in finite time at each call. Require 0<mθ0(x)<∞ and ∫qθ0x(z) ∣log⁡p(θ0,x,z)∣ μ(dz)<∞.

Write mθ(x):=∫Zp(θ,x,z) μ(dz),qθx(z):=p(θ,x,z)mθ(x) only when 0<mθ(x)<∞. By The observed density is the latent marginal under Tonelli, mθ is the observed-data density and qθx is a probability density on every such fiber. The observed log likelihood is ℓx(θ):=log⁡mθ(x) on those fibers.

At each valid iterate θt, set qt:=qθtx and define Q(θ∣θt):=∫Zlog⁡p(θ,x,z) qt(z) μ(dz) only for candidates where this integral is finite. Use log⁡0=−∞ and set qt∣log⁡p∣=0 wherever qt=0. The Q integral itself is choice-free. To test finite KL when qtμ≪qθxμ, assume AC as required by The Axiom of Choice and Kullback–Leibler divergence; when absolute continuity fails, D=+∞ by that definition without AC. An admissible candidate θ also satisfies 0<mθ(x)<∞, qtμ≪qθxμ, and D(qtμ∥qθxμ)<∞, where the direction of D is that of Kullback–Leibler divergence. Require ∫qt∣log⁡p(θ,x,⋅)∣ dμ<∞ for each candidate and ∫qt∣log⁡p(θt,x,⋅)∣ dμ<∞ for the current iterate.

Output. Emit the iterate sequence beginning with θ0. If a stopping condition occurs after T successful updates, return the finite list (θ0,…,θT) and a status recording the first unavailable condition or selector result; do not append a failed candidate. If no stopping condition occurs, the emitted sequence is infinite and there is no finite stopping status.

Procedure. For t=0,1,2,…, check that 0<mθt(x)<∞; if not, return the current list with status stopped: invalid current marginal. Form qt and Q(⋅∣θt) on admissible candidates. If Q(θt∣θt) is not finite, return with status stopped: current Q is not finite. Call the supplied selector. In exact mode, its candidate set must consist of admissible candidates and contain θt; it returns an attained maximizer of Q on that set, or unavailable if no attained maximum is available. In generalized mode, it returns any admissible θt+1 with Q(θt+1∣θt)≥Q(θt∣θt), or unavailable if no such update is supplied. If the selector returns unavailable, return with status stopped: no required update supplied; otherwise append its candidate and continue. The procedure asserts no convergence or global-optimality property and makes no assertion for a candidate that loses current latent support.

Depends on

Used by

Dependency tree · two levels

43 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