Skip to main content

foundations · Essay 15 · 22 min

Bayesian Epistemology

Bayesian epistemology models belief as graded credence (probability) and rational update as conditionalization on evidence. The page gives the formal apparatus (probability axioms, Bayes's rule, conditionalization), the Dutch-book argument that incoherent priors guarantee guaranteed loss, the canonical medical-test worked example, four major critiques (the prior problem, old evidence, logical omniscience, the bootstrap circularity), and three exercises with worked answers.

What It Is

Bayesian epistemology is the dominant formal framework for modeling belief, evidence, and rational update in modern philosophy. It rests on three theses:

  1. Belief is graded. An agent's epistemic state is not just a set of accepted propositions but a distribution: a credence (degree of confidence) attached to each proposition.
  2. Rational credence is probabilistic. Coherent credences must satisfy the standard axioms of probability theory.
  3. Rational update is conditionalization. When an agent learns new evidence, the rational update is to apply Bayes's rule: the new credence in HH given EE is P(HE)=P(EH)P(H)/P(E)P(H \mid E) = P(E \mid H) P(H) / P(E).

This framework is the formal core of Induction and Hume's Problem treatment of inductive inference, the formal apparatus behind probabilistic ML models, and the underlying theory of test-result calibration in medicine and law.

This page assumes What Is Epistemology? and Induction and Hume's Problem. The empiricism-induction essay in this series provides the AI-specific application.

The Formal Apparatus

Probability axioms (Kolmogorov)

A credence function PP over a set of propositions Ω\Omega assigns a real number to each proposition such that:

  • Non-negativity. P(A)0P(A) \geq 0 for every proposition AA.
  • Normalization. P()=1P(\top) = 1 for the tautology \top (and equivalently P(Ω)=1P(\Omega) = 1 for the certainty event).
  • Additivity. For disjoint propositions A1,A2,A_1, A_2, \ldots, P(A1A2)=P(A1)+P(A2)+P(A_1 \lor A_2 \lor \ldots) = P(A_1) + P(A_2) + \ldots (countable additivity in the standard axiomatization).

A coherent credence function is one that satisfies these axioms. The Bayesian thesis is that rational credence is coherent.

Conditional probability and Bayes's rule

Conditional probability is defined for P(B)>0P(B) > 0 by:

P(AB)=P(AB)P(B).P(A \mid B) = \frac{P(A \land B)}{P(B)}.

Bayes's rule rearranges this with P(BA)=P(AB)/P(A)P(B \mid A) = P(A \land B) / P(A):

P(HE)=P(EH)P(H)P(E).P(H \mid E) = \frac{P(E \mid H) \, P(H)}{P(E)}.

Reading the rule. Given evidence EE, the posterior credence in hypothesis HH is the likelihood of the evidence under the hypothesis (P(EH)P(E \mid H)) times the prior credence in the hypothesis (P(H)P(H)), normalized by the total probability of the evidence (P(E)P(E)). The denominator can be expanded by the law of total probability:

P(E)=HP(EH)P(H),P(E) = \sum_{H'} P(E \mid H') P(H'),

where the sum runs over all mutually exclusive hypotheses.

The conditionalization rule

When the agent learns evidence EE for certain (i.e., the agent's posterior credence in EE becomes 1), the rational update is:

Pnew(H)=Pold(HE)P_{\text{new}}(H) = P_{\text{old}}(H \mid E)

for every hypothesis HH. This is strict conditionalization. A weaker variant, Jeffrey conditionalization (Jeffrey 1965)1, handles cases where the agent's confidence in EE shifts but does not reach certainty:

Pnew(H)=Pnew(E)Pold(HE)+Pnew(¬E)Pold(H¬E).P_{\text{new}}(H) = P_{\text{new}}(E) P_{\text{old}}(H \mid E) + P_{\text{new}}(\neg E) P_{\text{old}}(H \mid \neg E).

Jeffrey conditionalization reduces to strict conditionalization when Pnew(E)=1P_{\text{new}}(E) = 1.

The Dutch Book Argument

Why should rational agents have coherent credences? The most influential answer is the Dutch book argument, due in different versions to Frank Ramsey (1926) and Bruno de Finetti (1937).2

A Dutch book is a set of bets, each individually fair according to the agent's credences, that together guarantee the agent a sure loss regardless of what happens.

The theorem (Ramsey-de Finetti). An agent's credences satisfy the probability axioms iff no Dutch book can be constructed against the agent.

The argument structure (illustrative). Suppose an agent's credences are incoherent: P(A)=0.6P(A) = 0.6, P(¬A)=0.6P(\neg A) = 0.6. (These should sum to 1, but they sum to 1.2: incoherence in the additivity axiom.)

The agent treats each credence as the fair price of a bet that pays $1 if the proposition is true. So the agent will pay 0.60forabeton0.60 for a bet on A(paying(paying1 if AA, otherwise 0)and0) and 0.60 for a bet on ¬A\neg A. Total cost: $1.20.

In the actual world, exactly one of AA or ¬A\neg A is true. The agent receives exactly 1inwinnings.Netloss:1 in winnings. Net loss: 0.20, regardless of which proposition is true.

This is a guaranteed loss. The agent's incoherent credences make the loss inevitable. Coherence (probability axioms) prevents such constructions.

What the argument does and does not establish

The Dutch book argument establishes that if the agent acts on her credences as betting prices, then coherent credences are necessary to avoid sure loss. The argument is technically clean and uncontested.

What it does not establish:

  • Coherence is sufficient for rationality. An agent with coherent but absurd credences (e.g., P(the sun rises tomorrow)=0.001P(\text{the sun rises tomorrow}) = 0.001) is not Dutch-bookable but is still epistemically defective. Coherence is necessary, not sufficient.
  • Credences must literally be betting prices. The argument assumes the agent acts on credences as if they are betting prices, which is an idealization. Real agents may not.
  • Real-world rationality requires probabilities. Some philosophers (Pollock, Glymour) argue that the Dutch-book setup is too idealized; rational agents in the real world should have fuzzy or imprecise credences, not point probabilities.

The argument is the strongest pragmatic defense of probabilistic epistemology. It is not the only defense, and there are debates about how much weight to put on it.

A Worked Example: Medical Test

The canonical illustration of Bayesian reasoning in practice. Suppose:

  • A disease has prevalence (base rate) P(D)=0.001P(D) = 0.001 (one in 1,000 in the population).
  • A test for the disease has sensitivity P(+D)=0.99P(+ \mid D) = 0.99 (true positive rate).
  • The test has specificity P(¬D)=0.95P(- \mid \neg D) = 0.95, equivalently false-positive rate P(+¬D)=0.05P(+ \mid \neg D) = 0.05.

A patient takes the test and gets a positive result. What is the probability the patient has the disease?

The naive answer (which most people, including most physicians, give): around 95-99 percent. The correct Bayesian answer: about 2 percent.

The calculation. By Bayes's rule:

P(D+)=P(+D)P(D)P(+)=P(+D)P(D)P(+D)P(D)+P(+¬D)P(¬D).P(D \mid +) = \frac{P(+ \mid D) P(D)}{P(+)} = \frac{P(+ \mid D) P(D)}{P(+ \mid D) P(D) + P(+ \mid \neg D) P(\neg D)}.

Substituting:

P(D+)=(0.99)(0.001)(0.99)(0.001)+(0.05)(0.999)=0.000990.00099+0.04995=0.000990.050940.0194.P(D \mid +) = \frac{(0.99)(0.001)}{(0.99)(0.001) + (0.05)(0.999)} = \frac{0.00099}{0.00099 + 0.04995} = \frac{0.00099}{0.05094} \approx 0.0194.

The posterior probability is about 1.94 percent, dramatically lower than the test's sensitivity (99 percent). The reason: the disease is rare. Most positive tests come from the much larger population of healthy people who happen to test positive (false positives), not from the small population of sick people who test positive (true positives).

This is base-rate neglect: failing to weight the prior. The Bayesian framework forces this error to the surface. Repeating the calculation for a population where the base rate is 10 percent (rather than 0.1 percent) gives a posterior of about 69 percent: dramatically different.

The lesson generalizes. Posterior probability depends on prior probability. A test result, however reliable individually, must be combined with the base rate to give a meaningful conclusion. The same test produces different posteriors in different populations.

Strengths

Three working strengths of the Bayesian framework.

Quantitative coherence

Probability theory is the mature framework for reasoning about uncertainty. Once the prior and the likelihoods are specified, posterior calculation is mechanical: there is exactly one number, by Bayes's rule. This is a substantial advantage over more qualitative frameworks where update is left informal.

Treatment of evidence

Bayesian conditionalization handles evidence cleanly. Evidence updates credence in proportion to the Bayes factor: P(EH1)/P(EH2)P(E \mid H_1) / P(E \mid H_2) for two hypotheses H1H_1 and H2H_2. A high Bayes factor means evidence strongly favors H1H_1 over H2H_2. The Bayes factor depends only on the likelihoods, not on the prior, and so is the theory-neutral part of inference.

Connection to scientific practice

Bayesian methods are now standard in many scientific fields: statistical inference (vs frequentist), genetics (likelihood-based phylogeny), neuroscience (predictive coding), and machine learning (probabilistic graphical models, Bayesian neural networks, conformal prediction). The framework is not a philosophical curiosity; it is a working tool with empirical track record.

Major Objections

The framework has serious open problems. Each constitutes a real philosophical issue.

The prior problem

The most severe. Bayesian update transforms a prior into a posterior. The framework justifies the transformation but not the prior. Where does the prior come from?

Two main positions:

Subjective Bayesianism (de Finetti, Savage, Howson and Urbach). The prior is the agent's degree of belief, formed however. Different agents may have different priors. The framework requires only that priors be coherent; it does not select among coherent priors. Convergence theorems (de Finetti exchangeability, Doob martingale) show that under broad conditions, agents with different priors converge to similar posteriors as evidence accumulates, but the convergence requires conditions that may not hold in practice.

Objective Bayesianism (Jeffreys, Jaynes, Williamson). Priors should be selected by formal principles such as the principle of indifference, maximum entropy, or symmetry. The principles aim to select a unique prior given the agent's background knowledge. Critics argue these principles often produce different priors depending on how the problem is parametrized, undermining the claim of objectivity.

For working applications, the prior choice often matters substantially. A weakly-informative prior in a Bayesian neural network can dominate the posterior with limited data; an informative prior reflecting domain expertise can substantially help. Neither subjective nor objective Bayesianism gives a fully satisfying account.

The old evidence problem

Suppose a hypothesis HH predicts an already-known phenomenon EE. Naively, learning HH should be confirmed by EE. But by Bayesian conditionalization, P(HE)P(H \mid E) depends on P(E)P(E). If EE is already known with certainty, P(E)=1P(E) = 1, and Bayes's rule gives P(HE)=P(HE)/1=P(HE)P(H \mid E) = P(H \land E) / 1 = P(H \land E), which is just P(H)P(H) if HH entails EE. The evidence does not raise the credence in HH.

This is the old evidence problem (Glymour 1980).3 Famous physical examples: general relativity was confirmed in part by its prediction of the perihelion precession of Mercury, which was already known when Einstein developed the theory. Most working scientists treat this as a substantial confirmation; the Bayesian framework, taken at face value, says no confirmation is provided.

Responses split. Some hold the framework should accommodate counterfactual reasoning ("if I had not known EE, what would the impact have been"). Others hold the framework should incorporate logical learning (the surprise that HH entails EE, not just that EE holds). Neither solution is fully satisfactory; the problem is generally regarded as a real challenge to strict subjective Bayesianism.

Logical omniscience

The Bayesian framework treats the agent as logically omniscient: every logical truth has credence 1, every contradiction has credence 0, and the agent's credences are closed under logical entailment. Real agents do not satisfy these requirements. We discover mathematical truths over time; we hold beliefs we will later see were inconsistent.

This is the logical omniscience problem (Hacking 1967). Several formal extensions weaken the assumption: bounded rationality approaches treat the agent as having finite computational resources; probability-with-ignorance approaches model uncertainty about logical truths. The standard framework remains the idealized one, with the bounded extensions an active area of research.

The bootstrap problem

The Bayesian framework justifies update given a prior. The prior can be evaluated against the conditionalization theorem: with this prior, what does the framework predict? But the framework itself must be justified.

Glymour 1980 argued that justifying Bayesianism requires a stance toward the framework's own assumptions, which is itself an inferential question. If we use Bayesian update to assess the framework's reliability, we presuppose the framework. If we use a different framework, we presuppose that framework. The choice between frameworks cannot be justified within any single framework.

This is the bootstrap problem. It mirrors Hume's circularity problem at the meta-level: the framework that justifies inductive inference cannot itself be inductively justified without circularity. Most Bayesians accept this as a feature, not a defect: every framework faces some version of the bootstrap problem, and the Bayesian one is at least precisely formulated.

Connection to AI and Machine Learning

Modern ML is, broadly, Bayesian-flavored. The connection runs through several specific techniques.

Probabilistic graphical models

Bayesian networks (Pearl 1988) and Markov random fields (Geman and Geman 1984) represent joint probability distributions as graphs. The graphical structure encodes conditional independence; the parameters are estimated from data via maximum likelihood or Bayesian inference. These models are the precursor of modern probabilistic deep learning.

Bayesian neural networks

Standard neural networks return point estimates. Bayesian neural networks (BNNs) maintain posterior distributions over network weights. Predictions are then averaged over the posterior, providing uncertainty estimates. The computational cost is substantial; modern BNN approximations (variational inference, MCMC, deep ensembles, dropout-as-Bayesian-approximation) make the method practical for some scales.

Conformal prediction

A non-Bayesian but related approach. Given a model and held-out calibration data, conformal prediction provides a set of possible predictions guaranteed to contain the true outcome with a specified probability (under exchangeability). The framework is distribution-free: no specific likelihood model is required. Modern conformal methods (Vovk, Shafer 2005; Angelopoulos, Bates 2022) provide the cleanest current empirical-confidence framework for ML deployment.

Calibration

Calibration is the empirical Bayesian property of an ML model: the model's stated confidence should match its actual accuracy. A model that says "I am 90 percent confident" should be right 90 percent of the time on the cases where it makes that claim. Modern ML systems (LLMs especially) are often miscalibrated: confidence does not track accuracy. Recalibration techniques (temperature scaling, Platt scaling) rescale model outputs to improve calibration. The conceptual content of calibration is Bayesian.

Decision theory

Bayesian decision theory selects actions to maximize expected utility under the posterior distribution. The framework underwrites everything from clinical decision-making to portfolio construction to AI-system action selection. Where utilities are clear and posteriors are well-calibrated, the framework gives a clean decision procedure.

Common Confusions

Confusion 1: Bayesianism solves Hume. It does not. Bayesian conditionalization gives a precise framework for rational update given a prior. The prior itself is not justified by the framework. Hume's problem reappears as the prior problem. See Induction and Hume's Problem.

Confusion 2: prior probability equals "what I think before any evidence." Sort of. The prior is the agent's credence in a hypothesis before the specific evidence in question is considered. But priors typically incorporate background knowledge, broader theoretical commitments, and previous evidence considered. The "prior" is a working tool, not a literal blank-slate state.

Confusion 3: posterior equals truth. The posterior is the agent's updated credence in HH given EE. It is the rational degree of belief. It is not necessarily true. With a bad prior or misleading evidence, the posterior can be confidently wrong.

Confusion 4: Bayesian methods are just statistics. Bayesian methods are also a framework for rationality with normative commitments. The frequentist statistical school and the Bayesian school disagree on what statistical inference is for. This disagreement is not just technical; it is philosophical, about the meaning of probability and the nature of evidence.

Three Exercises

Exercise 1. A test for a condition has sensitivity 0.950.95 and specificity 0.900.90. The condition has prevalence 0.010.01 in the population.

(a) Compute the probability that a randomly-selected person who tests positive actually has the condition. (Apply Bayes's rule.)

(b) The same test is applied to a population where the prevalence is 0.200.20 (a high-risk subpopulation). Recompute.

(c) Comment on the policy implication: under what conditions is a positive test result strong evidence of the condition?

Exercise 2. Suppose a forecaster makes 100 predictions, each with stated confidence levels. Let CpC_p denote the set of predictions with stated confidence pp, and let ApA_p denote the empirical accuracy on CpC_p. The forecaster is calibrated iff Ap=pA_p = p for all pp.

(a) The forecaster's predictions and accuracies are: 30 predictions at 0.5 confidence (60 percent accuracy), 40 predictions at 0.7 confidence (75 percent accuracy), 30 predictions at 0.9 confidence (90 percent accuracy). Is the forecaster calibrated?

(b) If not, identify which confidence level is over-confident, which is under-confident, and which is calibrated.

(c) Interpret the results. What does it mean if a forecaster is over-confident in some range and under-confident in another?

Exercise 3. Two hypotheses, H1H_1 (the coin is fair) and H2H_2 (the coin is biased to land heads with probability 0.7), are equally likely a priori: P(H1)=P(H2)=0.5P(H_1) = P(H_2) = 0.5. We flip the coin three times and observe HHH (three heads).

(a) Compute the likelihoods P(HHHH1)P(\text{HHH} \mid H_1) and P(HHHH2)P(\text{HHH} \mid H_2).

(b) Compute the Bayes factor P(HHHH2)/P(HHHH1)P(\text{HHH} \mid H_2) / P(\text{HHH} \mid H_1).

(c) Compute the posterior probabilities P(H1HHH)P(H_1 \mid \text{HHH}) and P(H2HHH)P(H_2 \mid \text{HHH}).

(d) How many heads in a row would we need before the posterior on H2H_2 exceeds 0.95?

Sketch of answers

Answer 1.

(a) By Bayes:

P(condition+)=(0.95)(0.01)(0.95)(0.01)+(10.90)(10.01)=0.00950.0095+0.099=0.00950.10850.0876.P(\text{condition} \mid +) = \frac{(0.95)(0.01)}{(0.95)(0.01) + (1 - 0.90)(1 - 0.01)} = \frac{0.0095}{0.0095 + 0.099} = \frac{0.0095}{0.1085} \approx 0.0876.

About 8.8 percent. Despite a positive test, the probability the person has the condition is well under 10 percent in a low-prevalence population.

(b) Substituting prevalence 0.200.20:

P(condition+)=(0.95)(0.20)(0.95)(0.20)+(0.10)(0.80)=0.190.19+0.08=0.190.270.7037.P(\text{condition} \mid +) = \frac{(0.95)(0.20)}{(0.95)(0.20) + (0.10)(0.80)} = \frac{0.19}{0.19 + 0.08} = \frac{0.19}{0.27} \approx 0.7037.

About 70 percent. The same test now gives much stronger evidence.

(c) Policy implication: a positive test result is strong evidence of the condition only when (i) the population's base rate is meaningful (rare conditions need follow-up), and (ii) the test's specificity is high. For low-prevalence conditions, follow-up testing is essential because a single positive does not adequately update credence. This is why screening protocols (mammography, prostate cancer screening) often include follow-up testing rather than treatment based on a single positive.

Answer 2.

(a) Not calibrated.

(b) At 0.5 confidence, accuracy is 0.60: under-confident (the forecaster should have higher confidence on these predictions). At 0.7 confidence, accuracy is 0.75: under-confident. At 0.9 confidence, accuracy is 0.90: calibrated.

(c) An under-confident forecaster systematically underestimates her own reliability. This is a different kind of failure from over-confidence (where a forecaster systematically overestimates). Under-confidence is sometimes called epistemic humility error: real but corrigible by recalibration. Over-confidence in a forecaster has more substantial consequences: action taken on the basis of confident-but-wrong forecasts is harder to recover from.

The same diagnostic applies to ML systems. A miscalibrated model might be over-confident on out-of-distribution data and under-confident on in-distribution data. Recalibration techniques (temperature scaling, Platt scaling, isotonic regression) rescale outputs to align with empirical accuracy.

Answer 3.

(a) Under H1H_1 (fair coin): P(HHHH1)=(0.5)3=0.125P(\text{HHH} \mid H_1) = (0.5)^3 = 0.125.

Under H2H_2 (biased): P(HHHH2)=(0.7)3=0.343P(\text{HHH} \mid H_2) = (0.7)^3 = 0.343.

(b) Bayes factor: 0.343/0.125=2.7440.343 / 0.125 = 2.744. Roughly 2.7 times more likely under H2H_2 than under H1H_1.

(c) Apply Bayes's rule:

P(H2HHH)=P(HHHH2)P(H2)P(HHHH1)P(H1)+P(HHHH2)P(H2)=(0.343)(0.5)(0.125)(0.5)+(0.343)(0.5)=0.17150.2340.733.P(H_2 \mid \text{HHH}) = \frac{P(\text{HHH} \mid H_2) P(H_2)}{P(\text{HHH} \mid H_1) P(H_1) + P(\text{HHH} \mid H_2) P(H_2)} = \frac{(0.343)(0.5)}{(0.125)(0.5) + (0.343)(0.5)} = \frac{0.1715}{0.234} \approx 0.733.

So P(H2HHH)0.733P(H_2 \mid \text{HHH}) \approx 0.733 and P(H1HHH)0.267P(H_1 \mid \text{HHH}) \approx 0.267.

(d) We want P(H2nH)0.95P(H_2 \mid n\text{H}) \geq 0.95. With equal priors, this becomes:

(0.7)n(0.5)n+(0.7)n0.95.\frac{(0.7)^n}{(0.5)^n + (0.7)^n} \geq 0.95.

Cross-multiplying: (0.7)n0.95((0.5)n+(0.7)n)(0.7)^n \geq 0.95 \cdot ((0.5)^n + (0.7)^n), simplifying to 0.05(0.7)n0.95(0.5)n0.05 (0.7)^n \geq 0.95 (0.5)^n, then (0.7/0.5)n19(0.7/0.5)^n \geq 19. We need (1.4)n19(1.4)^n \geq 19, so nlog(19)/log(1.4)2.944/0.3368.76n \geq \log(19) / \log(1.4) \approx 2.944 / 0.336 \approx 8.76. We need at least 9 heads in a row. Verify: at n=9n = 9, posterior is approximately 0.96; at n=8n = 8, approximately 0.93.

This exercise illustrates how Bayesian inference accumulates evidence: each independent observation multiplies the Bayes factor, and exponential evidence quickly compounds. The connection to standard sequential statistical-test design is direct.

Where Bayesian Epistemology Lives in Practice

Three concrete uses.

Clinical decision-making and diagnostic reasoning. The medical-test calculation above is the standard pattern. Bayesian reasoning is the correct framework for combining test results with population base rates. The Cochrane reviews, GRADE evidence-quality framework, and modern evidence-based-medicine practice all build on this foundation. The challenge is that physicians are not trained in formal Bayesian methods and base-rate neglect is widespread; calibration training is an active area in medical education.

ML calibration and uncertainty quantification. As above. Modern ML benchmarks (such as the Expected Calibration Error metric) measure how well a model's stated confidence matches its empirical accuracy. The framework for thinking about this is Bayesian: confidence should be well-calibrated, and uncertainty should be appropriately handled in downstream decisions.

Legal and forensic reasoning. The match-probability fallacy in DNA evidence (mistaking the probability of a random match for the probability of innocence) is a base-rate neglect failure. Modern courtroom presentation of forensic evidence increasingly incorporates Bayesian framing through likelihood ratios, with the prior reserved for the trier of fact (the jury). Whether this practice is wholly successful is debated.

Prerequisites and Next Pages

References

Primary texts:

  • Ramsey, Frank P. "Truth and Probability." 1926; published in The Foundations of Mathematics and Other Logical Essays, 1931. The early Dutch-book argument.
  • de Finetti, Bruno. "La prévision: ses lois logiques, ses sources subjectives." Annales de l'Institut Henri Poincaré 7 (1937): 1-68. The mature Dutch-book theorem and the foundations of subjective Bayesianism.
  • Carnap, Rudolf. Logical Foundations of Probability. University of Chicago Press, 1950. The objective-Bayesian foundational program.
  • Jeffrey, Richard C. The Logic of Decision. McGraw-Hill, 1965; revised 2nd ed. University of Chicago Press, 1983. Jeffrey conditionalization.
  • Savage, Leonard J. The Foundations of Statistics. Wiley, 1954. Decision-theoretic foundations.
  • Glymour, Clark. Theory and Evidence. Princeton, 1980. The old-evidence problem.

Modern reference:

  • Howson, Colin, and Peter Urbach. Scientific Reasoning: The Bayesian Approach. Open Court, 1989; 3rd ed. 2006. The standard book-length subjective-Bayesian defense.
  • Jaynes, E. T. Probability Theory: The Logic of Science. Cambridge, 2003. The objective-Bayesian / maximum-entropy school.
  • Hájek, Alan. "What Conditional Probability Could Not Be." Synthese 137 (2003): 273-323. The technical depth on conditional probability.
  • Joyce, James M. "A Defense of Imprecise Credences in Inference and Decision Making." Philosophical Perspectives 24 (2010): 281-323. The imprecise-credence position.
  • Williamson, Jon. In Defence of Objective Bayesianism. Oxford, 2010. The contemporary objective-Bayesian framework.

For the AI applications:

  • Pearl, Judea. Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, 1988. Bayesian networks; the founding text of probabilistic AI.
  • Murphy, Kevin. Probabilistic Machine Learning: An Introduction. MIT Press, 2022. Modern Bayesian-ML textbook.
  • Vovk, Vladimir, Alex Gammerman, and Glenn Shafer. Algorithmic Learning in a Random World. Springer, 2005. The conformal-prediction framework.

Stanford Encyclopedia entries (link, do not paraphrase):

Footnotes

  1. Jeffrey, Richard C. The Logic of Decision. McGraw-Hill, 1965; revised 2nd ed. University of Chicago Press, 1983. The standard reference for Jeffrey conditionalization.

  2. Ramsey, Frank P. "Truth and Probability." 1926; published posthumously in The Foundations of Mathematics and Other Logical Essays, 1931. de Finetti, Bruno. "La prévision: ses lois logiques, ses sources subjectives." Annales de l'Institut Henri Poincaré 7 (1937): 1-68.

  3. Glymour, Clark. Theory and Evidence. Princeton, 1980. The locus classicus of the old evidence problem.