非线性贝叶斯动态模型的重要性再抽样(英文)

本文研究了非线性贝叶斯动态模型的随机模拟.在更宽泛的先验分布假设下.利用重要性再抽样的方法,以"样本"代替"分布",实现了对模型的后验推断、预测和模型选择,扩张了贝叶斯动态模型的应用领域.     

中国货币供应过程的异常值和结构突变特征分析

本文对我国不同层次的货币供应动态过程进行建模研究,通过贝叶斯Gibbs抽样方法估计t分布先验设定下动态线性模型参数和状态变量后验均值,以甄别模型中观测和状态过程均可能存在的异常值和结构突变特征。结果表明研究区间内流通中现金M0和狭义货币供应量M1序列均发生结构突变,而广义货币供应量M2受2008年全球金融危机影响也出现异常变动.最后在结构变化的原因分析基础上提出了相关政策建议.     

基于维纳过程步进应力加速退化试验的客观贝叶斯分析

高可靠性产品在加速寿命试验中其失效数据经常比较少,利用步进应力加速退化试验来评估产品寿命分布是一种非常好的方法.本文基于维纳过程的步进应力加速退化试验模型利用客观贝叶斯方法获得了其模型参数的无信息先验(Jefferys先验和Reference先验).并证明了对应的后验分布都是正常的.对于Jefferys先验和Reference先验下的后验提出相应的Gibbs抽样算法.最后,我们模拟对比了客观贝叶斯估计、贝叶斯估计和极大似然估计,模拟结果揭示了客观贝叶斯方法的优良性.     

基于M-H抽样的贝叶斯非对称厚尾GARCH模型研究

针对非对称厚尾GARCH模型参数的预选分布很难确定的问题。对模型参数空间进行数据扩张,把模型中的厚尾残差分布表示成正态分布和逆伽玛分布的混合分布,然后通过对参数的后验条件分布进行变换获得参数的预选分布,从而利用M-H抽样实现了非对称厚尾GARCH模型的贝叶斯分析。中国原油收益率波动的实证研究发现中国原油收益率的波动具有高峰厚尾性但不存在"杠杆效应",样本内的预测评价发现基于M-H抽样的贝叶斯方法优于极大似然方法,说明了M-H抽样方案设计的有效性。     

动态异方差随机前沿模型的Bayesian推断

随机前沿模型中如果忽略单边干扰项的异质性(heterogeneity)往往导致错误的效率估计.从个体特征的影响和方差的时变性两方面对单边干扰项进行考虑,提出异方差动态随机前沿模型.利用Gibbs抽样方法对动态异方差随机前沿模型进行Bayesian分析.导出了模型参数的后验条件分布,对中小样本的模拟实验显示在最小后验均方误差准则下得到的参数估计值非常接近真值.对电力公司的实际数据进行分析显示对数无效率项的方差有一定的时变性.     

两部分混合回归模型的贝叶斯推断

两部分回归模型在刻画半连续型数据的概率发生机制具有重要作用.本文将经典的两部分回归模型推广到两部分有限混合模型,通过假定多条回归直线的混合来解释分布的不齐一性.在贝叶斯框架内,运用马尔可夫链蒙特卡洛(MCMC)方法来进行后验分析.Polya-Gamma先验被用来对logistic模型进行拟合,同时,Stick-breaking先验用于随机权.这些有助于加速后验抽样.本文对可卡因数据展开实证分析.     

治愈率模型在屏蔽数据可靠性分析中的应用研究

针对传统方法中的不足,在引入标准治愈率模型的基础上,提出在屏蔽数据可靠性分析中应用一种扩展的治愈率模型的建模方法;分析证明了利用该方法进行建模分析时仅需对模型作较少的前提假设,在信息不足的情况下能够识别出伴随变量对系统寿命分布的影响,进而有效提高模型估计的稳健性.通过运用基于Gibbs抽样的MCMC方法动态模拟出相关参数后验分布的马尔可夫链,给出随机截尾条件下模型参数的贝叶斯估计;实例分析的结果,证明了该模型在可靠性应用中的直观性与有效性.     

具有稳定分布噪声的多重季节模型的贝叶斯分析

本文研究了具有稳定分布噪声的多重季节时间序列模型的建模及应用.稳定分布能够描述诸如方差无限、厚尾、有偏等非正态特征,但该类分布通常没有解析的密度函数,且参数的后验分布比较复杂.本文采用基于抽样的MCMC方法和切片抽样法估计模型参数,将多重季节模型的回归参数和稳定分布中的参数一起估计.通过模拟分析,说明了稳定分布的一些统计性质和文中建模方法的有效性.将模型应用于一个具有季节性和厚尾特征的实际数据集,演示了该类模型的应用价值.     

有缺失数据的正态母体参数的后验分布及其抽样算法

在缺失数据机制是可忽略的、先验分布是逆矩阵Γ分布的假设下,利用矩阵的cholesky分解和变量替换方法,本文导出了有单调缺失数据结构的正态分布参数的后验分布形式.进-步用后验分布的组成特点,构造了单调缺失数据结构的正态分布的协方差矩阵和均值后验分布的抽样算法.     

多重线性回归模型的贝叶斯预报分析

多重线性回归模型的贝叶斯预报分析是贝叶斯线性模型理论的重要组成部分。通过模型系统的统计结构，证明了矩阵正态-Wishart分布为模型参数的共轭先验分布；利用贝叶斯定理，根据模型的样本似然函数和参数的先验分布推导了参数的后验分布；然后，从数学上严格推断了模型的预报分布密度函数，证明了模型预报分布为矩阵t分布。研究结果表明：由于参数先验分布的作用，样本的预报分布与其原统计分布有着本质性的差异，前服从矩阵正态分布，而后为矩阵t分布。     

Bayesian Estimation of Discrete Multivariate Latent Structure Models With Structural Zeros

In multivariate categorical data, models based on conditional independence assumptions, such as latent class models, offer efficient estimation of complex dependencies. However, Bayesian versions of latent structure models for categorical data typically do not appropriately handle impossible combinations of variables, also known as structural zeros. Allowing nonzero probability for impossible combinations results in inaccurate estimates of joint and conditional probabilities, even for feasible combinations. We present an approach for estimating posterior distributions in Bayesian latent structure models with potentially many structural zeros. The basic idea is to treat the observed data as a truncated sample from an augmented dataset, thereby allowing us to exploit the conditional independence assumptions for computational expediency. As part of the approach, we develop an algorithm for collapsing a large set of structural zero combinations into a much smaller set of disjoint marginal conditions, which speeds up computation. We apply the approach to sample from a semiparametric version of the latent class model with structural zeros in the context of a key issue faced by national statistical agencies seeking to disseminate confidential data to the public: estimating the number of records in a sample that are unique in the population on a set of publicly available categorical variables. The latent class model offers remarkably accurate estimates of population uniqueness, even in the presence of a large number of structural zeros.     

Adaptive Markov Chain Monte Carlo for Bayesian Variable Selection

We describe adaptive Markov chain Monte Carlo (MCMC) methods for sampling posterior distributions arising from Bayesian variable selection problems. Point-mass mixture priors are commonly used in Bayesian variable selection problems in regression. However, for generalized linear and nonlinear models where the conditional densities cannot be obtained directly, the resulting mixture posterior may be difficult to sample using standard MCMC methods due to multimodality. We introduce an adaptive MCMC scheme that automatically tunes the parameters of a family of mixture proposal distributions during simulation. The resulting chain adapts to sample efficiently from multimodal target distributions. For variable selection problems point-mass components are included in the mixture, and the associated weights adapt to approximate marginal posterior variable inclusion probabilities, while the remaining components approximate the posterior over nonzero values. The resulting sampler transitions efficiently between models, performing parameter estimation and variable selection simultaneously. Ergodicity and convergence are guaranteed by limiting the adaptation based on recent theoretical results. The algorithm is demonstrated on a logistic regression model, a sparse kernel regression, and a random field model from statistical biophysics; in each case the adaptive algorithm dramatically outperforms traditional MH algorithms. Supplementary materials for this article are available online.     

用求条件后验密度的方法证明两个矩阵等式

提出了用求条件后验密度的方法证明统计分析中的两个矩阵等式的方法.在证明中,首先引入了一个适当的模型,再用两种技巧求得条件后验均值和方差,经过对照即可得出结果.     

Bayesian analysis of quantile regression for censored dynamic panel data

This paper develops a Bayesian approach to analyzing quantile regression models for censored dynamic panel data. We employ a likelihood-based approach using the asymmetric Laplace error distribution and introduce lagged observed responses into the conditional quantile function. We also deal with the initial conditions problem in dynamic panel data models by introducing correlated random effects into the model. For posterior inference, we propose a Gibbs sampling algorithm based on a location-scale mixture representation of the asymmetric Laplace distribution. It is shown that the mixture representation provides fully tractable conditional posterior densities and considerably simplifies existing estimation procedures for quantile regression models. In addition, we explain how the proposed Gibbs sampler can be utilized for the calculation of marginal likelihood and the modal estimation. Our approach is illustrated with real data on medical expenditures.     

A Predictive Approach to Tail Probability Estimation

One of the issues contributing to the success of any extreme value modeling is the choice of the number of upper order statistics used for inference, or equivalently, the selection of an appropriate threshold. In this paper we propose a Bayesian predictive approach to the peaks over threshold method with the purpose of estimating extreme quantiles beyond the range of the data. In the peaks over threshold (POT) method, we assume that the threshold identifies a model with a specified prior probability, from a set of possible models. For each model, the predictive distribution of a future excess over the corresponding threshold is computed, as well as a conditional estimate for the corresponding tail probability. The unconditional tail probability for a given future extreme observation from the unknown distribution is then obtained as an average of the conditional tail estimates with weights given by the posterior probability of each model.     

Antithetic Methods for Gibbs Samplers

In this article we propose a modification to the output from Metropolis-within-Gibbs samplers that can lead to substantial reductions in the variance over standard estimates. The idea is simple: at each time step of the algorithm, introduce an extra sample into the estimate that is negatively correlated with the current sample, the rationale being that this provides a two-sample numerical approximation to a Rao–Blackwellized estimate. As the conditional sampling distribution at each step has already been constructed, the generation of the antithetic sample often requires negligible computational effort. Our method is implementable whenever one subvector of the state can be sampled from its full conditional and the corresponding distribution function may be inverted, or the full conditional has a symmetric density. We demonstrate our approach in the context of logistic regression and hierarchical Poisson models. The data and computer code used in this article are available online.     

Optimizing random scan Gibbs samplers

The Gibbs sampler is a popular Markov chain Monte Carlo routine for generating random variates from distributions otherwise difficult to sample. A number of implementations are available for running a Gibbs sampler varying in the order through which the full conditional distributions used by the Gibbs sampler are cycled or visited. A common, and in fact the original, implementation is the random scan strategy, whereby the full conditional distributions are updated in a randomly selected order each iteration. In this paper, we introduce a random scan Gibbs sampler which adaptively updates the selection probabilities or “learns” from all previous random variates generated during the Gibbs sampling. In the process, we outline a number of variations on the random scan Gibbs sampler which allows the practitioner many choices for setting the selection probabilities and prove convergence of the induced (Markov) chain to the stationary distribution of interest. Though we emphasize flexibility in user choice and specification of these random scan algorithms, we present a minimax random scan which determines the selection probabilities through decision theoretic considerations on the precision of estimators of interest. We illustrate and apply the results presented by using the adaptive random scan Gibbs sampler developed to sample from multivariate Gaussian target distributions, to automate samplers for posterior simulation under Dirichlet process mixture models, and to fit mixtures of distributions.     

Penalized empirical likelihood estimation of semiparametric models

We propose an empirical likelihood-based estimation method for conditional estimating equations containing unknown functions, which can be applied for various semiparametric models. The proposed method is based on the methods of conditional empirical likelihood and penalization. Thus, our estimator is called the penalized empirical likelihood (PEL) estimator. For the whole parameter including infinite-dimensional unknown functions, we derive the consistency and a convergence rate of the PEL estimator. Furthermore, for the finite-dimensional parametric component, we show the asymptotic normality and efficiency of the PEL estimator. We illustrate the theory by three examples. Simulation results show reasonable finite sample properties of our estimator.     

Partition Weighted Approach For Estimating the Marginal Posterior Density With Applications

The computation of marginal posterior density in Bayesian analysis is essential in that it can provide complete information about parameters of interest. Furthermore, the marginal posterior density can be used for computing Bayes factors, posterior model probabilities, and diagnostic measures. The conditional marginal density estimator (CMDE) is theoretically the best for marginal density estimation but requires the closed-form expression of the conditional posterior density, which is often not available in many applications. We develop the partition weighted marginal density estimator (PWMDE) to realize the CMDE. This unbiased estimator requires only a single Markov chain Monte Carlo output from the joint posterior distribution and the known unnormalized posterior density. The theoretical properties and various applications of the PWMDE are examined in detail. The PWMDE method is also extended to the estimation of conditional posterior densities. We carry out simulation studies to investigate the empirical performance of the PWMDE and further demonstrate the desirable features of the proposed method with two real data sets from a study of dissociative identity disorder patients and a prostate cancer study, respectively. Supplementary materials for this article are available online.     

Independent sampling for Bayesian normal conditional autoregressive models with OpenCL acceleration

A new computational strategy produces independent samples from the joint posterior distribution for a broad class of Bayesian spatial and spatiotemporal conditional autoregressive models. The method is based on reparameterization and marginalization of the posterior distribution and massive parallelization of rejection sampling using graphical processing units (GPUs) or other accelerators. It enables very fast sampling for small to moderate-sized datasets (up to approximately 10,000 observations) and feasible sampling for much larger datasets. Even using a mid-range GPU and a high-end CPU, the GPU-based implementation is up to 30 times faster than the same algorithm run serially on a single CPU, and the numbers of effective samples per second are orders of magnitude higher than those obtained with popular Markov chain Monte Carlo software. The method has been implemented in the R package CARrampsOcl. This work provides both a practical computing strategy for fitting a popular class of Bayesian models and a proof of concept that GPU acceleration can make independent sampling from Bayesian joint posterior densities feasible.