Maximum a-posteriori approximation

Shinji Watanabe, Jen‐Tzung ChienCambridge 2015 · DOI · OpenAlex

Abstract

Maximum a-posteriori (MAP) approximation is a well-known and widely used approximation for Bayesian inference. The approximation covers all variables including model parameters Θ, latent variables Z, and classification categories C (word sequence W in the automatic speech recognition case). For example, the Viterbi algorithm (arg maxZp(Z|O)) in the continuous density hidden Markov model (CDHMM), as discussed in Section 3.3.2, corresponds to the MAP approximation of latent variables, while the forward–backward algorithm, as discussed in Section 3.3.1, corresponds to an exact inference of these variables. As another example, the MAP decision rule (arg maxCp(C|O)) in Eq. (3.2) also corresponds to the MAP approximation of inferring the posterior distribution of classification categories. Since the final goal of automatic speech recognition is to output the word sequence, the MAP approximation of the word sequence matches the final goal. Thus, the MAP approximation can be applied to all probabilistic variables in speech and language processing as an essential technique.
BibTeX
@inproceedings{watanabe2015maximum,
  author = {Shinji Watanabe and Jen‐Tzung Chien},
  title = {{Maximum a-posteriori approximation}},
  booktitle = {Cambridge},
  year = {2015},
  doi = {10.1017/cbo9781107295360.005},
}

Loading related content...

Figure