Efficient Computation in Multi-level Models

多级模型的高效计算

• 批准号: 0438240
• 负责人: David van Dyk
• 金额: --
• 依托单位: University of California-Irvine
• 依托单位国家: 美国
• 项目类别: Continuing Grant
• 财政年份: 2003
• 资助国家: 美国
• 起止时间: 2003-08-01 至 2005-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0438240&HistoricalAwards=false
• 关键词: Efficient; Computation; Multi; level; Models

EFFICIENT COMPUTATION IN MULTI-LEVEL MODELSIn recent years, a new trend has been growing in applied statistics---it is becoming ever more feasible to build application specific models which are designed to account for the structure inherent in any particular data generation mechanism. Such models have long been advocated on theoretical grounds, but recently the development of new computational tools (e.g., hardware, software, and algorithms) for statistical analysis has begun to bring such model fitting into routine practice. Of course, much work remains to be done. The flexibility of such methods comes at a cost---they require problem specific coding, long computation times, and present difficulties in ascertaining convergence. This proposal aims to tackle some of these difficulties using newly developed efficient Monte Carlo techniques. The PIs plan to study a number of outstanding theoretical questions concerning the behavior and extended application of these efficient methods by developing new algorithms for a number of important models which are prime candidates for these methods. The PIs are involved in several on-going substantive data analytic projects (e.g., in computational biology and high energy astrophysics) which both help to clarify the relevant theoretical questions and stand to benefit from the new methodology. The computational goals of this research are by no means an end unto themselves, but rather a means to improved data analysis and statistical inference. As has been so clearly illustrated in recent years improved computational tools can open up whole new areas of statistical application, as well as increase reliability, thus improving statistical inference.Research will focus on such newly developed Monte Carlo techniques as multi-point Metropolis and the methods of conditional, joint, and marginal data augmentation. Multi-point Metropolis generalizes the Metropolis-Hastings algorithm by allowing multiple dependent proposals at each iteration. As a consequence the multi-point method is more able to jump further, is less likely to be caught in a local mode, and thus can substantially improve mixing. The methods of conditional, joint, and marginal augmentation have already substantially improved performance of the EM and Data Augmentation algorithms in a wide range of models (e.g., mixed-effects models, finite mixture models, multivariate t-models, probit generalized linear models and generalized linear mixed model, Poisson image models, etc.). In particular, these new algorithms maintain the stable convergence properties of EM and DA while sometimes reducing the required computation time by over 99%. These methods, especially in tandem, have the potential to significantly improve and extend Markov Chain Monte Carlo in statistical practice. This program is being jointly funded by theDivision of Mathematical Sciences and Astronomical Sciences and the Office of MultidisciplinaryActivities from the Directorate of Mathematical and Physical Sciences.

在多层次模型中的有效计算近年来，一个新的趋势已经在应用统计学中得到了发展-建立应用程序特定的模型变得越来越可行，这些模型旨在解释任何特定数据生成机制中固有的结构。 这种模型长期以来一直在理论上得到提倡，但最近新的计算工具（例如，用于统计分析的硬件、软件和算法）已经开始将这种模型拟合带入常规实践。 当然，还有许多工作要做。这种方法的灵活性是有代价的-它们需要特定于问题的编码，计算时间长，并且在确定收敛方面存在困难。 这项建议的目的是解决这些困难，使用新开发的高效蒙特卡罗技术。 PI计划通过为这些方法的主要候选者的一些重要模型开发新算法来研究一些关于这些有效方法的行为和扩展应用的突出理论问题。 PI参与了几个正在进行的实质性数据分析项目（例如，在计算生物学和高能天体物理学），这都有助于澄清相关的理论问题，并站在受益于新的方法。 这项研究的计算目标绝不是目的本身，而是一种改进数据分析和统计推断的手段。近年来已经清楚地表明，改进的计算工具可以开辟统计应用的全新领域，并提高可靠性，从而改善统计推断。研究将集中在多点大都会和条件，联合和边缘数据增强方法等新开发的蒙特卡罗技术。 多点大都会通过在每次迭代中允许多个相关提案来推广Metropolis-Hastings算法。因此，多点方法更能够进一步跳跃，不太可能被捕获在局部模式中，并且因此可以显著改善混合。 条件、联合和边缘增强的方法已经在广泛的模型（例如，混合效应模型、有限混合模型、多变量t模型、概率单位广义线性模型和广义线性混合模型、泊松图像模型等）。特别是，这些新算法保持了EM和DA的稳定收敛特性，同时有时减少了99%以上的计算时间。 这些方法，特别是串联，有可能显着改善和扩展马尔可夫链蒙特卡罗在统计实践中。 该计划由数学科学和天文科学部以及数学和物理科学理事会多学科活动办公室共同资助。