论文检索

用二部图揭示稀疏因子分析的可识别性AI 解读

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…

因子数量未知时的稀疏贝叶斯因子分析AI 解读

There has been increased research interest in the subfield of sparse Bayesian factor analysis with shrinkage priors, which achieve additional sparsity beyond the natural parsimonity of factor models. In this spirit, we estimate the number of common factors in the highly implemented sparse latent factor model with spike-and-slab priors on the factor loadings matrix. Our framework leads to a natural, efficient and simultaneous coupling of model estimation and selection on one…

基于广义下三角结构的基本因子模型识别与计数规则AI 解读

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 (PLT) constraint. To fill this gap, we review the advantages of variance identification in sparse factor analysis and introduce the generalized lower triangular (GLT) structures. We show that the GLT assumption is an improvement over PLT…

Student-t 分布自由度参数的贝叶斯估计：一种有益的重参数化AI 解读

In this paper, conditional data augmentation (DA) is investigated for the degrees of freedom parameter $ν$ of a Student-$t$ distribution. Based on a restricted version of the expected augmented Fisher information, it is conjectured that the ancillarity DA is progressively more efficient for MCMC estimation than the sufficiency DA as $ν$ increases; with the break even point lying at as low as $ν\approx4$. The claim is examined further and generalized through a large…