Fully factorized mean-field inference
Mathematical Methods AIMech:FullyFactorizedMeanFieldInference DRAFT
Aliases: Naive mean-field inference, Fully factorized variational inference
A variational inference method that restricts its approximating distribution to a product of single-variable factors and adjusts those factors to reduce the approximation-to-target Kullback–Leibler divergence.
Identity Notes & Concept Scope
This is the complete-factorizability mean-field construction, not a claim that the target variables are actually independent. It is the singleton-factor limit of structured mean field and differs from block or chain factors that retain dependencies. The approximation family and variational objective do not prescribe BBVI’s score-function estimator, amortized recognition, a training algorithm or any particular probabilistic model. Factorization depends on the declared variable units; treating a whole chain as one variable would be a different, structured partition at the state-variable level. No normalized identity match was found across all 442 pinned AIO labels/scoped synonyms and 382 preceding native IDs/names/aliases for the four researched candidates. Both full-checkout fixed-string searches included ignored and hidden files, with 45 and 45 matching lines. All 31 unique matched contents were read: prior specialized inference records, source/review context and pending leads, not exact records for the three new identities. Expanded titles, source IDs, plural forms and complete/partial-factorizability terminology were included. All 68 semantic label/synonym hits and 23 exact fully annotated AIO CLASS nodes with outgoing edges were read. Their generated YAMLs and seven native neighbors were read or byte-verified unchanged after prior complete reading, totaling 30 contextual records. The broader phrase structured variational inference is searched but not asserted as an unconditional alias of structured mean field. Boltzmann trees remains an unresolved full-text lead. Absence is bounded to the pinned vocabulary and inspected neighborhood.
Claims & Grounded Evidence
1 Claim
Mechanism
#method
For a fixed target p(s)=exp(F(s))/Z, choose q(s)=product_i q_i(s_i) and maximize E_q[F]+H(q), equivalently minimizing KL(q||p). For the source’s binary s_i in {-1,+1} and F(s)=sum_(i<j) J_ij*s_i*s_j+sum_i h_i*s_i, write q_i(s_i)=(1+m_i*s_i)/2. Distinct-variable moments factor as E_q[s_i*s_j]=m_i*m_j, and entropy is the sum of the binary factor entropies. Interior stationarity gives atanh(m_i)=h_i+sum_(j!=i) J_ij*m_j, with symmetric interaction indexing. Updating one mean to tanh of that effective field while holding the others fixed solves its coordinate subproblem. These equations characterize the chosen approximate inference problem; they do not compute the exact target marginals in general.
⚠️ Curated Limitations & Negative Results
- The product family discards all dependence among the declared individual variables. Matching or optimizing its means does not certify correct covariance, calibrated uncertainty or exact posterior recovery.
- KL(q||p) is directional and differs from KL(p||q). A lower bound equals log Z only when the approximating distribution equals the target almost everywhere under appropriate support conditions.
- Stationarity equations do not ensure global optimality. Exact sequential singleton updates can increase the bound, while synchronous fixed-point iteration can decrease it or fail to converge.
- The tanh equations apply to the stated binary pairwise energy and parameter convention. Other state spaces, higher-order factors or restricted factor families need their own expectations and updates.
- Using approximate hidden statistics in learning is a further choice; the approximation alone does not establish monotonic observed likelihood. No model fitting, author implementation or empirical accuracy claim is included.
Artificial Intelligence Ontology (AIO) Grounding
Mapped AIO Classes
| AIO Target Class | Mapping Relation | Mapping Rationale |
|---|---|---|
AIO:ProbabilisticGraphicalModel
Probabilistic Graphical Model
|
related_match | The method approximates distributions whose dependence structure is represented by a graph. The pinned target denotes a graphical-model task, while this local concept denotes a variational inference method; the relation is method-to-modeling context, not an is-a assertion. |
AIO:BoltzmannMachineNetwork
Boltzmann Machine Network
|
related_match | The primary derivation approximates the binary pairwise Boltzmann distribution and its hidden-variable statistics. The AIO target is the probabilistic network family, not the approximation procedure. This direct method-to-model relation does not restrict the method to one trained network. |
Evidence Sources & Primary Literature
1 Source| Source ID | Publication / Document | Type / Access | Reference & Checksum |
|---|---|---|---|
method-source
|
Lawrence K. Saul, Michael I. Jordan
|
primary paper
full_text
|
ID: https://proceedings.neurips.cc/paper/1995/hash/285f89b802bcb2651801455c86d78f2a-Abstract.html
sha256:d0a9f10a9d70…
|
Curation Provenance
Curator: Codex
Method: ai_assisted
Model: GPT-6
Created: 2026-10-11T20:15:57Z
Updated: 2026-10-11T20:15:57Z
Source File:
data/curated/FullyFactorizedMeanFieldInference.yaml