arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.09261stat.APmath.STstat.MEstat.TH
收藏

稀疏潜在特征模型的后验收缩率及其在蛋白质组学中的应用

Posterior Contraction Rate of Sparse Latent Feature Models with Application to Proteomics

Tong Li, Tianjian Zhou, Kam-Wah Tsui, Lin Wei, Yuan Ji

摘要:

印第安自助过程(IBP)和系统发育印第安自助过程(pIBP)可以作为先验模型来推断数据集中的潜在特征。然而,这些模型的理论特性尚未得到充分探索,特别是在高维环境中。在本文中,我们证明了在温和的稀疏性条件下,由IBP或pIBP先验生成的潜在特征矩阵的后验分布,渐近收敛到真正的潜在特征矩阵。我们推导出后验收敛率,称为收缩率。我们表明,收敛保持即使当潜在的特征矩阵的维数与样本量增加,因此,使后验推理有效的高维设置。我们用计算机模拟证明了理论结果,其中并行回火马尔可夫链蒙特卡罗方法被应用于克服计算障碍。推导出的属性的实际效用证明通过推断的潜在功能在反相蛋白质阵列(RPPA)数据集下的IBP先验模型。手稿中报告的软件和数据集可在http://www.compgenome.org/IBP上获得。

英文摘要:

The Indian buffet process (IBP) and phylogenetic Indian buffet process (pIBP) can be used as prior models to infer latent features in a data set. The theoretical properties of these models are under-explored, however, especially in high dimensional settings. In this paper, we show that under mild sparsity condition, the posterior distribution of the latent feature matrix, generated via IBP or pIBP priors, converges to the true latent feature matrix asymptotically. We derive the posterior convergence rate, referred to as the contraction rate. We show that the convergence holds even when the dimensionality of the latent feature matrix increases with the sample size, therefore making the posterior inference valid in high dimensional setting. We demonstrate the theoretical results using computer simulation, in which the parallel-tempering Markov chain Monte Carlo method is applied to overcome computational hurdles. The practical utility of the derived properties is demonstrated by inferring the latent features in a reverse phase protein arrays (RPPA) dataset under the IBP prior model. Software and dataset reported in the manuscript are provided at http://www.compgenome.org/IBP.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑