liveBook · Manning

Marginal probability

As explained in Timeless Algorithms, The Foundational Ideas

A marginal probability is the probability assigned to a value of one variable after accounting for the possible values of other variables.

A marginal probability assigns probability to one variable after accounting for other possible values. In Bayes’ theorem, P(D) is the evidence: the total probability of observing D across competing hypotheses, used to normalize P(H|D). section 2.2.1

In probabilistic graphical models, belief propagation passes local probability summaries to estimate marginals. It is exact on loop-free graphs; on graphs with loops, updates are generally approximate and may not converge. section 10.3.2

P(H | D)= P(D | H) × P(H)P(D)

Bayes’ theorem places the marginal probability of the data in the denominator, normalizing the posterior. section 2.2.1

How Timeless Algorithms, The Foundational Ideas covers it

How deep it goes
Defines evidence as total probability across competing hypotheses and distinguishes exact tree-graph marginals from approximate, potentially nonconvergent loopy updates.
Examples
Uses unknown bits, coding constraints, and decoding messages to illustrate marginal inference as local belief updates.
What you can do after
Understand how evidence normalizes a posterior and how graph loops affect the exactness and convergence of marginal inference.
How it connects
Connects Bayes’ theorem with belief propagation and probabilistic graphical models.

Also explained in

Compare how 5 books explain marginal probability →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Timeless Algorithms, The Foundational Ideas. The section links point to the parts of the book it draws on.