The generalized lower triangular process prior
Abstract
In the analysis of multivariate data, factor models represent a powerful technique for both reducing dimensionality and facilitating qualitative understanding of the latent determinants governing the observed data. Interpretability, however, is often hindered by the non-identifiability of factor loading matrices due to rotational invariance. A prevailing strategy to address this issue is to consider positive lower triangular structures. A relaxation of the latter condition has been recently proposed in the literature with the so called generalized lower triangular structure. However, its Bayesian implementation presents substantial challenges, requiring complex reversible-jump algorithms and making prior elicitation difficult because of the limited interpretability of the model parameters. In this paper, we introduce a generalized lower triangular process prior that allows both global and within-component sparsity structures for learning both the number of factors and possible sparsity structures within the vector of observations. The proposed approach provides straightforward prior parameters elicitation exploiting possibly different prior information on the rank and sparsity characteristics. We also explore connections with the Indian buffet process, providing further insight into the sparsity structure induced by the proposed prior. Posterior computation can be performed resorting to a Gibbs sampler with Metropolis-Hastings moves. The efficacy of the proposed method is demonstrated through comprehensive simulations and the analysis of the Big Five Personality Test data.
Related
- Weak Factor Recovery in Sparse Bayesian Factor Models under Exchangeable Shrinkage Process Prior
- Prior-Amortized In-Context Bayesian Inference for Generalized Linear Mixed-Effects Models
- Accelerated Degradation Process Analysis Based on the Generalized Wiener Process with Mixed Random Effects
- Generalized Tan-Arlery-Rabaste-Lehmann-Ovarlez Lower Bound on Ambiguity Function of a Set of Sequences With Mismatched Filters
- FirstFit coloring process of random bipartite graphs and an online coloring lower bound in the random order model
BibTeX
@misc{canale2026generalized,
title = {{The generalized lower triangular process prior}},
author = {Antonio Canale and Sylvia Frühwirth-Schnatter},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.09762},
eprint = {2610.09762},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.09762},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - The generalized lower triangular process prior
AU - Antonio Canale
AU - Sylvia Frühwirth-Schnatter
PY - 2026
DA - 2026/10/07
PB - arXiv
DO - 10.48550/arxiv.2610.09762
UR - https://arxiv.org/abs/2610.09762
AB - In the analysis of multivariate data, factor models represent a powerful technique for both reducing dimensionality and facilitating qualitative understanding of the latent determinants governing the observed data. Interpretability, however, is often hindered by the non-identifiability of factor loading matrices due to rotational invariance. A prevailing strategy to address this issue is to consider positive lower triangular structures. A relaxation of the latter condition has been recently proposed in the literature with the so called generalized lower triangular structure. However, its Bayesian implementation presents substantial challenges, requiring complex reversible-jump algorithms and making prior elicitation difficult because of the limited interpretability of the model parameters. In this paper, we introduce a generalized lower triangular process prior that allows both global and within-component sparsity structures for learning both the number of factors and possible sparsity structures within the vector of observations. The proposed approach provides straightforward prior parameters elicitation exploiting possibly different prior information on the rank and sparsity characteristics. We also explore connections with the Indian buffet process, providing further insight into the sparsity structure induced by the proposed prior. Posterior computation can be performed resorting to a Gibbs sampler with Metropolis-Hastings moves. The efficacy of the proposed method is demonstrated through comprehensive simulations and the analysis of the Big Five Personality Test data.
ER -