Improving Convergence of the HastingsMetropolis Algorithm with an Adaptive Proposal

The HastingsMetropolis algorithm is a general MCMC method for sampling from a density known up to a constant. Geometric convergence of this algorithm has been proved under conditions relative to the instrumental (or proposal) distribution. We present an inhomogeneous HastingsMetropolis algorithm for which the proposal density approximates the target density, as the number of iterations increases. The proposal density at the n th step is a non-parametric estimate of the density of the algorithm, and uses an increasing number of i.i.d. copies of the Markov chain. The resulting algorithm converges (in n ) geometrically faster than a HastingsMetropolis algorithm with any fixed proposal distribution. The case of a strictly positive density with compact support is presented first, then an extension to more general densities is given. We conclude by proposing a practical way of implementation for the algorithm, and illustrate it over simulated examples.     

基于贝叶斯神经网络的非参数回归

提高神经网络模型推广能力的关键是控制模型的复杂度。该文探索了贝叶斯神经网络的非参数回归的建模方法,通过融入模型参数的先验知识,在给定数据样本及模型假设下进行后验概率的贝叶斯推理,使用马尔可夫链蒙特卡罗算法来优化模型控制参数,实现了对神经网络模型中不同部分复杂度的控制,获得了模型参数的后验分布及预测分布。在5个含噪二维函数回归问题上的应用显示了模型的复杂度能根据数据的复杂度而自适应调整,并给出了较好的预测结果。     

基于马尔可夫链的产品市场保有量预测模型

售后服务机构为了准确地准备库存,都需要预测产品的市场保有量。基于马尔可夫链建立的状态概率矩阵模型,与抽样调查、时间序列法、回归分析法等方法相比,更能准确预测市场产品保有量。与传统产品相比较,更新换代速度快的电子产品,要预测其市场保有量,更需要利用状态概率矩阵模型。     

Estimating rating transition probabilites with missing data

In this article we provide a rigorous treatment of one of the central statistical issues of credit risk management. GivenK-1 rating categories, the rating of a corporate bond over a certain horizon may either stay the same or change to one of the remainingK-2 categories; in addition, it is usually the case that the rating of some bonds is withdrawn during the time interval considered in the analysis. When estimating transition probabilities, we have thus to consider aK-th category, called withdrawal, which contains (partially) missing data. We show how maximum likelihood estimation can be performed in this setup; whereas in discrete time our solution gives rigorous support to a solution often used in applications, in continuous time the maximum likelihood estimator of the transition matrix computed by means of the EM algorithm represents a significant improvement over existing methods.     

On Block Updating in Markov Random Field Models for Disease Mapping

Gaussian Markov random field (GMRF) models are commonly used to model spatial correlation in disease mapping applications. For Bayesian inference by MCMC, so far mainly single-site updating algorithms have been considered. However, convergence and mixing properties of such algorithms can be extremely poor due to strong dependencies of parameters in the posterior distribution. In this paper, we propose various block sampling algorithms in order to improve the MCMC performance. The methodology is rather general, allows for non-standard full conditionals, and can be applied in a modular fashion in a large number of different scenarios. For illustration we consider three different applications: two formulations for spatial modelling of a single disease (with and without additional unstructured parameters respectively), and one formulation for the joint analysis of two diseases. The results indicate that the largest benefits are obtained if parameters and the corresponding hyperparameter are updated jointly in one large block. Implementation of such block algorithms is relatively easy using methods for fast sampling of Gaussian Markov random fields ( Rue, 2001 ). By comparison, Monte Carlo estimates based on single-site updating can be rather misleading, even for very long runs. Our results may have wider relevance for efficient MCMC simulation in hierarchical models with Markov random field components.     

供应链管理中的信息流网络

本文对供应链管理中的信息流理论进行了探讨 ,指出了传统链式信息流模式的缺陷 ,分析了简单的网络式信息流模型的构造 ;阐述了信息流网络的特征与优势 ;对若干有待深入研究的问题进行了展望。     

供应链企业间的合作轨道模型

文章主要介绍了轨道模型在供应链企业合作中的应用 ,根据合作程度的不同 ,伙伴企业处于以核心企业为中心的不同轨道。文章分别从静态和动态的角度运用轨道模型分析了企业间合作关系以及这种合作关系的变化。一方面使企业间的合作问题简单化 ;另一方面 ,轨道模型便于对合作问题进行深入的定量化研究。     

基于需求不确定性的供应链库存控制研究

通过建立需求不确定性环境下供应链成员的独立存货成本模型,运用模拟退火法对该模型进行52周的仿真,求解存货最佳订购数量与最佳再订购点,从而比较出不同存货控制策略的供应链存货总成本及订单满足率的差异。     

Bayesian analysis of directed graphs data with applications to social networks

Summary.  A fully Bayesian analysis of directed graphs, with particular emphasis on applica- tions in social networks, is explored. The model is capable of incorporating the effects of covariates, within and between block ties and multiple responses. Inference is straightforward by using software that is based on Markov chain Monte Carlo methods. Examples are provided which highlight the variety of data sets that can be entertained and the ease with which they can be analysed.     

逆向物流及其整合分析

逆向物流是物流管理的一个新的领域,已经引起理论界和企业界越来越多的关注。逆向物流可以降低企业成本,提高顾客满意度,并最终提升企业的竞争力,这对我国企业实践具有重要意义。