Bayesian inference

From Wikipedia, the free encyclopedia - View original article

Jump to: navigation, search

In statistics, Bayesian inference is a method of inference in which Bayes' rule is used to update the probability estimate for a hypothesis as additional evidence is acquired. Bayesian updating is an important technique throughout statistics, and especially in mathematical statistics. For some cases, exhibiting a Bayesian derivation for a statistical method automatically ensures that the method works as well as any competing method.[citation needed] Bayesian updating is especially important in the dynamic analysis of a sequence of data. Bayesian inference has found application in a range of fields including science, engineering, philosophy, medicine and law.

In the philosophy of decision theory, Bayesian inference is closely related to discussions of subjective probability, often called "Bayesian probability". Bayesian probability provides a rational method for updating beliefs.

Introduction to Bayes' rule[edit]


Bayesian inference derives the posterior probability as a consequence of two antecedents, a prior probability and a "likelihood function" derived from a probability model for the data to be observed. Bayesian inference computes the posterior probability according to Bayes' rule:

P(H|E) = \frac{P(E|H) \cdot P(H)}{P(E)}


Note that what affect the value of \textstyle P(H|E) for different values of \textstyle H are only the factors \textstyle P(H) and \textstyle P(E|H), which both appear in the numerator, and hence the posterior probability is proportional to both. In words:

Note that Bayes' rule can also be written as follows:

P(H|E) = \frac{P(E|H)}{P(E)} \cdot P(H)

where the factor \textstyle \frac{P(E|H)}{P(E)} represents the impact of E on the probability of H.


Rationally, Bayes' rule makes a great deal of sense. If the evidence does not match up with a hypothesis, one should reject the hypothesis. But if a hypothesis is extremely unlikely a priori, one should also reject it, even if the evidence does appear to match up.

For example, imagine that I have various hypotheses about the nature of a newborn baby of a friend, including:

Then consider two scenarios:

  1. I'm presented with evidence in the form of a picture of a blond-haired baby girl. I find this evidence supports \textstyle H_2 and opposes \textstyle H_1 and \textstyle H_3.
  2. I'm presented with evidence in the form of a picture of a baby dog. Although this evidence, treated in isolation, supports \textstyle H_3, my prior belief in this hypothesis (that a human can give birth to a dog) is extremely small, so the posterior probability is nevertheless small.

The critical point about Bayesian inference, then, is that it provides a principled way of combining new evidence with prior beliefs, through the application of Bayes' rule. (Contrast this with frequentist inference, which relies only on the evidence as a whole, with no reference to prior beliefs.) Furthermore, Bayes' rule can be applied iteratively: after observing some evidence, the resulting posterior probability can then be treated as a prior probability, and a new posterior probability computed from new evidence. This allows for Bayesian principles to be applied to various kinds of evidence, whether viewed all at once or over time. This procedure is termed "Bayesian updating".

Bayesian updating[edit]

Bayesian updating is widely used and computationally convenient. However, it is not the only updating rule that might be considered "rational".

Ian Hacking noted that traditional "Dutch book" arguments did not specify Bayesian updating: they left open the possibility that non-Bayesian updating rules could avoid Dutch books. Hacking wrote[1] "And neither the Dutch book argument, nor any other in the personalist arsenal of proofs of the probability axioms, entails the dynamic assumption. Not one entails Bayesianism. So the personalist requires the dynamic assumption to be Bayesian. It is true that in consistency a personalist could abandon the Bayesian model of learning from experience. Salt could lose its savour."

Indeed, there are non-Bayesian updating rules that also avoid Dutch books (as discussed in the literature on "probability kinematics" following the publication of Richard C. Jeffrey's rule, which applies Bayes' rule to the case where the evidence itself is assigned a probability.[2] The additional hypotheses needed to uniquely require Bayesian updating have been deemed to be substantial, complicated, and unsatisfactory.[3]

Formal description of Bayesian inference[edit]


Bayesian inference[edit]

p(\theta|\mathbf{X},\alpha) = \frac{p(\mathbf{X}|\theta) p(\theta|\alpha)}{p(\mathbf{X}|\alpha)} \propto p(\mathbf{X}|\theta) p(\theta|\alpha)

Note that this is expressed in words as "posterior is proportional to likelihood times prior", or sometimes as "posterior = likelihood times prior, over evidence".

Bayesian prediction[edit]

p(\tilde{x}|\mathbf{X},\alpha) = \int_{\theta} p(\tilde{x}|\theta) p(\theta|\mathbf{X},\alpha) \operatorname{d}\!\theta
p(\tilde{x}|\alpha) = \int_{\theta} p(\tilde{x}|\theta) p(\theta|\alpha) \operatorname{d}\!\theta

Bayesian theory calls for the use of the posterior predictive distribution to do predictive inference, i.e., to predict the distribution of a new, unobserved data point. That is, instead of a fixed point as a prediction, a distribution over possible points is returned. Only this way is the entire posterior distribution of the parameter(s) used. By comparison, prediction in frequentist statistics often involves finding an optimum point estimate of the parameter(s)—e.g., by maximum likelihood or maximum a posteriori estimation (MAP)—and then plugging this estimate into the formula for the distribution of a data point. This has the disadvantage that it does not account for any uncertainty in the value of the parameter, and hence will underestimate the variance of the predictive distribution.

(In some instances, frequentist statistics can work around this problem. For example, confidence intervals and prediction intervals in frequentist statistics when constructed from a normal distribution with unknown mean and variance are constructed using a Student's t-distribution. This correctly estimates the variance, due to the fact that (1) the average of normally distributed random variables is also normally distributed; (2) the predictive distribution of a normally distributed data point with unknown mean and variance, using conjugate or uninformative priors, has a student's t-distribution. In Bayesian statistics, however, the posterior predictive distribution can always be determined exactly—or at least, to an arbitrary level of precision, when numerical methods are used.)

Note that both types of predictive distributions have the form of a compound probability distribution (as does the marginal likelihood). In fact, if the prior distribution is a conjugate prior, and hence the prior and posterior distributions come from the same family, it can easily be seen that both prior and posterior predictive distributions also come from the same family of compound distributions. The only difference is that the posterior predictive distribution uses the updated values of the hyperparameters (applying the Bayesian update rules given in the conjugate prior article), while the prior predictive distribution uses the values of the hyperparameters that appear in the prior distribution.

Inference over exclusive and exhaustive possibilities[edit]

If evidence is simultaneously used to update belief over a set of exclusive and exhaustive propositions, Bayesian inference may be thought of as acting on this belief distribution as a whole.

General formulation[edit]

Diagram illustrating event space \Omega in general formulation of Bayesian inference. Although this diagram shows discrete models and events, the continuous case may be visualized similarly using probability densities.

Suppose a process is generating independent and identically distributed events E_n, but the probability distribution is unknown. Let the event space \Omega represent the current state of belief for this process. Each model is represented by event M_m. The conditional probabilities P(E_n|M_m) are specified to define the models. P(M_m) is the degree of belief in M_m. Before the first inference step, \{P(M_m)\} is a set of initial prior probabilities. These must sum to 1, but are otherwise arbitrary.

Suppose that the process is observed to generate \textstyle E \in \{E_n\}. For each M \in \{M_m\}, the prior P(M) is updated to the posterior P(M|E). From Bayes' theorem:[4]

P(M|E) = \frac{P(E|M)}{\sum_m {P(E|M_m) P(M_m)}} \cdot P(M)

Upon observation of further evidence, this procedure may be repeated.

Multiple observations[edit]

For a set of independent and identically distributed observations \mathbf{E} = \{e_1, \dots, e_n\}, it may be shown that repeated application of the above is equivalent to

P(M|\mathbf{E}) = \frac{P(\mathbf{E}|M)}{\sum_m {P(\mathbf{E}|M_m) P(M_m)}} \cdot P(M)


P(\mathbf{E}|M) = \prod_k{P(e_k|M)}.

This may be used to optimize practical calculations.

Parametric formulation[edit]

By parametrizing the space of models, the belief in all models may be updated in a single step. The distribution of belief over the model space may then be thought of as a distribution of belief over the parameter space. The distributions in this section are expressed as continuous, represented by probability densities, as this is the usual situation. The technique is however equally applicable to discrete distributions.

Let the vector \mathbf{\theta} span the parameter space. Let the initial prior distribution over \mathbf{\theta} be p(\mathbf{\theta}|\mathbf{\alpha}), where \mathbf{\alpha} is a set of parameters to the prior itself, or hyperparameters. Let \mathbf{E} = \{e_1, \dots, e_n\} be a set of independent and identically distributed event observations, where all e_i are distributed as p(e|\mathbf{\theta}) for some \mathbf{\theta}. Bayes' theorem is applied to find the posterior distribution over \mathbf{\theta}:

 \begin{align} p(\mathbf{\theta}|\mathbf{E},\mathbf{\alpha}) &= \frac{p(\mathbf{E}|\mathbf{\theta},\mathbf{\alpha})}{p(\mathbf{E}|\mathbf{\alpha})} \cdot p(\mathbf{\theta}|\mathbf{\alpha}) \\ &= \frac{p(\mathbf{E}|\mathbf{\theta},\mathbf{\alpha})}{\int_\mathbf{\theta} p(\mathbf{E}|\mathbf{\theta},\mathbf{\alpha}) p(\mathbf{\theta}|\mathbf{\alpha}) \, d\mathbf{\theta}} \cdot p(\mathbf{\theta}|\mathbf{\alpha}) \end{align}


p(\mathbf{E}|\mathbf{\theta},\mathbf{\alpha}) = \prod_k p(e_k|\mathbf{\theta})

Mathematical properties[edit]

Interpretation of factor[edit]

\textstyle \frac{P(E|M)}{P(E)} > 1 \Rightarrow \textstyle P(E|M) > P(E). That is, if the model were true, the evidence would be more likely than is predicted by the current state of belief. The reverse applies for a decrease in belief. If the belief does not change, \textstyle \frac{P(E|M)}{P(E)} = 1 \Rightarrow \textstyle P(E|M) = P(E). That is, the evidence is independent of the model. If the model were true, the evidence would be exactly as likely as predicted by the current state of belief.

Cromwell's rule[edit]

If P(M)=0 then P(M|E)=0. If P(M)=1, then P(M|E)=1. This can be interpreted to mean that hard convictions are insensitive to counter-evidence.

The former follows directly from Bayes' theorem. The latter can be derived by applying the first rule to the event "not M" in place of "M", yielding "if 1 - P(M)=0, then 1 - P(M|E)=0", from which the result immediately follows.

Asymptotic behaviour of posterior[edit]

Consider the behaviour of a belief distribution as it is updated a large number of times with independent and identically distributed trials. For sufficiently nice prior probabilities, the Bernstein-von Mises theorem gives that in the limit of infinite trials and the posterior converges to a Gaussian distribution independent of the initial prior under some conditions firstly outlined and rigorously proven by Joseph L. Doob in 1948, namely if the random variable in consideration has a finite probability space. The more general results were obtained later by the statistician David A. Freedman who published in two seminal research papers[citation needed] in 1963 and 1965 when and under what circumstances the asymptotic behaviour of posterior is guaranteed. His 1963 paper treats, like Doob (1949), the finite case and comes to a satisfactory conclusion. However, if the random variable has an infinite but countable probability space (i.e., corresponding to a die with infinite many faces) the 1965 paper demonstrates that for a dense subset of priors the Bernstein-von Mises theorem is not applicable. In this case there is almost surely no asymptotic convergence. Later in the 1980s and 1990s Freedman and Persi Diaconis continued to work on the case of infinite countable probability spaces.[5] To summarise, there may be insufficient trials to suppress the effects of the initial choice, and especially for large (but finite) systems the convergence might be very slow.

Conjugate priors[edit]

In parameterized form, the prior distribution is often assumed to come from a family of distributions called conjugate priors. The usefulness of a conjugate prior is that the corresponding posterior distribution will be in the same family, and the calculation may be expressed in closed form.

Estimates of parameters and predictions[edit]

It is often desired to use a posterior distribution to estimate a parameter or variable. Several methods of Bayesian estimation select measurements of central tendency from the posterior distribution.

For one-dimensional problems, a unique median exists for practical continuous problems. The posterior median is attractive as a robust estimator.[6]

If there exists a finite mean for the posterior distribution, then the posterior mean is a method of estimation.[citation needed]

\tilde \theta = \operatorname{E}[\theta] = \int_\theta \theta \, p(\theta|\mathbf{X},\alpha) \, d\theta

Taking a value with the greatest probability defines maximum a posteriori (MAP) estimates:[citation needed]

\{ \theta_{\text{MAP}}\} \subset \arg \max_\theta p(\theta|\mathbf{X},\alpha) .

There are examples where no maximum is attained, in which case the set of MAP estimates is empty.

There are other methods of estimation that minimize the posterior risk (expected-posterior loss) with respect to a loss function, and these are of interest to statistical decision theory using the sampling distribution ("frequentist statistics").[citation needed]

The posterior predictive distribution of a new observation \tilde{x} (that is independent of previous observations) is determined by[citation needed]

p(\tilde{x}|\mathbf{X},\alpha) = \int_\theta p(\tilde{x},\theta|\mathbf{X},\alpha) \, d\theta = \int_\theta p(\tilde{x}|\theta) p(\theta|\mathbf{X},\alpha) \, d\theta .


Probability of a hypothesis[edit]

Suppose there are two full bowls of cookies. Bowl #1 has 10 chocolate chip and 30 plain cookies, while bowl #2 has 20 of each. Our friend Fred picks a bowl at random, and then picks a cookie at random. We may assume there is no reason to believe Fred treats one bowl differently from another, likewise for the cookies. The cookie turns out to be a plain one. How probable is it that Fred picked it out of bowl #1?

Intuitively, it seems clear that the answer should be more than a half, since there are more plain cookies in bowl #1. The precise answer is given by Bayes' theorem. Let H_1 correspond to bowl #1, and H_2 to bowl #2. It is given that the bowls are identical from Fred's point of view, thus P(H_1)=P(H_2), and the two must add up to 1, so both are equal to 0.5. The event E is the observation of a plain cookie. From the contents of the bowls, we know that P(E|H_1) = 30/40 = 0.75 and P(E|H_2) = 20/40 = 0.5. Bayes' formula then yields

\begin{align} P(H_1|E) &= \frac{P(E|H_1)\,P(H_1)}{P(E|H_1)\,P(H_1)\;+\;P(E|H_2)\,P(H_2)} \\  \\  \ & = \frac{0.75 \times 0.5}{0.75 \times 0.5 + 0.5 \times 0.5} \\  \\  \ & = 0.6 \end{align}

Before we observed the cookie, the probability we assigned for Fred having chosen bowl #1 was the prior probability, P(H_1), which was 0.5. After observing the cookie, we must revise the probability to P(H_1|E), which is 0.6.

Making a prediction[edit]

Example results for archaeology example. This simulation was generated using c=15.2.

An archaeologist is working at a site thought to be from the medieval period, between the 11th century to the 16th century. However, it is uncertain exactly when in this period the site was inhabited. Fragments of pottery are found, some of which are glazed and some of which are decorated. It is expected that if the site were inhabited during the early medieval period, then 1% of the pottery would be glazed and 50% of its area decorated, whereas if it had been inhabited in the late medieval period then 81% would be glazed and 5% of its area decorated. How confident can the archaeologist be in the date of inhabitation as fragments are unearthed?

The degree of belief in the continuous variable C (century) is to be calculated, with the discrete set of events \{GD,G \bar D, \bar G D, \bar G \bar D\} as evidence. Assuming linear variation of glaze and decoration with time, and that these variables are independent,

P(E=GD|C=c) = (0.01 + 0.16(c-11))(0.5 - 0.09(c-11))
P(E=G \bar D|C=c) = (0.01 + 0.16(c-11))(0.5 + 0.09(c-11))
P(E=\bar G D|C=c) = (0.99 - 0.16(c-11))(0.5 - 0.09(c-11))
P(E=\bar G \bar D|C=c) = (0.99 - 0.16(c-11))(0.5 + 0.09(c-11))

Assume a uniform prior of \textstyle f_C(c) = 0.2, and that trials are independent and identically distributed. When a new fragment of type e is discovered, Bayes' theorem is applied to update the degree of belief for each c:

f_C(c|E=e) = \frac{P(E=e|C=c)}{P(E=e)}f_C(c) = \frac{P(E=e|C=c)}{\int_{11}^{16}{P(E=e|C=c)f_C(c)dc}}f_C(c)

A computer simulation of the changing belief as 50 fragments are unearthed is shown on the graph. In the simulation, the site was inhabited around 1520, or c=15.2. By calculating the area under the relevant portion of the graph for 50 trials, the archaeologist can say that there is practically no chance the site was inhabited in the 11th and 12th centuries, about 1% chance that it was inhabited during the 13th century, 63% chance during the 14th century and 36% during the 15th century. Note that the Bernstein-von Mises theorem asserts here the asymptotic convergence to the "true" distribution because the probability space corresponding to the discrete set of events \{GD,G \bar D, \bar G D, \bar G \bar D\} is finite (see above section on asymptotic behaviour of the posterior).

In frequentist statistics and decision theory[edit]

A decision-theoretic justification of the use of Bayesian inference was given by Abraham Wald, who proved that every Bayesian procedure is admissible. Conversely, every admissible statistical procedure is either a Bayesian procedure or a limit of Bayesian procedures.[7]

Wald characterized admissible procedures as Bayesian procedures (and limits of Bayesian procedures), making the Bayesian formalism a central technique in such areas of frequentist inference as parameter estimation, hypothesis testing, and computing confidence intervals.[8] For example:

Model selection[edit]


Computer applications[edit]

Bayesian inference has applications in artificial intelligence and expert systems. Bayesian inference techniques have been a fundamental part of computerized pattern recognition techniques since the late 1950s. There is also an ever growing connection between Bayesian methods and simulation-based Monte Carlo techniques since complex models cannot be processed in closed form by a Bayesian analysis, while a graphical model structure may allow for efficient simulation algorithms like the Gibbs sampling and other Metropolis–Hastings algorithm schemes.[13] Recently Bayesian inference has gained popularity amongst the phylogenetics community for these reasons; a number of applications allow many demographic and evolutionary parameters to be estimated simultaneously.

As applied to statistical classification, Bayesian inference has been used in recent years to develop algorithms for identifying e-mail spam. Applications which make use of Bayesian inference for spam filtering include CRM114, DSPAM, Bogofilter, SpamAssassin, SpamBayes, and Mozilla. Spam classification is treated in more detail in the article on the naive Bayes classifier.

Solomonoff's Inductive inference is the theory of prediction based on observations; for example, predicting the next symbol based upon a given series of symbols. The only assumption is that the environment follows some unknown but computable probability distribution. It is a formal inductive framework that combines two well-studied principles of inductive inference: Bayesian statistics and Occam’s Razor.[14] Solomonoff's universal prior probability of any prefix p of a computable sequence x is the sum of the probabilities of all programs (for a universal computer) that compute something starting with p. Given some p and any computable but unknown probability distribution from which x is sampled, the universal prior and Bayes' theorem can be used to predict the yet unseen parts of x in optimal fashion.[15][16]

In the courtroom[edit]

Bayesian inference can be used by jurors to coherently accumulate the evidence for and against a defendant, and to see whether, in totality, it meets their personal threshold for 'beyond a reasonable doubt'.[17][18][19] Bayes' theorem is applied successively to all evidence presented, with the posterior from one stage becoming the prior for the next. The benefit of a Bayesian approach is that it gives the juror an unbiased, rational mechanism for combining evidence. It may be appropriate to explain Bayes' theorem to jurors in odds form, as betting odds are more widely understood than probabilities. Alternatively, a logarithmic approach, replacing multiplication with addition, might be easier for a jury to handle.

Adding up evidence.

If the existence of the crime is not in doubt, only the identity of the culprit, it has been suggested that the prior should be uniform over the qualifying population.[20] For example, if 1,000 people could have committed the crime, the prior probability of guilt would be 1/1000.

The use of Bayes' theorem by jurors is controversial. In the United Kingdom, a defence expert witness explained Bayes' theorem to the jury in R v Adams. The jury convicted, but the case went to appeal on the basis that no means of accumulating evidence had been provided for jurors who did not wish to use Bayes' theorem. The Court of Appeal upheld the conviction, but it also gave the opinion that "To introduce Bayes' Theorem, or any similar method, into a criminal trial plunges the jury into inappropriate and unnecessary realms of theory and complexity, deflecting them from their proper task."

Gardner-Medwin[21] argues that the criterion on which a verdict in a criminal trial should be based is not the probability of guilt, but rather the probability of the evidence, given that the defendant is innocent (akin to a frequentist p-value). He argues that if the posterior probability of guilt is to be computed by Bayes' theorem, the prior probability of guilt must be known. This will depend on the incidence of the crime, which is an unusual piece of evidence to consider in a criminal trial. Consider the following three propositions:

A The known facts and testimony could have arisen if the defendant is guilty
B The known facts and testimony could have arisen if the defendant is innocent
C The defendant is guilty.

Gardner-Medwin argues that the jury should believe both A and not-B in order to convict. A and not-B implies the truth of C, but the reverse is not true. It is possible that B and C are both true, but in this case he argues that a jury should acquit, even though they know that they will be letting some guilty people go free. See also Lindley's paradox.

Bayesian epistemology[edit]

Bayesian epistemology is an epistemological movement that uses techniques of Bayesian inference as a means of justifying the rules of inductive logic.

Karl Popper and David Miller have rejected the alleged rationality of Bayesianism, i.e. using Bayes rule to make epistemological inferences:[22] It is prone to the same vicious circle as any other justificationist epistemology, because it presupposes what it attempts to justify. According to this view, a rational interpretation of Bayesian inference would see it merely as a probabilistic version of falsification, rejecting the belief, commonly held by Bayesians, that high likelihood achieved by a series of Bayesian updates would prove the hypothesis beyond any reasonable doubt, or even with likelihood greater than 0.


Bayes and Bayesian inference[edit]

The problem considered by Bayes in Proposition 9 of his essay, "An Essay towards solving a Problem in the Doctrine of Chances", is the posterior distribution for the parameter a (the success rate) of the binomial distribution.[citation needed]

What is "Bayesian" about Proposition 9 is that Bayes presented it as a probability for the parameter a. That is, not only can one compute probabilities for experimental outcomes, but also for the parameter which governs them, and the same algebra is used to make inferences of either kind. Interestingly, Bayes actually states his question in a way that might make the idea of assigning a probability distribution to a parameter palatable to a frequentist. He supposes that a billiard ball is thrown at random onto a billiard table, and that the probabilities p and q are the probabilities that subsequent billiard balls will fall above or below the first ball. By making the binomial parameter a\, depend on a random event, he cleverly escapes a philosophical quagmire that was an issue he most likely was not even aware of.


The term Bayesian refers to Thomas Bayes (1702–1761), who proved a special case of what is now called Bayes' theorem. However, it was Pierre-Simon Laplace (1749–1827) who introduced a general version of the theorem and used it to approach problems in celestial mechanics, medical statistics, reliability, and jurisprudence.[24] Early Bayesian inference, which used uniform priors following Laplace's principle of insufficient reason, was called "inverse probability" (because it infers backwards from observations to parameters, or from effects to causes[25]). After the 1920s, "inverse probability" was largely supplanted by a collection of methods that came to be called frequentist statistics.[25]

In the 20th century, the ideas of Laplace were further developed in two different directions, giving rise to objective and subjective currents in Bayesian practice. In the objective or "non-informative" current, the statistical analysis depends on only the model assumed, the data analyzed,[26] and the method assigning the prior, which differs from one objective Bayesian to another objective Bayesian. In the subjective or "informative" current, the specification of the prior depends on the belief (that is, propositions on which the analysis is prepared to act), which can summarize information from experts, previous studies, etc.

In the 1980s, there was a dramatic growth in research and applications of Bayesian methods, mostly attributed to the discovery of Markov chain Monte Carlo methods, which removed many of the computational problems, and an increasing interest in nonstandard, complex applications.[27] Despite growth of Bayesian research, most undergraduate teaching is still based on frequentist statistics.[28] Nonetheless, Bayesian methods are widely accepted and used, such as for example in the field of machine learning.[29]

See also[edit]


  1. ^ Hacking (1967, Section 3, p. 316), Hacking (1988, p. 124)
  2. ^ "Bayes' Theorem (Stanford Encyclopedia of Philosophy)". Retrieved 2014-01-05. 
  3. ^ van Fraassen, B. (1989) Laws and Symmetry, Oxford University Press. ISBN 0-19-824860-1
  4. ^ Gelman, Andrew; Carlin, John B.; Stern, Hal S.; Rubin, Donald B. (2003). Bayesian Data Analysis, Second Edition. Boca Raton, FL: Chapman and Hall/CRC. ISBN 1-58488-388-X.
  5. ^ Larry Wasserman et alia, JASA 2000.
  6. ^ Sen, Pranab K.; Keating, J. P.; Mason, R. L. (1993). Pitman's measure of closeness: A comparison of statistical estimators. Philadelphia: SIAM. 
  7. ^ a b Bickel & Doksum (2001, p. 32)
  8. ^ * Kiefer, J. and Schwartz, R. (1965). "Admissible Bayes Character of T2-, R2-, and Other Fully Invariant Tests for Multivariate Normal Problems". Annals of Mathematical Statistics 36: 747–770. doi:10.1214/aoms/1177700051. 
    • Schwartz, R. (1969). "Invariant Proper Bayes Tests for Exponential Families". Annals of Mathematical Statistics 40: 270–283. doi:10.1214/aoms/1177697822. 
    • Hwang, J. T. and Casella, George (1982). "Minimax Confidence Sets for the Mean of a Multivariate Normal Distribution". Annals of Statistics 10: 868–881. doi:10.1214/aos/1176345877. 
  9. ^ Lehmann, Erich (1986). Testing Statistical Hypotheses (Second ed.).  (see p. 309 of Chapter 6.7 "Admissibilty", and pp. 17–18 of Chapter 1.8 "Complete Classes"
  10. ^ Le Cam, Lucien (1986). Asymptotic Methods in Statistical Decision Theory. Springer-Verlag. ISBN 0-387-96307-3.  (From "Chapter 12 Posterior Distributions and Bayes Solutions", p. 324)
  11. ^ Cox, D. R. and Hinkley, D.V (1974). Theoretical Statistics. Chapman and Hall. ISBN 0-04-121537-0.  page 432
  12. ^ Cox, D. R. and Hinkley, D. V. (1974). Theoretical Statistics. Chapman and Hall. ISBN 0-04-121537-0.  p. 433)
  13. ^ Jim Albert (2009). Bayesian Computation with R, Second edition. New York, Dordrecht, etc.: Springer. ISBN 978-0-387-92297-3. 
  14. ^ Samuel Rathmanner and Marcus Hutter. "A Philosophical Treatise of Universal Induction". Entropy, 13(6):1076–1136, 2011.
  15. ^ "The Problem of Old Evidence", in §5 of "On Universal Prediction and Bayesian Confirmation", M. Hutter - Theoretical Computer Science, 2007 - Elsevier
  16. ^ "Raymond J. Solomonoff", Peter Gacs, Paul M. B. Vitanyi, 2011
  17. ^ Dawid, A. P. and Mortera, J. (1996) "Coherent Analysis of Forensic Identification Evidence". Journal of the Royal Statistical Society, Series B, 58, 425–443.
  18. ^ Foreman, L. A.; Smith, A. F. M., and Evett, I. W. (1997). "Bayesian analysis of deoxyribonucleic acid profiling data in forensic identification applications (with discussion)". Journal of the Royal Statistical Society, Series A, 160, 429–469.
  19. ^ Robertson, B. and Vignaux, G. A. (1995) Interpreting Evidence: Evaluating Forensic Science in the Courtroom. John Wiley and Sons. Chichester. ISBN 978-0-471-96026-3
  20. ^ Dawid, A. P. (2001) "Bayes' Theorem and Weighing Evidence by Juries";
  21. ^ Gardner-Medwin, A. (2005) "What Probability Should the Jury Address?". Significance, 2 (1), March 2005
  22. ^ David Miller: Critical Rationalism
  23. ^ Howson & Urbach (2005), Jaynes (2003)
  24. ^ Stigler, Stephen M. (1986). "Chapter 3". The History of Statistics. Harvard University Press. 
  25. ^ a b Fienberg, Stephen E. (2006). "When did Bayesian Inference Become ‘Bayesian’?". Bayesian Analysis 1 (1): 1–40 [p. 5]. 
  26. ^ Bernardo, José-Miguel (2005). "Reference analysis". Handbook of statistics 25. pp. 17–90. 
  27. ^ Wolpert, R. L. (2004). "A Conversation with James O. Berger". Statistical Science 19 (1): 205–218. doi:10.1214/088342304000000053. MR 2082155. 
  28. ^ Bernardo, José M. (2006). "A Bayesian mathematical statistics primer". ICOTS-7. 
  29. ^ Bishop, C. M. (2007). Pattern Recognition and Machine Learning. New York: Springer. ISBN 0387310738. 


Further reading[edit]


The following books are listed in ascending order of probabilistic sophistication:

Intermediate or advanced[edit]

External links[edit]