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 moreConservation 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 ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersDividing IntegersUnit RatesProportionsPercent ConceptConverting Between Fractions, Decimals, and PercentsOperations with Rational NumbersTwo-Step EquationsSolving Multi-Step EquationsEquations with Variables on Both SidesAngle Pairs: Complementary, Supplementary, and VerticalParallel Lines and TransversalsCorresponding AnglesAlternate Interior AnglesTriangle Angle Sum TheoremExterior Angle TheoremTriangle Inequality TheoremSimilar Triangles: AA SimilaritySimilar Triangles: SSS and SAS SimilarityProportions in Similar TrianglesRight Triangle Trigonometry IntroductionSine, Cosine, and Tangent RatiosTrigonometric Ratios ReviewRadian MeasureConverting Between Degrees and RadiansThe Unit CircleGraphing Sine and CosineGraphing Tangent and Reciprocal Trigonometric FunctionsDerivatives of Trigonometric FunctionsAntiderivativesIndefinite IntegralsBasic Integration RulesRiemann SumsDefinite Integral DefinitionProbability Density Functions and Continuous DistributionsCumulative Distribution FunctionsContinuous Random VariablesProbability Density FunctionsExpected ValueWeak Law of Large NumbersProbability Axioms and RulesConditional ProbabilityProbabilistic Computation and BPPCredences and Epistemic ProbabilitiesConditionalization and Bayesian Updating

Longest path: 96 steps · 625 total prerequisite topics

Prerequisites (3)

Leads To (2)