On the identifiability of Bayesian factor analytic models

From MaRDI portal
Publication:113012

DOI10.1007/S11222-022-10084-4zbMATH Open1484.62008arXiv2004.05105OpenAlexW3015764491MaRDI QIDQ113012FDOQ113012


Authors: Panagiotis Papastamoulis, Ioannis Ntzoufras, I. Ntzoufras Edit this on Wikidata


Publication date: 27 February 2022

Published in: Statistics and Computing (Search for Journal in Brave)

Abstract: A well known identifiability issue in factor analytic models is the invariance with respect to orthogonal transformations. This problem burdens the inference under a Bayesian setup, where Markov chain Monte Carlo (MCMC) methods are used to generate samples from the posterior distribution. We introduce a post-processing scheme in order to deal with rotation, sign and permutation invariance of the MCMC sample. The exact version of the contributed algorithm requires to solve 2q assignment problems per (retained) MCMC iteration, where q denotes the number of factors of the fitted model. For large numbers of factors two approximate schemes based on simulated annealing are also discussed. We demonstrate that the proposed method leads to interpretable posterior distributions using synthetic and publicly available data from typical factor analytic models as well as mixtures of factor analyzers. An R package is available online at CRAN web-page.


Full work available at URL: https://arxiv.org/abs/2004.05105




Recommendations




Cites Work


Cited In (16)

Uses Software





This page was built for publication: On the identifiability of Bayesian factor analytic models

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