Maximum likelihood estimation of the latent class model through model boundary decomposition

The Expectation-Maximization (EM) algorithm is routinely used for maximum likelihood estimation in latent class analysis. However, the EM algorithm comes with no global guarantees of reaching the global optimum. We study the geometry of the latent class model in order to understand the behavior of t...

Descripción completa

Detalles Bibliográficos
Autores: Allman, Elizabeth Spencer, 1965-, Baños Cervantes, Hector, Evans, Robin, Hoşten, Serkan, Kubjas, Kaie, Lemke, Daniel, Rhodes, John A. (John Anthony), 1960-, Zwiernik, Piotr
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2019
País:España
Institución:Universitat Pompeu Fabra
Repositorio:Repositorio Digital de la UPF
OAI Identifier:oai:repositori.upf.edu:10230/45558
Acceso en línea:http://hdl.handle.net/10230/45558
http://dx.doi.org/10.18409/jas.v10i1.75
Access Level:acceso abierto
Palabra clave:Maximum likelihood estimation
Expectation maximization
Latent class models
Fixed point ideals
Boundary stratification
Descripción
Sumario:The Expectation-Maximization (EM) algorithm is routinely used for maximum likelihood estimation in latent class analysis. However, the EM algorithm comes with no global guarantees of reaching the global optimum. We study the geometry of the latent class model in order to understand the behavior of the maximum likelihood estimator. In particular, we characterize the boundary stratification of the binary latent class model with a binary hidden variable. For small models, such as for three binary observed variables, we show that this stratification allows exact computation of the maximum likelihood estimator. In this case we use simulations to study the maximum likelihood estimation attraction basins of the various strata and performance of the EM algorithm. Our theoretical study is complemented with a careful analysis of the EM fixed point ideal which provides an alternative method of studying the boundary stratification and maximizing the likelihood function. In particular, we compute the minimal primes of this ideal in the case of a binary latent class model with a binary or ternary hidden random variable.