A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Conditionalization and Bayesian Updating

College Depth 95 in the knowledge graph ☐ I know this ☆ Set as goal
4topics build on this
625prerequisites beneath it
See this on the map →
Credences and Epistemic ProbabilitiesProbabilistic Computation and BPP+1 more→→Conservation of Expected EvidenceEvidential Support and Confirmation Formalization
bayesian-updating evidence learning

Core Idea

Conditionalization is the rule by which rational agents update credences in response to evidence: P_new(p) = P_old(p|e), where e is the agent's total evidence. The posterior probability of p given e equals the prior probability of p conditional on e. This rule ensures that repeated updating leads to convergence on the truth given enough evidence, and formalizes the intuition that learning should shift belief toward propositions consistent with observed evidence.

Explainer

You have learned that credences are degrees of belief — numbers between 0 and 1 representing how confident an agent is in a proposition. A credence of 1 is certainty, 0 is certainty of falsity, and 0.5 is maximum uncertainty. But credences are not static; rational agents receive evidence and must update their beliefs in light of it. The question is: what is the right rule for updating? Conditionalization provides a precise answer.

If your current credence in proposition *p* is P(p), and you then learn evidence *e* with certainty, your new credence in *p* should be P(p | e) — your old conditional probability of p given e. Formally: P_new(p) = P_old(p | e). This formula follows from the definition of conditional probability: P(p | e) = P(p ∧ e) / P(e). The numerator is the prior probability you assigned to worlds where both p and e are true; the denominator is the prior probability you assigned to e being true at all. The ratio tells you how much of e's prior probability-mass came from worlds where p also holds. If e is strongly correlated with p in your prior, then learning e raises your credence in p substantially.

The intuitive picture is illuminating. Imagine your beliefs as a probability distribution spread across many possible worlds. Before observing evidence, you distribute credence across those worlds according to your prior. When you learn that e is true, you eliminate all worlds where e is false and renormalize — redistributing the remaining probability mass proportionally among worlds where e holds. Propositions correlated with e become more credible; those anti-correlated become less credible. This is exactly what the conditionalization formula computes. The rule has a powerful convergence property: two rational agents who start with different priors but share evidence and conditionalize faithfully will, given enough evidence, converge on very similar credences. Evidence is the great leveler of disagreement. One important philosophical challenge is the problem of old evidence: conditionalization implies that learning something you already knew with certainty cannot change your beliefs. But it sometimes seems that recognizing old evidence bears on a new hypothesis should update you. This tension motivates ongoing Bayesian epistemology research into how to handle evidence and hypothesis formation in tandem.

What did you take from this?

Topics in reflective domains aren't scored by quiz answers. Read, reflect, and mark when you've thought it through.

Quiz me anyway →

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Angle Pairs: Complementary, Supplementary, and Vertical → Parallel Lines and Transversals → Corresponding Angles → Alternate Interior Angles → Triangle Angle Sum Theorem → Exterior Angle Theorem → Triangle Inequality Theorem → Similar Triangles: AA Similarity → Similar Triangles: SSS and SAS Similarity → Proportions in Similar Triangles → Right Triangle Trigonometry Introduction → Sine, Cosine, and Tangent Ratios → Trigonometric Ratios Review → Radian Measure → Converting Between Degrees and Radians → The Unit Circle → Graphing Sine and Cosine → Graphing Tangent and Reciprocal Trigonometric Functions → Derivatives of Trigonometric Functions → Antiderivatives → Indefinite Integrals → Basic Integration Rules → Riemann Sums → Definite Integral Definition → Probability Density Functions and Continuous Distributions → Cumulative Distribution Functions → Continuous Random Variables → Probability Density Functions → Expected Value → Weak Law of Large Numbers → Probability Axioms and Rules → Conditional Probability → Probabilistic Computation and BPP → Credences and Epistemic Probabilities → Conditionalization and Bayesian Updating

Longest path: 96 steps · 625 total prerequisite topics

Prerequisites (3)

Leads To (2)