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

Likelihood Ratios and Belief Updates

Graduate Depth 104 in the knowledge graph ☐ I know this ☆ Set as goal
19topics build on this
713prerequisites beneath it
See this on the map →
Bayes' TheoremBayesian Thinking in Practice+1 more→→Calibration Training
bayesian likelihood-ratio belief-updating quantitative-reasoning

Core Idea

The likelihood ratio is the engine of Bayesian updating: it measures how much more (or less) likely a piece of evidence is under one hypothesis compared to another. A likelihood ratio of 10 means the evidence is 10 times more likely if the hypothesis is true than if it is false — a strong update. A ratio near 1 means the evidence is equally expected either way — no update warranted. Thinking in likelihood ratios rather than raw probabilities makes Bayesian reasoning more intuitive: instead of juggling joint probabilities, you ask "how much more expected is this evidence under my hypothesis?" and shift your confidence proportionally. In log-odds form, updates become simple addition: log-odds posterior = log-odds prior + log likelihood ratio.

How It's Best Learned

Practice with the classic medical diagnosis example: a test with 99% sensitivity and 5% false positive rate gives a likelihood ratio of 99/5 ≈ 20. For a disease with 1% base rate (prior odds 1:99), a positive test gives posterior odds of 20:99, or about 17% — far from certainty despite a 99% accurate test. Work problems in both probability and log-odds form to build fluency with both representations.

Common Misconceptions

Explainer

From Bayesian thinking in practice, you know the habit of updating beliefs on evidence. From Bayes' theorem, you know the formula: P(H|E) = P(E|H) x P(H) / P(E). Likelihood ratios are the engine that makes this machinery intuitive rather than formulaic. Once you understand them, Bayesian updating becomes something you can do in your head, in real time, for everyday reasoning.

The likelihood ratio for a piece of evidence is simply: how much more likely is this evidence if my hypothesis is true than if it is false? Formally, LR = P(E|H) / P(E|not-H). A likelihood ratio of 10 means the evidence is 10 times more expected under the hypothesis than under the alternative -- a strong update toward H. A ratio of 1 means the evidence is equally likely either way -- no update at all. A ratio of 0.1 means the evidence is 10 times more expected if the hypothesis is false -- a strong update against H. The beauty of this formulation is that it separates the evidence's diagnostic power from your prior beliefs. The likelihood ratio tells you how much to shift; your prior tells you where you started. Together they determine where you end up.

Consider the classic medical diagnosis example. A test has 99% sensitivity (it catches 99% of true cases) and a 5% false positive rate. The likelihood ratio for a positive test is 99/5 = roughly 20. For a disease with a 1% base rate, your prior odds are 1:99. A positive test multiplies those odds by 20, giving posterior odds of 20:99, or about 17% probability of disease. This is far from the 99% that the test's "accuracy" might suggest -- and the likelihood ratio framework makes it immediately clear why. The test is good (LR of 20 is a strong update), but the prior is low (1:99 odds), and the prior has not been overcome. Without likelihood ratios, this result is counterintuitive and frequently miscalculated; with them, it is transparent.

The log-odds representation makes multi-evidence updating even more natural. In log-odds, Bayesian updating becomes simple addition: log-odds(posterior) = log-odds(prior) + log(LR1) + log(LR2) + ... . Each piece of evidence contributes an additive term. Weak evidence (log-LR near 0) barely shifts the sum; strong evidence (large log-LR) moves it substantially. Opposing pieces of evidence cancel. You can see at a glance how many weak pieces of evidence it takes to equal one strong one, and how a strong prior (large negative or positive log-odds) resists movement from moderate evidence. This additive structure is not just computational convenience -- it reflects the genuine way evidential weight accumulates, and it makes the relationship between evidence strength and belief change immediately legible.

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 → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Introduction to Propositional Logic → Introduction to Predicate Logic (First-Order Logic) → First-Order Logic Syntax → Terms and Atomic Formulas in FOL → Variable Binding and Scope → Open and Closed Formulas in First-Order Logic → Variable Substitution and Capture-Avoidance in First-Order Logic → Quantifier Instantiation Rules in First-Order Proof Systems → Universal Quantification: Meaning and Scope → Free Variables and Bound Variables → Substitution and Instantiation in Predicate Logic → Terms and Atomic Formulas → Formulas and Well-Formed Expressions → Structures and Interpretations → Model Interpretation and Satisfaction → Interpretation, Truth, and Satisfaction of Formulas → Logical Consequence and Entailment → Soundness Theorem and Validity of Proof Systems → Deductive Reasoning and Formal Proof Systems → First-Order Resolution → Propositional Resolution → Semantic Tableaux (Propositional) → Semantic Tableaux (First-Order) → Decidable Fragments of First-Order Logic → Gödel's Completeness Theorem for First-Order Logic → Gödel's Incompleteness Theorems → Introduction to Intuitionistic Logic → Introduction to Modal Logic → The Sensitivity Condition and Tracking Truth → Anti-Luck Conditions and Sensitivity → Epistemic Luck → Responses to the Gettier Problem → Process Reliabilism → Bayesian Epistemology → Bayesian Thinking in Practice → Likelihood Ratios and Belief Updates

Longest path: 105 steps · 713 total prerequisite topics

Prerequisites (3)

Leads To (1)