Machine learning routinely needs distributions over very many random variables — but usually the direct interactions are between few of them. Representing the entire joint with a single function is inefficient computationally and statistically. The alternative: split the distribution into factors to multiply together. If influences , influences , and , then — each factor over fewer variables.
Worked example — why factoring wins
Factors cost parameters exponential in the variables they touch. Five binary variables as one raw joint: numbers. With the factorization of fig 3.7 below: . With 10-state variables the gap explodes: vs .
We describe such factorizations with graphs (in the graph-theory sense) — hence structured probabilistic models structured probabilistic model (Graphical model) a factorization of a joint distribution described by a graph: nodes = RVs, edges = direct interaction. defined in ch. 3 — open in glossary , or graphical models: each node is a random variable; an edge means the distribution can represent a direct interaction between the two.
Directed models
Directed models directed model Graphical model with directed edges: p(x) = Π p(xᵢ | Pa(xᵢ)) — factors are conditionals given parents. defined in ch. 3 — open in glossary factor into conditional distributions: one factor per variable, conditioned on its parents in the graph:
Term by term
| the parents of xᵢ — the nodes with arrows INTO it | node set | |
| each factor is a genuine conditional distribution — normalized on its own | one per variable |
click a node to see which factors mention it
Reading the graph is fast: and interact directly; and only indirectly, via .
Undirected models
Undirected models undirected model Graphical model with undirected edges: p(x) = (1/Z) Π φ⁽ⁱ⁾(C⁽ⁱ⁾) — non-negative clique factors, normalized by Z. defined in ch. 3 — open in glossary factor into plain functions — not distributions. Any fully-connected set of nodes is a clique , and each clique gets a factor . Bigger factor value = more likely configuration — but nothing makes the product sum to 1, so we divide by the normalizing constant normalizing constant Z: the sum/integral of the product of clique factors — divides the unnormalized product into a distribution (ch18's partition function). defined in ch. 3 — open in glossary :
Term by term
| a clique factor: non-negative, but NOT normalized — just a compatibility score | function ≥ 0 | |
| a clique — a set of mutually connected nodes | node set | |
| the sum/integral of the product over ALL states — the price of using unnormalized factors (ch. 18 is devoted to this object) | scalar |
click a node to see which factors mention it
What this really says
Directed vs undirected is a property of the description, not of the distribution: any distribution can be written both ways. The graphs are a language for saying which direct relationships a model chooses to represent — not mutually exclusive families. Parts I–II use this language only descriptively; Part III (ch. 16 onward) builds the machinery.
That closes the probability toolkit. One more set of fundamentals remains before machine learning proper: numerical computation — chapter 4.
Check yourself — structured probabilistic models
1.Five binary variables, factored per fig 3.7 vs one raw joint table. How do the parameter counts compare?
2.In the fig 3.7 widget you click node c. Predict what highlights.
3.What distinguishes undirected clique factors φ from the directed model's factors?
4.Is 'being directed' a property of a probability distribution?