Functional inference in semiparametric models using the piggyback bootstrap

This paper introduces the “piggyback bootstrap.” Like the weighted bootstrap, this bootstrap procedure can be used to generate random draws that approximate the joint sampling distribution of the parametric and nonparametric maximum likelihood estimators in various semiparametric models, but the dimension of the maximization problem for each bootstrapped likelihood is smaller. This reduction results in significant computational savings in comparison to the weighted bootstrap. The procedure can be stated quite simply. First obtain a valid random draw for the parametric component of the model. Then take the draw for the nonparametric component to be the maximizer of the weighted bootstrap likelihood with the parametric component fixed at the parametric draw. We prove the procedure is valid for a class of semiparametric models that includes frailty regression models airsing in survival analysis and biased sampling models that have application to vaccine efficacy trials. Bootstrap confidence sets from the piggyback, and weighted bootstraps are compared for biased sampling data from simulated vaccine efficacy trials.     

Fast simulation of buffer overflows in tandem networks ofGI/GI/1 queues

Simply because of their rarity, the estimation of the statistics of buffer overflows in well-dimensioned queueing networks via direct simulation is extremely costly. One technique that can be used to reduce this cost is importance sampling, and it has been shown previously that large deviations theory can be used in conjunction with importance sampling to minimize the required simulation time. In this paper, we obtain results on the fast simulation of tandem networks of queues, and derive an analytic solution to the problem of finding an optimal simulation system for a class of tandem networks ofGI/GI/1 queues.Work supported by Australian Telecommunications and Electronics Research Board (ATERB). The authors wish to acknowledge the funding of the activities of the Cooperative Research Centre for Robust and Adaptive Systems by the Australian Commonwealth Government under the Cooperative Research Centres Program.     

Quantile estimation under successive sampling

This paper deals with the estimation, under sampling in two successive occasions, of a finite population quantile. For this sampling design a class of estimators is proposed whose the ratio and difference estimators are particular cases. Asymptotic variance formulae are derived for the proposed estimators, and the optimal matching fraction is discussed. Comparisons are made with existing estimators in a simulation study using a natural population.     

n维数据统计信息增益的度量及应用

采样数据的增加究竟有多少相应的有效Fisher信息增益,这是测量数据处理、图像数据融合等应用领域中关心的问题.以(共轭)正态分布为基础,利用统计推断理论,导出一定相关性下样本数据的增加与统计信息(Fisher信息)增益之间的关系,并经一维航天测量数据和二维图像超分辨仿真算例验证.     

Multicanonical recursions

The problem of calculating multicanonical parameters recursively is discussed. I describe in detail a computational implementation which has worked reasonably well in practice.     

一种风险型决策的决策方法

本文阐明了方案益损值和自然状态概率无准确估计的风险型决策问题的决策方法。证明了在期望值决策准则下，用等概率分层随机抽样得到的方案收益期望值的均值，与用简单随机抽样得到的相同。用正交表进行分层随机抽样，得到方案收益期望值服从正态分布的均值和方差。再根据统计推断理论对方案作出选择，并给出决策的风险估计。     

在几种常见的抽样方案下的事后分层

本文给出系统抽样，放回不等概率抽样及二阶不等概率抽样情况下总体均值的事后分层估计，估计量的方差和它的无偏估计。     

Optimal Sequential Sampling Policy of Partitioned Random Search and Its Approximation

The paper studies the optimal sequential sampling policy of the partitioned random search (PRS) and its approximation. The PRS is a recently proposed approach for function optimization. It takes explicitly into consideration computation time or cost, assuming that there exist both a cost for each function evaluation and a finite total computation time constraint. It is also motivated at improving efficiency of the widely used crude random search. In particular, the PRS considers partitioning the search region of an objective function into K subregions and employing an independent and identically distributed random sampling scheme for each of K subregions. A sampling policy decides when to terminate the sampling process or which subregion to be sampled next.     

Stability of pure strategy sampling equilibria

The idea of procedurally rational players was introduced in [4]. Among other procedures, the sampling procedure was proposed. The resulting equilibrium was called a sampling equilibrium. Evolutionary approach to the notion of a sampling equilibrium was developed in [7], where some instability results were proved. Using the concept of first-order stochastic dominance, we introduce the notion of a superior strategy and prove a stability result. The paper was supported by the Polish Government Grant No. KBN 5P03A 025 20. Author wishes to thank an anonymous referee for useful comments and suggestions.     

Admissible Estimation for Finite Population When the Parameter Space is Restricted

This paper considers the admissibility of the estimators for finite population when the parameter space is restricted. We obtain all admissible linear estimators of an arbitrary linear function of characteristic values of a finite population in the class of linear estimators under the criterion of the expectation of mean squared error. Received February 12, 1999, Revised October 8, 1999, Accepted January 14, 2000