A note on identifiability conditions in confirmatory factor analysis

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish (US)
Article number109190
JournalStatistics and Probability Letters
Volume178
DOIs
StateSubmitted - Nov 1 2021

Bibliographical note

Funding Information:
I am grateful to Xiaoou Li for discussing her work from ( Chen et al., 2020 ), and to the reviewers for their helpful comments. I acknowledge support from NSF award, United States of America IIS-1837992 and BSF award 2018230 .

Funding Information:
I am grateful to Xiaoou Li for discussing her work from (Chen et al. 2020), and to the reviewers for their helpful comments. I acknowledge support from NSF award, United States of AmericaIIS-1837992 and BSF award2018230.

Publisher Copyright:
© 2021 Elsevier B.V.

Keywords

  • Confirmatory factor analysis
  • Factor loadings
  • Identifiability
  • Latent factors
  • Matrix factorizations

Fingerprint

Dive into the research topics of 'A note on identifiability conditions in confirmatory factor analysis'. Together they form a unique fingerprint.

Cite this