IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v195y2024ics0167947324000392.html
   My bibliography  Save this article

A new algorithm for inference in HMM's with lower span complexity

Author

Listed:
  • Pereira, Diogo
  • Nunes, Cláudia
  • Rodrigues, Rui

Abstract

The maximum likelihood problem for Hidden Markov Models is usually numerically solved by the Baum-Welch algorithm, which uses the Expectation-Maximization algorithm to find the estimates of the parameters. This algorithm has a recursion depth equal to the data sample size and cannot be computed in parallel, which limits the use of modern GPUs to speed up computation time. A new algorithm is proposed that provides the same estimates as the Baum-Welch algorithm, requiring about the same number of iterations, but is designed in such a way that it can be parallelized. As a consequence, it leads to a significant reduction in the computation time. This reduction is illustrated by means of numerical examples, where we consider simulated data as well as real datasets.

Suggested Citation

  • Pereira, Diogo & Nunes, Cláudia & Rodrigues, Rui, 2024. "A new algorithm for inference in HMM's with lower span complexity," Computational Statistics & Data Analysis, Elsevier, vol. 195(C).
    • Handle: RePEc:eee:csdana:v:195:y:2024:i:c:s0167947324000392
    DOI: 10.1016/j.csda.2024.107955
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167947324000392
    Download Restriction: Full text for ScienceDirect subscribers only.
    File URL: https://libkey.io/10.1016/j.csda.2024.107955?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:csdana:v:195:y:2024:i:c:s0167947324000392. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/csda .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.