Matching criterion for identifiability in sparse factor analysis

DOI10.1017/PSY.2026.10079MaRDI QIDQ7256096zbMATH OpenFDO

Authors Nils Sturma, Miriam Kranzlmueller, Irem Portakal, Mathias Drton

Publication date 2 June 2026

Published in Psychometrika (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/PSY.2026.10079

zbMATH Keywords

covariance matrixgraphical modellatent variablesparameter identificationstructural equation model

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Probabilistic graphical models (62H22) Factor analysis and principal components; correspondence analysis (62H25)

Cites work

• A rationale and test for the number of factors in factor analysis
• Algebraic factor analysis: tetrads, pentads and beyond
• Algebraic sparse factor analysis
• An analytical solution for approximating simple structure in factor analysis
• Bayesian analysis of static and dynamic factor models: an ex-post approach towards the rotation problem
• Bayesian exploratory factor analysis
• Bayesian group factor analysis with structured sparsity
• Cover it up! Bipartite graphs uncover identifiability in sparse factor analysis
• Generic global identification in factor analysis
• Half-trek criterion for identifiability of latent variable models
• Handbook of Graphical Models
• High dimensional covariance matrix estimation using a factor model
• scientific article; zbMATH DE number 3117083 (Why is no real title available?)
• scientific article; zbMATH DE number 3940575 (Why is no real title available?)
• scientific article; zbMATH DE number 45532 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 1493045 (Why is no real title available?)
• Identification of the linear factor model
• Rotation to sparse loadings using L^p losses and related inference problems
• Scikit-learn: machine learning in Python
• Some complexity results for polynomial ideals
• Sparse Bayesian factor analysis when the number of factors is unknown (with discussion)
• Sparse exploratory factor analysis
• Sparse factor analysis for learning and content analytics
• Statistical analysis of factor models of high dimension
• The Resolution of Six Tests into Three General Factors
• The varimax criterion for analytic rotation in factor analysis
• Trek separation for Gaussian graphical models
• Variable selection via the weighted group Lasso for factor analysis models

This page was built for publication: Matching criterion for identifiability in sparse factor analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7256096)