Using Bayesian priors to overcome non-identifiablility issues in Hidden Markov models
Münch, J. L.; Schmauder, R.; Paul, F.; Habeck, M.
Show abstract
Hidden Markov models (HMMs) for biomolecules suffer from various forms of parameter non-identifiability. This poses severe challenges to both maximum likelihood and Bayesian inference. However, Bayesian inference offers effective means of overcoming these pathologies. We study the role of prior distributions in the face of practical parameter non-identifiability in Bayesian inference applied to prototypical patch clamp data of ligand-gated ion channels. We advocate the use of minimally informative priors, as they increase the accuracy and decrease the uncertainty of the inference. For complex HMMs, stronger prior assumptions are needed to render the posterior sufficiently proper. This can be achieved by confining the parameter space to physically motivated limits. Another beneficial assumption is finite cooperativity of ligand-binding and unbinding events, which introduces a bias towards non-cooperativity but still allows for a non-vanishing degree of cooperativity that is inferred from the data. Despite its vagueness, our prior renders the posterior sufficiently proper for all datasets that we considered without imposing the assumption of non-cooperativity. Combining all prior factors allows for meaningful inferences with a dataset of a thousand times lower quality.
Matching journals
The top 8 journals account for 50% of the predicted probability mass.
Similar papers in this journal
Similar papers in this journal
Similar papers in this journal
Similar papers in this journal
- Theoretical properties of nearest-neighbor distance distributions and novel metrics for high dimensional bioinformatics data 96%
- Estimating multiplicity of infection, allele frequencies, and prevalences accounting for incomplete data 95%
- Quantifying spectral information about source separation in multisource odour plumes 94%
"Similar papers" are the closest papers from that journal in the model's embedding space. They show what the match is built on, but the ranking comes mostly from a classifier over the whole training set, not from these examples alone.