Ghahramani, Z. & Jordan, M. I. (1997). Factorial hidden Markov models. Machine Learning 29(2–3): 245–273. doi:10.1023/A:1007425814087. An earlier version: Advances in Neural Information Processing Systems 8 (1995).
Read in full on 2026-10-27 (NOTE-1203). One account was drawn from it: THEORY-1045.
Why this is here
The owner asked on 2026-10-27 to “file the next readings”. The infinite factorial HMM (LIT-1577) is this model with the number of binary chains left unbounded under a Markov IBP prior, and the record held it without its parametric original. CASE-165’s model of members’ features, each feature a two-state chain over days and the output a sum of the active features’ contributions, is a factorial HMM in structure, so this paper’s account of why the chains couple given the data, and of what exact and approximate inference cost, bears on what fitting that model would take.