IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0325979.html
   My bibliography  Save this article

A sticky Poisson Hidden Markov Model for solving the problem of over-segmentation and rapid state switching in cortical datasets

Author

Listed:
  • Tianshu Li
  • Giancarlo La Camera

Abstract

The application of hidden Markov models (HMMs) to neural data has uncovered hidden states and signatures of neural dynamics that are relevant for sensory and cognitive processes. However, training an HMM on cortical data requires a careful handling of model selection, since models with more numerous hidden states generally have a higher likelihood on new (unseen) data. A potentially related problem is the occurrence of very rapid state switching after decoding the data with an HMM. The first problem can lead to overfitting and over-segmentation of the data. The second problem is due to intermediate-to-low self-transition probabilities and is at odds with many reports that hidden states in cortex tend to last from hundred of milliseconds to seconds. Here, we show that we can alleviate both problems by regularizing a Poisson-HMM during training so as to enforce large self-transition probabilities. We call this algorithm the ‘sticky Poisson-HMM’ (sPHMM). The sPHMM successfully eliminates rapid state switching, outperforming an alternative strategy based on an HMM with a large prior on the self-transition probabilities. When used together with the Bayesian Information Criterion for model selection, the sPHMM also captures the ground truth in surrogate datasets built to resemble the statistical properties of the experimental data.

Suggested Citation

  • Tianshu Li & Giancarlo La Camera, 2025. "A sticky Poisson Hidden Markov Model for solving the problem of over-segmentation and rapid state switching in cortical datasets," PLOS ONE, Public Library of Science, vol. 20(7), pages 1-41, July.
  • Handle: RePEc:plo:pone00:0325979
    DOI: 10.1371/journal.pone.0325979
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0325979
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0325979&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0325979?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0325979. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.