Crossmark

Infinite hidden Markov models can dissect the complexities of learning

Crossref DOI link: https://doi.org/10.1038/s41593-025-02130-x

Published Online: 2025-12-30

Published Print: 2026-01

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Bruijns, Sebastian A. https://orcid.org/0000-0002-0854-9159
,

Lau, Petrina Y. P.

Miska, Nathaniel J.

Noel, Jean-Paul

Pan-Vazquez, Alejandro

Roth, Noam

Socha, Karolina Z.

Urai, Anne E.

Bougrova, Kcénia

Laranjeira, Inês C.

Lau, Petrina Y. P.

Meijer, Guido T. https://orcid.org/0000-0002-7473-0482
Miska, Nathaniel J.

Noel, Jean-Paul https://orcid.org/0000-0001-5297-3363
Pan-Vazquez, Alejandro

Roth, Noam

Socha, Karolina Z.

Urai, Anne E. https://orcid.org/0000-0001-5270-6513
Dayan, Peter https://orcid.org/0000-0003-3476-1839
Funding

Funding for this research was provided by:

Simons Foundation (552343)

Simons Foundation (552343)

Simons Foundation (552343)

Simons Foundation (552343)

Simons Foundation (552343)

Simons Foundation (552343)

Simons Foundation (552343)

Simons Foundation (552343)

Simons Foundation (552343)

Simons Foundation (552343)

Simons Foundation (552343)

Simons Foundation (552343)

Simons Foundation (552343)

Max-Planck-Gesellschaft

Wellcome Trust (216324)

Wellcome Trust (216324)

Wellcome Trust (216324)

Wellcome Trust (216324)

Wellcome Trust (216324)

Wellcome Trust (216324)

Wellcome Trust (216324)

Wellcome Trust (216324)

Wellcome Trust (216324)

Wellcome Trust (216324)

Wellcome Trust (216324)

Wellcome Trust (216324)

Alexander von Humboldt-Stiftung
License Information

Text and Data Mining valid from 2025-12-30

Version of Record valid from 2025-12-30
More Information

Article History

Received: 18 December 2023

Accepted: 15 October 2025

First Online: 30 December 2025

Competing interests

: The authors declare no competing interests.

Document is current

Any future updates will be listed below