Pith. sign in

REVIEW 1 cited by

Sparse Bayesian Factor Analysis when the Number of Factors is Unknown

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1804.04231 v1 pith:Z5OFRGWI submitted 2018-04-11 stat.ME

Sparse Bayesian Factor Analysis when the Number of Factors is Unknown

classification stat.ME
keywords factornumberfactorssparsecommonloadingslowermodel
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Despite the popularity of sparse factor models, 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 provide a counting rule on the number of nonzero factor loadings that is sufficient for achieving uniqueness of the variance decomposition in the factor representation. Furthermore, we introduce the generalised lower triangular representation to resolve rotational invariance and show that within this model class the unknown number of common factors can be recovered in an overfitting sparse factor model. By combining point-mass mixture priors with a highly efficient and customised MCMC scheme, we obtain posterior summaries regarding the number of common factors as well as the factor loadings via postprocessing. Our methodology is illustrated for monthly exchange rates of 22 currencies with respect to the euro over a period of eight years and for monthly log returns of 73 firms from the NYSE100 over a period of 20 years.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. An efficient adaptive dimension selection algorithm for multidimensional probit graded response models

    stat.ML 2026-07 conditional novelty 5.0

    A cumulative ordered spike-and-slab prior plus Gibbs sampling selects the number of latent dimensions in probit graded response models in a single adaptive run.