Online Expectation Maximization based algorithms for inference in hidden Markov models
نویسندگان
چکیده
The Expectation Maximization (EM) algorithm is a versatile tool for model parameter estimation in latent data models. When processing large data sets or data stream however, EM becomes intractable since it requires the whole data set to be available at each iteration of the algorithm. In this contribution, a new generic online EM algorithm for model parameter inference in general Hidden Markov Model is proposed. This new algorithm updates the parameter estimate after a block of observations is processed (online). The convergence of this new algorithm is established, and the rate of convergence is studied showing the impact of the block-size sequence. An averaging procedure is also proposed to improve the rate of convergence. Finally, practical illustrations are presented to highlight the performance of these algorithms in comparison to other online maximum likelihood procedures.
منابع مشابه
On particle-based online smoothing and parameter inference in general hidden Markov models
This thesis consists of two papers studying online inference in general hidden Markov models using sequential Monte Carlo methods. The first paper present an novel algorithm, the particle-based, rapid incremental smoother (PaRIS), aimed at efficiently perform online approximation of smoothed expectations of additive state functionals in general hidden Markov models. The algorithm has, under wea...
متن کامل3 Bayesian Methods in Biological Sequence Analysis
Hidden Markov models, the expectation–maximization algorithm, and the Gibbs sampler were introduced for biological sequence analysis in early 1990s. Since then the use of formal statistical models and inference procedures has revolutionized the field of computational biology. This chapter reviews the hidden Markov and related models, as well as their Bayesian inference procedures and algorithms...
متن کاملto “ Online Expectation Maximization based algorithms for inference in Hidden Markov Models ”
This is a supplementary material to the paper [7]. It contains technical discussions and/or results adapted from published papers. In Sections 2 and 3, we provide results useful for the proofs of some theorems in [7] which are close to existing results in the literature. It also contains, in Section 4, additional plots for the numerical analyses in [7, Section 3]. To make this supplement paper ...
متن کاملOn the Inference of Ancestries in Admixed Populations
Inference of ancestral information in recently admixed populations, in which every individual is composed of a mixed ancestry (e.g., African Americans in the United States), is a challenging problem. Several previous model-based approaches to admixture have been based on hidden Markov models (HMMs) and Markov hidden Markov models (MHMMs). We present an augmented form of these models that can be...
متن کاملBayesian Methods in Biological Sequence Analysis
Hidden Markov models, the expectation–maximization algorithm, and the Gibbs sampler were introduced for biological sequence analysis in early 1990s. Since then the use of formal statistical models and inference procedures has revolutionized the field of computational biology. This chapter reviews the hidden Markov and related models, as well as their Bayesian inference procedures and algorithms...
متن کامل