Legramanti Sirio, Durante Daniele, Dunson David B
Department of Decision Sciences, Bocconi University, Via Röntgen 1, 20136 Milan, Italy.
Department of Statistical Science, Duke University, Box 90251, Durham, North Carolina 27707, USA.
Biometrika. 2020 Sep;107(3):745-752. doi: 10.1093/biomet/asaa008. Epub 2020 May 27.
The dimension of the parameter space is typically unknown in a variety of models that rely on factorizations. For example, in factor analysis the number of latent factors is not known and has to be inferred from the data. Although classical shrinkage priors are useful in such contexts, increasing shrinkage priors can provide a more effective approach that progressively penalizes expansions with growing complexity. In this article we propose a novel increasing shrinkage prior, called the cumulative shrinkage process, for the parameters that control the dimension in overcomplete formulations. Our construction has broad applicability and is based on an interpretable sequence of spike-and-slab distributions which assign increasing mass to the spike as the model complexity grows. Using factor analysis as an illustrative example, we show that this formulation has theoretical and practical advantages relative to current competitors, including an improved ability to recover the model dimension. An adaptive Markov chain Monte Carlo algorithm is proposed, and the performance gains are outlined in simulations and in an application to personality data.
在各种依赖因式分解的模型中,参数空间的维度通常是未知的。例如,在因子分析中,潜在因子的数量是未知的,必须从数据中推断出来。尽管经典的收缩先验在这种情况下很有用,但递增收缩先验可以提供一种更有效的方法,随着复杂性的增加逐步惩罚扩展。在本文中,我们针对超完备公式中控制维度的参数提出了一种新颖的递增收缩先验,称为累积收缩过程。我们的构造具有广泛的适用性,它基于一系列可解释的尖峰和平板分布,随着模型复杂性的增加,这些分布将越来越多的质量分配给尖峰。以因子分析为例,我们表明这种公式相对于当前的竞争方法具有理论和实际优势,包括提高恢复模型维度的能力。我们提出了一种自适应马尔可夫链蒙特卡罗算法,并在模拟和人格数据应用中概述了性能提升。