Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-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.

Coordinate-ascent variational inference

Definition

Inputs: A finite number m≥1 of sigma-finite factor reference spaces (Ωj,Aj,μj), their product reference measure μ, a measurable target γ with finite positive normalizer, an admissible initial mean-field density q=∏j=1mqj, and a finite sweep count N≥0.

Output: The current admissible product density after at most N full sweeps, together with a status indicating whether the requested sweeps completed or a coordinate update was unavailable.

For each sweep t=1,…,N, visit coordinates in the fixed order j=1,…,m. At coordinate j, keep q−j:=∏k≠jqk fixed; for m=1, the empty product reference space is a singleton with unit measure μ−j and its density is 1. Form the conditional log expectation hj(zj):=∫∏k≠jΩklog⁡γ(zj,z−j)q−j(z−j) dμ−j(z−j). Use this signed integral only when it is defined without an ∞−∞ ambiguity and has a measurable extended-real version; require it to be finite for current qj-almost every zj. Set cj:=∫Ωjehj(zj) μj(dzj). If 0<cj<∞ and the normalized density qj∗(zj):=ehj(zj)/cj makes qj∗q−j an admissible member of the mean-field family, replace qj by qj∗. Otherwise stop and return the current density with status “coordinate update unavailable.”

The algorithm performs only the requested finite sweeps. It makes no convergence, stationary-point, global-optimum, calibration, or approximation-error claim. A separate theorem on this page proves exact coordinate monotonicity under these conditions.

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