View source for Prior probability

{{Bayesian statistics}}

In [[Bayesian probability|Bayesian]] [[statistical inference]], a '''prior probability distribution''', often simply called the '''prior''', of an uncertain quantity is the [[probability distribution]] that would express one's beliefs about this quantity before some evidence is taken into account. For example, the prior could be the probability distribution representing the relative proportions of voters who will vote for a particular politician in a future election. The unknown quantity may be a [[parameter]] of the model or a [[latent variable]] rather than an [[observable variable]].

[[Bayes' theorem]] calculates the renormalized pointwise product of the prior and the [[likelihood function]], to produce the ''[[posterior probability distribution]]'', which is the conditional distribution of the uncertain quantity given the data.

Similarly, the '''prior probability''' of a [[random event]] or an uncertain proposition is the [[marginal probability|unconditional probability]] that is assigned before any relevant evidence is taken into account.

Priors can be created using a number of methods.<ref name="Carlin2008">{{cite book|last1=Carlin|first1=Bradley P.|last2=Louis|first2=Thomas A.|title=Bayesian Methods for Data Analysis|date=2008|publisher=CRC Press|isbn=9781584886983|edition=Third}}</ref>{{rp|pages=27–41}} A prior can be determined from past information, such as previous experiments. A prior can be ''elicited'' from the purely subjective assessment of an experienced expert. An ''uninformative prior'' can be created to reflect a balance among outcomes when no information is available. Priors can also be chosen according to some principle, such as symmetry or maximizing entropy given constraints; examples are the [[Jeffreys prior]] or Bernardo's reference prior.  When a family of  ''[[conjugate prior]]s'' exists, choosing a prior from that family simplifies calculation of the posterior distribution.

Parameters of prior distributions are a kind of ''[[hyperparameter]]''. For example, if one uses a [[beta distribution]] to model the distribution of the parameter ''p'' of a [[Bernoulli distribution]], then:
* ''p'' is a parameter of the underlying system (Bernoulli distribution), and
* ''α'' and ''β'' are parameters of the prior distribution (beta distribution); hence ''hyper''parameters.
Hyperparameters themselves may have [[hyperprior]] distributions expressing beliefs about their values. A Bayesian model with more than one level of prior like this is called a [[hierarchical Bayes model]].

== Informative priors ==

An ''informative prior'' expresses specific, definite information about a variable.
An example is a prior distribution for the temperature at noon tomorrow.
A reasonable approach is to make the prior a [[normal distribution]] with [[expected value]] equal to today's noontime temperature, with [[variance]] equal to the day-to-day variance of atmospheric temperature,
or a distribution of the temperature for that day of the year.

This example has a property in common with many priors,
namely, that the posterior from one problem (today's temperature) becomes the prior for another problem (tomorrow's temperature); pre-existing evidence which has already been taken into account is part of the prior and, as more evidence accumulates, the posterior is determined largely by the evidence rather than any original assumption, provided that the original assumption admitted the possibility of what the evidence is suggesting. The terms "prior" and "posterior" are generally relative to a specific datum or observation.

== Weakly informative priors ==

A ''weakly informative prior'' expresses partial information about a variable.  An example is, when setting the prior distribution for the temperature at noon tomorrow in St. Louis, to use a normal distribution with mean 50 degrees Fahrenheit and standard deviation 40 degrees, which very loosely constrains the temperature to the range (10 degrees, 90 degrees) with a small chance of being below -30 degrees or above 130 degrees.  The purpose of a weakly informative prior is for [[regularization (mathematics)|regularization]], that is, to keep inferences in a reasonable range.

== Uninformative priors ==
An '''uninformative prior''' or '''diffuse prior''' expresses vague or general information about a variable. The term "uninformative prior" is somewhat of a misnomer. Such a prior might also be called a ''not very informative prior'', or an ''objective prior'', i.e. one that's not subjectively elicited.

Uninformative priors can express "objective" information such as "the variable is positive" or "the variable is less than some limit". The simplest and oldest rule for determining a non-informative prior is the [[principle of indifference]], which assigns equal probabilities to all possibilities. In parameter estimation problems, the use of an uninformative prior typically yields results which are not too different from conventional statistical analysis, as the likelihood function often yields more information than the uninformative prior.

Some attempts have been made at finding [[a priori probability|a priori probabilities]], i.e. probability distributions in some sense logically required by the nature of one's state of uncertainty; these are a subject of philosophical controversy, with Bayesians being roughly divided into two schools: "objective Bayesians", who believe such priors exist in many useful situations, and "subjective Bayesians" who believe that in practice priors usually represent subjective judgements of opinion that cannot be rigorously justified (Williamson 2010).  Perhaps the strongest arguments for objective Bayesianism were given by [[Edwin T. Jaynes]], based mainly on the consequences of symmetries and on the principle of maximum entropy.

As an example of an a priori prior, due to Jaynes (2003), consider a situation in which one knows a ball has been hidden under one of three cups, A, B, or C, but no other information is available about its location.  In this case a ''uniform prior'' of ''p''(''A'')&nbsp;= ''p''(''B'')&nbsp;= ''p''(''C'')&nbsp;= 1/3 seems intuitively like the only reasonable choice.  More formally, we can see that the problem remains the same if we swap around the labels ("A", "B" and "C") of the cups.  It would therefore be odd to choose a prior for which a permutation of the labels would cause a change in our predictions about which cup the ball will be found under; the uniform prior is the only one which preserves this invariance.  If one accepts this invariance principle then one can see that the uniform prior is the logically correct prior to represent this state of knowledge.  This prior is "objective" in the sense of being the correct choice to represent a particular state of knowledge, but it is not objective in the sense of being an observer-independent feature of the world: in reality the ball exists under a particular cup, and it only makes sense to speak of probabilities in this situation if there is an observer with limited knowledge about the system.

As a more contentious example, Jaynes published an argument (Jaynes 1968) based on [[Lie group]]s that suggests that the prior representing complete uncertainty about a probability should be the [[Haldane prior]] ''p''<sup>&minus;1</sup>(1&nbsp;&minus;&nbsp;''p'')<sup>&minus;1</sup>.  The example Jaynes gives is of finding a chemical in a lab and asking whether it will dissolve in water in repeated experiments.  The Haldane prior<ref>This prior was proposed by [[J.B.S. Haldane]] in "A note on inverse probability", Mathematical Proceedings of the Cambridge Philosophical Society 28, 55–61, 1932, {{doi|10.1017/S0305004100010495}}. See also J. Haldane, "The precision of observed values of small frequencies", Biometrika, 35:297–300, 1948, {{doi|10.2307/2332350}}, {{JSTOR|2332350}}.</ref> gives by far the most weight to <math>p=0</math> and <math>p=1</math>, indicating that the sample will either dissolve every time or never dissolve, with equal probability.  However, if one has observed samples of the chemical to dissolve in one experiment and not to dissolve in another experiment then this prior is updated to the [[uniform distribution (continuous)|uniform distribution]] on the interval [0, 1].  This is obtained by applying [[Bayes' theorem]] to the data set consisting of one observation of dissolving and one of not dissolving, using the above prior.  The Haldane prior is an improper prior distribution (meaning that it has an infinite mass).  [[Harold Jeffreys]] devised a systematic way for designing uninformative priors as e.g., [[Jeffreys prior]] ''p''<sup>&minus;1/2</sup>(1&nbsp;&minus;&nbsp;''p'')<sup>&minus;1/2</sup> for the Bernoulli random variable.

Priors can be constructed which are proportional to the [[Haar measure]] if the parameter space ''X'' carries a [[transformation group|natural group structure]] which leaves invariant our Bayesian state of knowledge (Jaynes, 1968). This can be seen as a generalisation of the invariance principle used to justify the uniform prior over the three cups in the example above.  For example, in physics we might expect that an experiment will give the same results regardless of our choice of the origin of a coordinate system. This induces the group structure of the [[translation group]] on ''X'', which determines the prior probability as a constant [[improper prior]]. Similarly, some measurements are naturally invariant to the choice of an arbitrary scale (e.g., whether centimeters or inches are used, the physical results should be equal). In such a case, the scale group is the natural group structure, and the corresponding prior on ''X'' is proportional to 1/''x''. It sometimes matters whether we use the left-invariant or right-invariant Haar measure. For example, the left and right invariant Haar measures on the [[affine group]] are not equal. Berger (1985, p.&nbsp;413) argues that the right-invariant Haar measure is the correct choice.

Another idea, championed by [[Edwin T. Jaynes]], is to use the [[principle of maximum entropy]] (MAXENT). The motivation is that the [[Shannon entropy]] of a probability distribution measures the amount of information contained in the distribution. The larger the entropy, the less information is provided by the distribution. Thus, by maximizing the entropy over a suitable set of probability distributions on ''X'', one finds the distribution that is least informative in the sense that it contains the least amount of information consistent with the constraints that define the set. For example, the maximum entropy prior on a discrete space, given only that the probability is normalized to 1, is the prior that assigns equal probability to each state. And in the continuous case, the maximum entropy prior given that the density is normalized with mean zero and variance unity is the standard [[normal distribution]].  The principle of ''[[minxent|minimum cross-entropy]]'' generalizes MAXENT to the case of "updating" an arbitrary prior distribution with suitable constraints in the maximum-entropy sense.

A related idea, [[reference prior]]s, was introduced by [[José-Miguel Bernardo]]. Here, the idea is to maximize the expected [[Kullback–Leibler divergence]] of the posterior distribution relative to the prior. This maximizes the expected posterior information about ''X'' when the prior density is ''p''(''x''); thus, in some sense, ''p''(''x'') is the "least informative" prior about X. The reference prior is defined in the asymptotic limit, i.e., one considers the limit of the priors so obtained as the number of data points goes to infinity.  In the present case, the KL divergence between the prior and posterior distributions is given by

:<math> KL = \int p(t) \int p(x\mid t) \log\frac{p(x\mid t)}{p(x)} \, dx \, dt. </math>

Here, <math> t </math> is a sufficient statistic for some parameter <math> x </math>.  The inner integral is the KL divergence between the posterior <math> p(x\mid t) </math> and prior <math> p(x) </math> distributions and the result is the weighted mean over all values of <math> t </math>.   Splitting the logarithm into two parts, reversing the order of integrals in the second part and noting that <math> \log \, [p(x)] </math> does not depend on <math> t </math> yields

:<math> KL = \int p(t) \int p(x\mid t) \log[p(x\mid t)] \, dx \, dt \, - \, \int \log[p(x)] \, \int  p(t) p(x\mid t) \, dt \, dx. </math>

The inner integral in the second part is the integral over <math> t </math> of the joint density <math> p(x, t) </math>.  This is the marginal distribution <math> p(x) </math>, so we have

:<math> KL = \int p(t) \int p(x\mid t) \log[p(x\mid t)] \, dx \, dt \, - \, \int p(x) \log[p(x)] \, dx. </math>

Now we use the concept of entropy which, in the case of probability distributions, is the negative expected value of the logarithm of the probability mass or density function or <math> H(x) = - \int p(x) \log[p(x)] \, dx. </math>  Using this in the last equation yields

:<math> KL = - \int p(t)H(x\mid t) \, dt + \, H(x). </math>

In words, KL is the negative expected value over <math> t </math> of the entropy of <math> x </math> conditional on <math> t </math> plus the marginal (i.e. unconditional) entropy of <math> x </math>.  In the limiting case where the sample size tends to infinity, the [[Bernstein-von Mises theorem]] states that the distribution of <math> x </math> conditional on a given observed value of <math> t </math> is normal with a variance equal to the reciprocal of the Fisher information at the 'true' value of <math> x </math>.  The entropy of a normal density function is equal to half the logarithm of <math> 2 \pi ev </math> where <math> v </math> is the variance of the distribution.  In this case therefore <math> H = \log \sqrt{2\pi e/[NI(x*)]} </math> where <math> N </math> is the arbitrarily large sample size (to which Fisher information is proportional) and <math> x* </math> is the 'true' value.  Since this does not depend on <math> t </math> it can be taken out of the integral, and as this integral is over a probability space it equals one.  Hence we can write the asymptotic form of KL as

:<math> KL = - \log [1\sqrt{kI(x*)}] - \, \int p(x) \log[p(x)] \, dx. </math>

where <math> k </math> is proportional to the (asymptotically large) sample size.  We do not know the value of <math> x* </math>.  Indeed, the very idea goes against the philosophy of Bayesian inference in which 'true' values of parameters are replaced by prior and posterior distributions.  So we remove <math> x* </math> by replacing it with <math> x </math> and taking the expected value of the normal entropy, which we obtain by multiplying by <math> p(x) </math> and integrating over <math> x </math>.  This allows us to combine the logarithms yielding

:<math> KL = - \int p(x) \log [p(x) / \sqrt{kI(x)}] \, dx. </math>

This is a quasi-KL divergence ("quasi" in the sense that the square root of the Fisher information may be the kernel of an improper distribution).  Due to the minus sign, we need to minimise this in order to maximise the KL divergence with which we started.  The minimum value of the last equation occurs where the two distributions in the logarithm argument, improper or not, do not diverge.  This in turn occurs when the prior distribution is proportional to the square root of the Fisher information of the likelihood function.  Hence in the single parameter case, reference priors and Jeffreys priors are identical, even though Jeffreys has a very different rationale.

Reference priors are often the objective prior of choice in multivariate problems, since other rules (e.g., [[Jeffreys prior|Jeffreys' rule]]) may result in priors with problematic behavior.{{clarify|post-text=A Jeffreys prior is related to KL divergence?|date=September 2015}}

Objective prior distributions may also be derived from other principles, such as [[information theory|information]] or [[coding theory]] (see e.g. [[minimum description length]]) or [[frequentist statistics]] (see [[frequentist matching]]). Such methods are used in [[Solomonoff's theory of inductive inference]]. Constructing objective priors have been recently introduced in bioinformatics, and specially inference in cancer systems biology, where sample size is limited and a vast amount of '''prior knowledge''' is available. In these methods, either an information theory based criterion, such as KL divergence or log-likelihood function for binary supervised learning problems<ref>{{Cite web|url=https://ieeexplore.ieee.org/document/6654120/|title=Incorporation of Biological Pathway Knowledge in the Construction of Priors for Optimal Bayesian Classification - IEEE Journals & Magazine|website=ieeexplore.ieee.org|language=en-US|access-date=2018-08-05}}</ref> and mixture model problems.<ref>{{Cite journal|last=Boluki|first=Shahin|last2=Esfahani|first2=Mohammad Shahrokh|last3=Qian|first3=Xiaoning|last4=Dougherty|first4=Edward R|date=December 2017|title=Incorporating biological prior knowledge for Bayesian learning via maximal knowledge-driven information priors|journal=BMC Bioinformatics|language=En|volume=18|issue=S14|pages=552|doi=10.1186/s12859-017-1893-4|issn=1471-2105|pmc=5751802|pmid=29297278}}</ref>

Philosophical problems associated with uninformative priors are associated with the choice of an appropriate metric, or measurement scale. Suppose we want a prior for the running speed of a runner who is unknown to us. We could specify, say, a normal distribution as the prior for his speed, but alternatively we could specify a normal prior for the time he takes to complete 100 metres, which is proportional to the reciprocal of the first prior. These are very different priors, but it is not clear which is to be preferred.  Jaynes' often-overlooked{{by whom|date=August 2019}} [[Principle of transformation groups|method of transformation groups]] can answer this question in some situations.<ref>Jaynes (1968), pp. 17, see also Jaynes (2003), chapter 12.  Note that chapter 12 is not available in the online preprint but can be previewed via Google Books.</ref>

Similarly, if asked to estimate an unknown proportion between 0 and 1, we might say that all proportions are equally likely, and use a uniform prior. Alternatively, we might say that all orders of magnitude for the proportion are equally likely, the '''{{visible anchor|logarithmic prior}}''', which is the uniform prior on the logarithm of proportion. The [[Jeffreys prior]] attempts to solve this problem by computing a prior which expresses the same belief no matter which metric is used. The Jeffreys prior for an unknown proportion ''p'' is ''p''<sup>&minus;1/2</sup>(1&nbsp;&minus;&nbsp;''p'')<sup>&minus;1/2</sup>, which differs from Jaynes' recommendation.

Priors based on notions of [[algorithmic probability]] are used in [[inductive inference]] as a basis for induction in very general settings.

Practical problems associated with uninformative priors include the requirement that the posterior distribution be proper. The usual uninformative priors on continuous, unbounded variables are improper. This need not be a problem if the posterior distribution is proper. Another issue of importance is that if an uninformative prior is to be used ''routinely'', i.e., with many different data sets, it should have good [[frequentist]] properties. Normally a [[Bayesian probability|Bayesian]] would not be concerned with such issues, but it can be important in this situation. For example, one would want any [[decision theory|decision rule]] based on the posterior distribution to be [[admissible decision rule|admissible]] under the adopted loss function. Unfortunately, admissibility is often difficult to check, although some results are known (e.g., Berger and Strawderman 1996). The issue is particularly acute with [[hierarchical Bayes model]]s; the usual priors (e.g., Jeffreys' prior) may give badly inadmissible decision rules if employed at the higher levels of the hierarchy.

==Improper priors==
Let events <math>A_1, A_2, \ldots, A_n</math> be mutually exclusive and exhaustive. If Bayes' theorem is written as
:<math>P(A_i\mid B) = \frac{P(B \mid A_i) P(A_i)}{\sum_j P(B\mid A_j)P(A_j)}\, ,</math>
then it is clear that the same result would be obtained if all the prior probabilities ''P''(''A''<sub>''i''</sub>) and ''P''(''A''<sub>''j''</sub>) were multiplied by a given constant; the same would be true for a [[continuous random variable]].  If the summation in the denominator converges, the posterior probabilities will still sum (or integrate) to 1 even if the prior values do not, and so the priors may only need to be specified in the correct proportion. Taking this idea further, in many cases the sum or integral of the prior values may not even need to be finite to get sensible answers for the posterior probabilities.  When this is the case, the prior is called an '''improper prior'''.  However, the posterior distribution need not be a proper distribution if the prior is improper. This is clear from the case where event ''B'' is independent of all of the ''A''<sub>''j''</sub>.

Statisticians sometimes{{Citation needed|date=December 2008}}<ref>{{cite book|last1=Christensen|first1=Ronald|last2=Johnson|first2=Wesley|last3=Branscum|first3=Adam|last4=Hanson|first4=Timothy E.|title=Bayesian Ideas and Data Analysis : An Introduction for Scientists and Statisticians|date=2010|publisher=CRC Press|location=Hoboken|isbn=9781439894798|page=69}}</ref> use improper priors as [[uninformative prior]]s.  For example, if they need a prior distribution for the mean and variance of a random variable, they may assume ''p''(''m'',&nbsp;''v'')&nbsp;~&nbsp;1/''v'' (for ''v''&nbsp;>&nbsp;0) which would suggest that any value for the mean is "equally likely" and that a value for the positive variance becomes "less likely" in inverse proportion to its value.  Many authors (Lindley, 1973; De Groot, 1937; Kass and Wasserman, 1996){{Citation needed|date=December 2008}} warn against the danger of over-interpreting those priors since they are not probability densities. The only relevance they have is found in the corresponding posterior, as long as it is well-defined for all observations. (The [[Beta distribution#Haldane.27s prior probability .28Beta.280.2C0.29.29|Haldane prior]] is a typical counterexample.{{Clarify|reason=counterexample of what?|date=May 2011}}{{Citation needed|date=May 2011}})

By contrast, [[likelihood function]]s do not need to be integrated, and a likelihood function that is uniformly 1 corresponds to the absence of data (all models are equally likely, given no data): Bayes' rule multiplies a prior by the likelihood, and an empty product is just the constant likelihood 1. However, without starting with a prior probability distribution, one does not end up getting a posterior probability distribution, and thus cannot integrate or compute expected values or loss. See {{slink|Likelihood function|Non-integrability}} for details.

=== Examples ===
Examples of improper priors include:
* The [[uniform distribution (continuous)|uniform distribution]] on an infinite interval (i.e., a half-line or the entire real line).
* Beta(0,0), the [[beta distribution]] for α=0, β=0 (uniform distribution on [[log-odds]] scale).
* The logarithmic prior on the [[positive reals]] (uniform distribution on [[log scale]]).{{Citation needed|date=October 2010}}

Note that these functions, interpreted as uniform distributions, can also be interpreted as the [[likelihood function]] in the absence of data, but are not proper priors.

== Notes ==
<references/>

== References ==

* {{cite book |author1=Rubin, Donald B. |author2-link=Andrew Gelman |author2=Gelman, Andrew |author3=John B. Carlin |author4=Stern, Hal |title=Bayesian Data Analysis |edition=2nd |publisher=Chapman & Hall/CRC |location=Boca Raton |year=2003 |pages= |isbn=978-1-58488-388-3 |doi= |accessdate= |mr=2027492 }}
* {{cite book |last=Berger |first=James O. |title=Statistical decision theory and Bayesian analysis |publisher=Springer-Verlag |location=Berlin |year=1985 |pages= |isbn=978-0-387-96098-2 |doi= |accessdate= |mr=0804611 }}
* {{cite journal
 |first1=James O. |last1=Berger
 |first2=William E. |last2=Strawderman
 |title=Choice of hierarchical priors: admissibility in estimation of normal means
 |journal=[[Annals of Statistics]]
 |volume=24 |issue=3 |pages=931&ndash;951 |year=1996
 |doi=10.1214/aos/1032526950
 |mr=1401831 | zbl = 0865.62004
}}
* {{cite journal |first=Jose M. |last=Bernardo
 |title=Reference Posterior Distributions for Bayesian Inference
 |journal=Journal of the Royal Statistical Society, Series B
 |volume=41 |issue= 2 |pages=113&ndash;147 |year=1979
 |mr=0547240 | jstor = 2985028
}}
* {{cite journal | title=The formal definition of reference priors
 |author1=James O. Berger
 |authorlink1=James Berger (statistician)
 |author2=José M. Bernardo
 |authorlink2=José-Miguel Bernardo
 |author3=Dongchu Sun
 |journal=Annals of Statistics
 |year=2009
 |volume=37
 |issue=2
 |pages=905–938
 |arxiv=0904.0156 | doi=10.1214/07-AOS587 
}}
* {{cite journal|last=Jaynes |first=Edwin T. |authorlink= Edwin T. Jaynes |title=Prior Probabilities |journal=IEEE Transactions on Systems Science and Cybernetics |volume=4 |issue=3 |pages=227&ndash;241 |date=Sep 1968 |doi=10.1109/TSSC.1968.300117 |url=http://bayes.wustl.edu/etj/articles/prior.pdf |accessdate=2009-03-27}}
** Reprinted in {{cite book |author=Rosenkrantz, Roger D. |title=E. T. Jaynes: papers on probability, statistics, and statistical physics |publisher=Kluwer Academic Publishers |location=Boston |year=1989 |isbn=978-90-277-1448-0 |doi= |accessdate= |pages=116&ndash;130}}
* {{cite book |last=Jaynes |first=Edwin T. |authorlink= Edwin T. Jaynes |title= Probability Theory: The Logic of Science |publisher=Cambridge University Press |year=2003 |pages= |isbn=978-0-521-59271-0 |doi= |accessdate= |url=http://www-biba.inrialpes.fr/Jaynes/prob.html }}
* {{cite journal |last=Williamson |first=Jon |title=review of Bruno di Finetti. Philosophical Lectures on Probability |journal=Philosophia Mathematica |volume=18 |issue=1 |pages=130&ndash;135 |year=2010 |doi=10.1093/philmat/nkp019 |url=http://www.kent.ac.uk/secl/philosophy/jw/2009/deFinetti.pdf |accessdate=2010-07-02 |url-status=dead |archiveurl=https://web.archive.org/web/20110609175653/http://www.kent.ac.uk/secl/philosophy/jw/2009/deFinetti.pdf |archivedate=2011-06-09 }}

{{DEFAULTSORT:Prior Probability}}
[[Category:Bayesian statistics]]
[[Category:Probability assessment]]