Bias Reduction through First-order Mean Correction, Bootstrapping and Recursive Mean Adjustment

Standard methods of estimation for autoregressive models are known to be biased in finite samples, which has implications for estimation, hypothesis testing, confidence interval construction and forecasting. Three methods of bias reduction are considered here: first-order bias correction, FOBC, where the total bias is approximated by the O(T^-1) bias; bootstrapping; and recursive mean adjustment, RMA. In addition, we show how first-order bias correction is related to linear bias correction. The practically important case where the AR model includes an unknown linear trend is considered in detail. The fidelity of nominal to actual coverage of confidence intervals is also assessed. A simulation study covers the AR(1) model and a number of extensions based on the empirical AR(p) models fitted by Nelson & Plosser (1982). Overall, which method dominates depends on the criterion adopted: bootstrapping tends to be the best at reducing bias, recursive mean adjustment is best at reducing mean squared error, whilst FOBC does particularly well in maintaining the fidelity of confidence intervals.     

Risk of Error and the Kappa Coefficient of a Binary Diagnostic Test in the Presence of Partial Verification

The accuracy of a binary diagnostic test is usually measured in terms of its sensitivity and its specificity, or through positive and negative predictive values. Another way to describe the validity of a binary diagnostic test is the risk of error and the kappa coefficient of the risk of error. The risk of error is the average loss that is caused when incorrectly classifying a non-diseased or a diseased patient, and the kappa coefficient of the risk of error is a measure of the agreement between the diagnostic test and the gold standard. In the presence of partial verification of the disease, the disease status of some patients is unknown, and therefore the evaluation of a diagnostic test cannot be carried out through the traditional method. In this paper, we have deduced the maximum likelihood estimators and variances of the risk of error and of the kappa coefficient of the risk of error in the presence of partial verification of the disease. Simulation experiments have been carried out to study the effect of the verification probabilities on the coverage of the confidence interval of the kappa coefficient.     

Robustness of Parameter Estimation Procedures in Multilevel Models When Random Effects are MEP Distributed

In this paper we examine maximum likelihood estimation procedures in multilevel models for two level nesting structures. Usually, for fixed effects and variance components estimation, level-one error terms and random effects are assumed to be normally distributed. Nevertheless, in some circumstances this assumption might not be realistic, especially as concerns random effects. Thus we assume for random effects the family of multivariate exponential power distributions (MEP); subsequently, by means of Monte Carlo simulation procedures, we study robustness of maximum likelihood estimators under normal assumption when, actually, random effects are MEP distributed.     

Posterior consistency of logistic Gaussian process priors in density estimation

We establish weak and strong posterior consistency of Gaussian process priors studied by Lenk [1988. The logistic normal distribution for Bayesian, nonparametric, predictive densities. J. Amer. Statist. Assoc. 83 (402), 509–516] for density estimation. Weak consistency is related to the support of a Gaussian process in the sup-norm topology which is explicitly identified for many covariance kernels. In fact we show that this support is the space of all continuous functions when the usual covariance kernels are chosen and an appropriate prior is used on the smoothing parameters of the covariance kernel. We then show that a large class of Gaussian process priors achieve weak as well as strong posterior consistency (under some regularity conditions) at true densities that are either continuous or piecewise continuous.     

Estimating the Upper Support Point in Deconvolution

Abstract.  We consider estimation of the upper boundary point F ⁻¹ (1) of a distribution function F with finite upper boundary or 'frontier' in deconvolution problems, primarily focusing on deconvolution models where the noise density is decreasing on the positive halfline. Our estimates are based on the (non-parametric) maximum likelihood estimator (MLE) of F . We show that (1) is asymptotically never too small. If the convolution kernel has bounded support the estimator (1) can generally be expected to be consistent. In this case, we establish a relation between the extreme value index of F and the rate of convergence of (1) to the upper support point for the 'boxcar' deconvolution model. If the convolution density has unbounded support, (1) can be expected to overestimate the upper support point. We define consistent estimators , for appropriately chosen vanishing sequences ( β _n ) and study these in a particular case.     

Consistent deconvolution in density estimation

Suppose we have n observations from X = Y + Z, where Z is a noise component with known distribution, and Y has an unknown density f. When the characteristic function of Z is nonzero almost everywhere, we show that it is possible to construct a density estimate f_n such that for all f, Iim_n| |=0.     

Algorithms Section: Introduction

Electronic Access to Algorithms
Applied Statistics algorithms are available on Statlib at Carnegie Mellon University and on the UK mirror of Statlib at the University of Kent. They may be accessed either via anonymous file transfer protocol (FTP) or by WWW mosaic.     

Minimax-variance L- and R-estimators of location

We consider the problem of minimax-variance, robust estimation of a location parameter, through the use of L- and R-estimators. We derive an easily checked necessary condition for L-estimation to be minimax, and a related sufficient condition for R-estimation to be minimax. Those cases in the literature in which L-estimation is known not to be minimax, and those in which R-estimation is minimax, are derived as consequences of these conditions. New classes of examples are given in each case. As well, we answer a question of Scholz (1974), who showed essentially that the asymptotic variance of an R-estimator never exceeds that of an L-estimator, if both are efficient at the same strongly unimodal distribution. Scholz raised the question of whether or not the assumption of strong unimodality could be dropped. We answer this question in the negative, theoretically and by examples. In the examples, the minimax property fails both for L-estimation and for R-estimation, but the variance of the L-estimator, as the distribution of the observation varies over the given neighbourhood, remains unbounded. That of the R-estimator is unbounded.     

跨文化交际障碍中的行为意识因素

鉴于国内的许多跨文化交际研究主要集中在纯语言的探讨和表层文化的分析上,试图从行为意识的角度出发,就思维定势、偏见意识和价值观念三大因素来分析跨文化交际中存在的障碍,从而使学习者排除跨文化交际的障碍,并从跨文化交流中获得益处。     

任务转换范式下情绪注意偏向

相对于其他信息来说,情绪信息往往会引起情绪障碍患者更多的注意并具有一种认知加工上的优先权。在注意实验中,与中性刺激相比,具有情绪意义的刺激更能吸引注意或占用注意资源从而引起注意偏向。通过转换代价和任务规则一致性效应两个指标阐述了任务转换范式下情绪障碍患者的情绪信息注意偏向加工机制,并指出这两种指标分别代表了个体在注意偏向中的两个不同的认知控制加工,为情绪障碍患者的情绪调节提供必要的依据。文中最后还指出了ERPs、f MRI新技术是未来任务转换范式下研究情绪与注意关系的新方向。