Exploratory Factor Analysis by Gauss-Newton
Algorithms · 17.07.2026 · 19 (7) · 592
DOI: 10.3390/a19070592 ↗Kurz gefasst
Fachartikel in der Zeitschrift Algorithms, online erschienen am 17.07.2026. Verfasst von Kenneth Lange. Die Arbeit nennt 26 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: USPHS.
Abstract (Originalsprache)
After more than a century, factor analysis remains one of the most popular tools in applied statistics. Exploratory factor analysis tends to be driven by iterated principal axis factorization. Confirmatory factor analysis tends to rely on maximum likelihood estimation. This paper demonstrates the computational superiority of the Gauss–Newton method in minimizing the principal axis loss. On sample problems, Gauss–Newton is more than three orders of magnitude faster than popular implementations of maximum likelihood factor analysis. As part of this comparison, we derive an alternative Gauss–Newton method that leverages the MM principle of optimization. We also explore a simple perturbation correction that dramatically improves the accuracy of the factor loading matrices derived from approximate spectral decompositions. Finally, we suggest a robust version of iterated principal axis factorization that leverages the MM principle, block descent, and the Gauss–Newton method. These innovations are implemented in Julia code and applied to a sequence of representative problems.
Förderung
- USPHS
Zitieren
APA
Lange, K. (2026). Exploratory Factor Analysis by Gauss-Newton. Algorithms, 19(7), 592. https://doi.org/10.3390/a19070592
Vancouver
Lange K. Exploratory Factor Analysis by Gauss-Newton. Algorithms. 2026;19(7):592. doi:10.3390/a19070592
BibTeX
@article{Lange2026,
author = {Lange, Kenneth},
title = {Exploratory Factor Analysis by Gauss-Newton},
journal = {Algorithms},
year = {2026},
volume = {19},
number = {7},
pages = {592},
doi = {10.3390/a19070592}
}
EUVIMED