IDEAS home Printed from https://ideas.repec.org/a/eee/csdana/v222y2026ics016794732600071x.html

A penalized maximum likelihood approach to deal with latent state separation in hidden Markov models with covariates and lagged responses

Author

Listed:
  • Brusa, Luca
  • Pennoni, Fulvia
  • Bartolucci, Francesco
  • Peruilh Bagolini, Romina

Abstract

A penalized maximum likelihood estimation approach is proposed for discrete-time hidden Markov models in which the manifest distribution depends on covariates and the lagged response. The proposed method addresses the issue of latent state separation, typically arising with binary responses or categorical response variables with a limited number of categories, which leads to extremely large estimates of the support points of the latent variable distribution. We also propose a cross-validation approach for jointly selecting the number of latent states of the model and the strength of the likelihood penalization. The approach is validated through a deep simulation study aimed at comparing parameter estimation accuracy and computational efficiency across different estimation procedures. Finally, we illustrate the proposed approach by analyzing longitudinal data collected during spinal anesthesia, including covariates, with the aim of monitoring the occurrence of hypotension in certain patients.

Suggested Citation

  • Brusa, Luca & Pennoni, Fulvia & Bartolucci, Francesco & Peruilh Bagolini, Romina, 2026. "A penalized maximum likelihood approach to deal with latent state separation in hidden Markov models with covariates and lagged responses," Computational Statistics & Data Analysis, Elsevier, vol. 222(C).
  • Handle: RePEc:eee:csdana:v:222:y:2026:i:c:s016794732600071x
    DOI: 10.1016/j.csda.2026.108402
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S016794732600071X
    Download Restriction: Full text for ScienceDirect subscribers only.

    File URL: https://libkey.io/10.1016/j.csda.2026.108402?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:csdana:v:222:y:2026:i:c:s016794732600071x. 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.