English

An adaptive simulated annealing EM algorithm for inference on non-homogeneous hidden Markov models

Machine Learning 2019-12-23 v1 Machine Learning Optimization and Control Computation

Abstract

Non-homogeneous hidden Markov models (NHHMM) are a subclass of dependent mixture models used for semi-supervised learning, where both transition probabilities between the latent states and mean parameter of the probability distribution of the responses (for a given state) depend on the set of pp covariates. A priori we do not know which (and how) covariates influence the transition probabilities and the mean parameters. This induces a complex combinatorial optimization problem for model selection with 4p4^p potential configurations. To address the problem, in this article we propose an adaptive (A) simulated annealing (SA) expectation maximization (EM) algorithm (ASA-EM) for joint optimization of models and their parameters with respect to a criterion of interest.

Keywords

Cite

@article{arxiv.1912.09733,
  title  = {An adaptive simulated annealing EM algorithm for inference on non-homogeneous hidden Markov models},
  author = {Aliaksandr Hubin},
  journal= {arXiv preprint arXiv:1912.09733},
  year   = {2019}
}

Comments

8 pages, 6 figures, 4 tables. Accepted version of the article published in AIIPCC 2019

R2 v1 2026-06-23T12:52:12.995Z