A note on identifiability conditions in confirmatory factor analysis
Statistics Theory
2021-04-08 v2 Statistics Theory
Abstract
Recently, Chen, Li and Zhang established conditions characterizing asymptotic identifiability of latent factors in confirmatory factor analysis. We give an elementary proof showing that a similar characterization holds non-asymptotically, and prove a related result for identifiability of factor loadings.
Cite
@article{arxiv.1912.02879,
title = {A note on identifiability conditions in confirmatory factor analysis},
author = {William Leeb},
journal= {arXiv preprint arXiv:1912.02879},
year = {2021}
}