Cover It Up! Bipartite Graphs Uncover Identifiability in Sparse Factor Analysis

Darjus Hosszejni and Sylvia Fr\"uhwirth-Schnatter

Papers from arXiv.org

Abstract: Despite the popularity of factor models with sparse loading matrices, little attention has been given to formally address identifiability of these models beyond standard rotation-based identification such as the positive lower triangular constraint. To fill this gap, we present a counting rule on the number of nonzero factor loadings that is sufficient for achieving generic uniqueness of the variance decomposition in the factor representation. This is formalized in the framework of sparse matrix spaces and some classical elements from graph and network theory. Furthermore, we provide a computationally efficient tool for verifying the counting rule. Our methodology is illustrated for real data in the context of post-processing posterior draws in Bayesian sparse factor analysis.

Date: 2022-11, Revised 2025-02
New Economics Papers: this item is included in nep-ecm
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://arxiv.org/pdf/2211.00671 Latest version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:arx:papers:2211.00671

Access Statistics for this paper

More papers in Papers from arXiv.org
Bibliographic data for series maintained by arXiv administrators ().