TY - JOUR
T1 - A note on identifiability conditions in confirmatory factor analysis
AU - Leeb, William
N1 - Publisher Copyright:
© 2021 Elsevier B.V.
PY - 2021/11
Y1 - 2021/11
N2 - 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.
AB - 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.
KW - Confirmatory factor analysis
KW - Factor loadings
KW - Identifiability
KW - Latent factors
KW - Matrix factorizations
UR - http://www.scopus.com/inward/record.url?scp=85111058256&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85111058256&partnerID=8YFLogxK
U2 - 10.1016/j.spl.2021.109190
DO - 10.1016/j.spl.2021.109190
M3 - Article
AN - SCOPUS:85111058256
SN - 0167-7152
VL - 178
JO - Statistics and Probability Letters
JF - Statistics and Probability Letters
M1 - 109190
ER -