A note on identifiability conditions in confirmatory factor analysis
William Leeb
TL;DR
This paper provides an elementary proof for non-asymptotic identifiability conditions in confirmatory factor analysis, extending recent asymptotic results and including factor loadings.
Contribution
It offers a simplified proof for non-asymptotic identifiability conditions and extends the characterization to factor loadings.
Findings
Elementary proof for non-asymptotic identifiability conditions
Extension of identifiability characterization to factor loadings
Clarification of conditions for latent factor identifiability
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.