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 , sigma-finite measure spaces and , and a jointly measurable complete-data density 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 , an initial value , a mode exact or generalized, and a candidate selector that returns either a candidate or unavailable in finite time at each call. Require and
Write only when . By The observed density is the latent marginal under Tonelli, is the observed-data density and is a probability density on every such fiber. The observed log likelihood is on those fibers.
At each valid iterate , set and define only for candidates where this integral is finite. Use and set wherever . The Q integral itself is choice-free. To test finite KL when , assume AC as required by The Axiom of Choice and Kullback–Leibler divergence; when absolute continuity fails, by that definition without AC. An admissible candidate also satisfies , , and where the direction of is that of Kullback–Leibler divergence. Require for each candidate and for the current iterate.
Output. Emit the iterate sequence beginning with . If a stopping condition occurs after successful updates, return the finite list 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 , check that ; if not, return the current list with status stopped: invalid current marginal. Form and on admissible candidates. If 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 ; it returns an attained maximizer of on that set, or unavailable if no attained maximum is available. In generalized mode, it returns any admissible with , 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
- A generalized EM step can increase Q without maximizing it Example
- A support-losing candidate has infinite directional KL Example
- An EM likelihood with two strict local maxima Example
- Gaussian mixture likelihood is unbounded under covariance collapse Example
- Responsibilities in a two-component mixture Example
- EM does not decrease the observed log likelihood Theorem
- Generalized EM does not decrease the observed log likelihood under Q-ascent Theorem
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
- A. P. Dempster, N. M. Laird and D. B. Rubin, Maximum likelihood from incomplete data via the EM algorithm (standard reference, not scraped)
- Mario A. T. Figueiredo, Lecture Notes on the EM Algorithm (2004) (standard reference, not scraped)