Problems with EM Algorithms for ML Factor Analysis
- 1 June 1983
- journal article
- Published by Cambridge University Press (CUP) in Psychometrika
- Vol. 48 (2) , 247-251
- https://doi.org/10.1007/bf02294019
Abstract
Rubin and Thayer recently presented equations to implement maximum likelihood (ML) estimation in factor analysis via the EM algorithm. They present an example to demonstrate the efficacy of the algorithm, and propose that their recovery of multiple local maxima of the ML function “certainly should cast doubt on the general utility of second derivatives of the log likelihood as measures of precision of estimation.” It is shown here, in contrast, that these second derivatives verify that Rubin and Thayer did not find multiple local maxima as claimed. The only known maximum remains the one found by Jöreskog over a decade earlier. The standard errors obtained from the second derivatives and the Fisher information matrix thus remain appropriate where ML assumptions are met. The advantages of the EM algorithm over other algorithms for ML factor analysis remain to be demonstrated.Keywords
This publication has 5 references indexed in Scilit:
- EM Algorithms for ML Factor AnalysisPsychometrika, 1982
- On the Existence and Uniqueness of the Maximum Likelihood Estimate of a Vector-Valued Parameter in Fixed-Size SamplesThe Annals of Statistics, 1981
- Linear Structural Equations with Latent VariablesPsychometrika, 1980
- Maximum Likelihood from Incomplete Data Via the EM AlgorithmJournal of the Royal Statistical Society Series B: Statistical Methodology, 1977
- A General Approach to Confirmatory Maximum Likelihood Factor AnalysisPsychometrika, 1969