Estimation of linear autoregressive models with Markov-switching, the E.M. algorithm revisited
Joseph Rynkiewicz (CES, Samos)

TL;DR
This paper revisits the EM algorithm for estimating linear autoregressive models with Markov-switching, generalizing Elliot's method for hidden Markov models and simplifying the computation by avoiding backward recursion.
Contribution
The paper introduces a generalized EM algorithm for Markov-switching autoregressive models that eliminates the need for backward recursion, simplifying the estimation process.
Findings
The new method effectively estimates model parameters.
It simplifies computation compared to previous approaches.
The approach generalizes existing methods for hidden Markov models.
Abstract
This work concerns estimation of linear autoregressive models with Markov-switching using expectation maximisation (E.M.) algorithm. Our method generalise the method introduced by Elliot for general hidden Markov models and avoid to use backward recursion.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Methods and Mixture Models · Bayesian Modeling and Causal Inference · Statistical Methods and Inference
