Search: in
Maximum a posteriori
Maximum a posteriori Encyclopedia
  Tutorials     Encyclopedia     Dictionary     Directory  
Maximum_a_posteriori Email this to a friend      Maximum_a_posteriori

Maximum a posteriori

In statistics, the method of maximum a posteriori (MAP, or posterior mode) estimation can be used to obtain a point estimate of an unobserved quantity on the basis of empirical data. It is closely related to Fisher's method of maximum likelihood (ML), but employs an augmented optimization objective which incorporates a prior distribution over the quantity one wants to estimate. MAP estimation can therefore be seen as a regularization of ML estimation.

Contents


Introduction

Assume that we want to estimate an unobserved population parameter \theta on the basis of observations x. Let f be the sampling distribution of x, so that f(x|\theta) is the probability of x when the underlying population parameter is \theta. Then the function

\theta \mapsto f(x | \theta) \!

is known as the likelihood function and the estimate

\hat{\theta}_{\mathrm{ML}}(x) = \arg\max_{\theta} f(x | \theta) \!

as the maximum likelihood estimate of \theta.

Now assume that a prior distribution g over \theta exists. This allows us to treat \theta as a random variable as in Bayesian statistics. Then the posterior distribution of \theta is as follows:

\theta \mapsto \frac{f(x | \theta) \, g(\theta)}{\displaystyle\int_{\Theta} f(x | \theta') \, g(\theta') \, d\theta'} \!

where g is density function of \theta, \Theta is the domain of g. This is a straightforward application of Bayes' theorem.

The method of maximum a posteriori estimation then estimates \theta as the mode of the posterior distribution of this random variable:

\hat{\theta}_{\mathrm{MAP}}(x) = \arg\max_{\theta} \frac{f(x | \theta) \, g(\theta)} {\displaystyle\int_{\Theta} f(x | \theta') \, g(\theta') \, d\theta'} = \arg\max_{\theta} f(x | \theta) \, g(\theta) \!

The denominator of the posterior distribution does not depend on \theta and therefore plays no role in the optimization. Observe that the MAP estimate of \theta coincides with the ML estimate when the prior g is uniform (that is, a constant function). The MAP estimate is the Bayes estimator under the uniform loss function.

MAP estimates can be computed in several ways:

  1. Analytically, when the mode(s) of the posterior distribution can be given in closed form. This is the case when conjugate priors are used.
  2. Via numerical optimization such as the conjugate gradient method or Newton's method. This usually requires first or second derivatives, which have to be evaluated analytically or numerically.
  3. Via a modification of an expectation-maximization algorithm. This does not require derivatives of the posterior density.

While MAP estimation is a Bayes estimator (under the 0-1 loss function), it is not very representative of Bayesian methods in general. This is because MAP estimates are point estimates, whereas Bayesian methods are characterized by the use of distributions to summarize data and draw inferences: thus, Bayesian methods tend to report the posterior mean or median instead, together with posterior intervals. This is both because these estimators are optimal under squared-error and linear-error loss respectively - which are more representative of typical loss functions - and because the posterior distribution may not have a simple analytic form: in this case, the distribution can be simulated using Markov chain Monte Carlo techniques, while optimization to find its mode(s) may be difficult or impossible.

Example

Suppose that we are given a sequence (x_1, \dots, x_n) of IID N(\mu,\sigma_v^2 ) random variables and an a priori distribution of \mu is given by N(0,\sigma_m^2 ). We wish to find the MAP estimate of \mu.

The function to be maximized is then given by

\pi(\mu) L(\mu) = \frac{1}{\sqrt{2 \pi} \sigma_m} \exp\left(-\frac{1}{2} \left(\frac{\mu}{\sigma_m}\right)^2\right) \prod_{j=1}^n \frac{1}{\sqrt{2 \pi} \sigma_v} \exp\left(-\frac{1}{2} \left(\frac{x_j - \mu}{\sigma_v}\right)^2\right),

which is equivalent to minimizing \mu in the following

\sum_{j=1}^n \left(\frac{x_j - \mu}{\sigma_v}\right)^2 + \left(\frac{\mu}{\sigma_m}\right)^2.

Thus, we see that the MAP estimator for μ is given by

\hat{\mu}_{MAP} = \frac{\sigma_m^2}{n \sigma_m^2 + \sigma_v^2 } \sum_{j=1}^n x_j.

The case of \sigma_m \to \infty is called a non-informative prior and leads to an ill-defined a priori probability distribution; in this case \hat{\mu}_{MAP} \to \hat{\mu}_{ML}.

See also

References

  • M. DeGroot, Optimal Statistical Decisions, McGraw-Hill, (1970).
  • Harold W. Sorenson, (1980) "Parameter Estimation: Principles and Problems", Marcel Dekker.

de:Maximum a posteriori fr:Maximum a posteriori ja:?????? nl:Maximum-a-posteriori-schatter ru:???????????? ????????????? ???????? zh:??????





Source: Wikipedia | The above article is available under the GNU FDL. | Edit this article



Related Links in Maximum a posteriori

Search for Maximum a posteriori in Tutorials
Search for Maximum a posteriori in Encyclopedia
Search for Maximum a posteriori in Dictionary
Search for Maximum a posteriori in Open Directory
Search for Maximum a posteriori in Store
Search for Maximum a posteriori in PriceGig



Help build the largest human-edited directory on the web.
Submit a Site - Open Directory Project - Become an Editor

Advertisement

Advertisement



Maximum a posteriori
Maximum_a_posteriori top Maximum_a_posteriori

Home - Add TutorGig to Your Site - Disclaimer

©2008-2009 TutorGig.com. All Rights Reserved. Privacy Statement