Importance resampling for the smoothed bootstrap

Alternative methods of estimating properties of unknown distributions include the bootstrap and the smoothed bootstrap. In the standard bootstrap setting, Johns (1988) introduced an importance resam¬pling procedure that results in more accurate approximation to the bootstrap estimate of a distribution function or a quantile. With a suitable “exponential tilting” similar to that used by Johns, we derived a smoothed version of importance resampling in the framework of the smoothed bootstrap. Smoothed importance resampling procedures were developed for the estimation of distribution functions of the Studentized mean, the Studentized variance, and the correlation coefficient. Implementation of these procedures are presented via simulation results which concentrate on the problem of estimation of distribution functions of the Studentized mean and Studentized variance for different sample sizes and various pre-specified smoothing bandwidths for the normal data; additional simulations were conducted for the estimation of quantiles of the distribution of the Studentized mean under an optimal smoothing bandwidth when the original data were simulated from three different parent populations: lognormal, t(3) and t(10). These results suggest that in cases where it is advantageous to use the smoothed bootstrap rather than the standard bootstrap, the amount of resampling necessary might be substantially reduced by the use of importance resampling methods and the efficiency gains depend on the bandwidth used in the kernel density estimation.     

Data-Based Choice of the Number of Pilot Stages for Plug-in Bandwidth Selection

The choice of the bandwidth is a crucial issue for kernel density estimation. Among all the data-dependent methods for choosing the bandwidth, the direct plug-in method has shown a particularly good performance in practice. This procedure is based on estimating an asymptotic approximation of the optimal bandwidth, using two “pilot” kernel estimation stages. Although two pilot stages seem to be enough for most densities, for a long time the problem of how to choose an appropriate number of stages has remained open. Here we propose an automatic (i.e., data-based) method for choosing the number of stages to be employed in the plug-in bandwidth selector. Asymptotic properties of the method are presented and an extensive simulation study is carried out to compare its small-sample performance with that of the most recommended bandwidth selectors in the literature.     

The estimating function bootstrap

The authors propose a bootstrap procedure which estimates the distribution of an estimating function by resampling its terms using bootstrap techniques. Studentized versions of this so‐called estimating function (EF) bootstrap yield methods which are invariant under reparametrizations. This approach often has substantial advantage, both in computation and accuracy, over more traditional bootstrap methods and it applies to a wide class of practical problems where the data are independent but not necessarily identically distributed. The methods allow for simultaneous estimation of vector parameters and their components. The authors use simulations to compare the EF bootstrap with competing methods in several examples including the common means problem and nonlinear regression. They also prove symptotic results showing that the studentized EF bootstrap yields higher order approximations for the whole vector parameter in a wide class of problems.     

New block bootstrap methods: Sufficient and/or ordered

In this study, we propose sufficient time series bootstrap methods that achieve better results than conventional non-overlapping block bootstrap, but with less computing time and lower standard errors of estimation. Also, we propose using a new technique using ordered bootstrapped blocks, to better preserve the dependency structure of the original data. The performance of the proposed methods are compared in a simulation study for MA(2) and AR(2) processes and in an example. The results show that our methods are good competitors that often exhibit improved performance over the conventional block methods.     

Automatic Block-Length Selection for the Dependent Bootstrap

We review the different block bootstrap methods for time series, and present them in a unified framework. We then revisit a recent result of Lahiri [Lahiri, S. N. (1999b). Theoretical comparisons of block bootstrap methods, Ann. Statist. 27:386-404] comparing the different methods and give a corrected bound on their asymptotic relative efficiency; we also introduce a new notion of finite-sample “attainable” relative efficiency. Finally, based on the notion of spectral estimation via the flat-top lag-windows of Politis and Romano [Politis, D. N., Romano, J. P. (1995). Bias-corrected nonparametric spectral estimation. J. Time Series Anal. 16:67-103], we propose practically useful estimators of the optimal block size for the aforementioned block bootstrap methods. Our estimators are characterized by the fastest possible rate of convergence which is adaptive on the strength of the correlation of the time series as measured by the correlogram.     

Automatic Block-Length Selection for the Dependent Bootstrap

Abstract

We review the different block bootstrap methods for time series, and present them in a unified framework. We then revisit a recent result of Lahiri [Lahiri, S. N. (1999b). Theoretical comparisons of block bootstrap methods, Ann. Statist. 27:386–404] comparing the different methods and give a corrected bound on their asymptotic relative efficiency; we also introduce a new notion of finite-sample “attainable” relative efficiency. Finally, based on the notion of spectral estimation via the flat-top lag-windows of Politis and Romano [Politis, D. N., Romano, J. P. (1995). Bias-corrected nonparametric spectral estimation. J. Time Series Anal. 16:67–103], we propose practically useful estimators of the optimal block size for the aforementioned block bootstrap methods. Our estimators are characterized by the fastest possible rate of convergence which is adaptive on the strength of the correlation of the time series as measured by the correlogram.     

Re-colouring the Intensity-Based Bootstrap for Point Processes

Abstract

A method for obtaining bootstrapping replicates for one-dimensional point processes is presented. The method involves estimating the conditional intensity of the process and computing residuals. The residuals are bootstrapped using a block bootstrap and used, together with the conditional intensity, to define the bootstrap realizations. The method is applied to the estimation of the cross-intensity function for data arising from a reaction time experiment.     

On the relative performance of the block bootstrap for dependent data

In the independent setting, both Efron's bootstrap and “empiricai Edgeworth expansion” (E.E-expansion) give second-order accurate approximations to distributions of standardized and studentized statistics in the smooth function model. As a result, Efron's bootstrap was often regarded as roughly equivalent to the one-term E.E-expansion. However, a more detailed analysis shows that Efron's bootstrap outperforms the E.E-expansion in terms of loss functions by Bhattacharya and Qumsiyeh (1989) and in terms of probabilities for large deviations by Hall (1990) and Jing et a1 (1994). in this paper, we shall study the performances of the block bootstrap and the E.E-expansion for the weakly dependent data. It turns out that similar properties hold:both perform equally well at the center of the distribution but the block bootstrap provides accurate approximations even in the tails of the distributions. The study is focued on the simple case of standardized and studentized sample mean, but the conclusions can be easily extended to the smooth function of multivariate means.     

An Investigation of Quantile Function Estimators Relative to Quantile Confidence Interval Coverage

In this article, we investigate the limitations of traditional quantile function estimators and introduce a new class of quantile function estimators, namely, the semi-parametric tail-extrapolated quantile estimators, which has excellent performance for estimating the extreme tails with finite sample sizes. The smoothed bootstrap and direct density estimation via the characteristic function methods are developed for the estimation of confidence intervals. Through a comprehensive simulation study to compare the confidence interval estimations of various quantile estimators, we discuss the preferred quantile estimator in conjunction with the confidence interval estimation method to use under different circumstances. Data examples are given to illustrate the superiority of the semi-parametric tail-extrapolated quantile estimators. The new class of quantile estimators is obtained by slight modification of traditional quantile estimators, and therefore, should be specifically appealing to researchers in estimating the extreme tails.     

Bias reduction for high quantiles

High quantile estimation is of importance in risk management. For a heavy-tailed distribution, estimating a high quantile is done via estimating the tail index. Reducing the bias in a tail index estimator can be achieved by using either the same order or a larger order of number of the upper order statistics in comparison with the theoretical optimal one in the classical tail index estimator. For the second approach, one can either estimate all parameters simultaneously or estimate the first and second order parameters separately. Recently, the first method and the second method via external estimators for the second order parameter have been applied to reduce the bias in high quantile estimation. Theoretically, the second method obviously gives rise to a smaller order of asymptotic mean squared error than the first one. In this paper we study the second method with simultaneous estimation of all parameters for reducing bias in high quantile estimation.     

Point and block prediction in log-Gaussian random fields: The non-constant mean case

This work considers the problems of point and block prediction in log-Gaussian random fields for the case when the mean of the log-process is not constant and depends linearly on unknown parameters. First, we propose a new point predictor that is optimal within a certain family of predictors, which extend a result in De Oliveira [2006. On optimal point and block prediction in log-Gaussian random fields. Scand. J. Statist. 33, 523–540.] that holds in the case when the mean of the log-process is constant. Second, we show that the results in De Oliveira [2006. On optimal point and block prediction in log-Gaussian random fields. Scand. J. Statist. 33, 523–540.] regarding optimal block prediction cannot be extended to the case when the mean of the log-process is not constant. Specifically, we show that the two families of block predictors considered by De Oliveira lack an optimal predictor. Finally, we numerically compare the predictive efficiency of the proposed point and block predictors.     

Bootstrap in functional linear regression

We have considered the functional linear model with scalar response and functional explanatory variable. One of the most popular methodologies for estimating the model parameter is based on functional principal components analysis (FPCA). In recent literature, weak convergence for a wide class of FPCA-type estimates has been proved, and consequently asymptotic confidence sets can be built. In this paper, we have proposed an alternative approach in order to obtain pointwise confidence intervals by means of a bootstrap procedure, for which we have obtained its asymptotic validity. Besides, a simulation study allows us to compare the practical behaviour of asymptotic and bootstrap confidence intervals in terms of coverage rates for different sample sizes.     

Kernel density estimation on the torus

Kernel density estimation for multivariate, circular data has been formulated only when the sample space is the sphere, but theory for the torus would also be useful. For data lying on a d-dimensional torus (d?1), we discuss kernel estimation of a density, its mixed partial derivatives, and their squared functionals. We introduce a specific class of product kernels whose order is suitably defined in such a way to obtain L₂-risk formulas whose structure can be compared to their Euclidean counterparts. Our kernels are based on circular densities; however, we also discuss smaller bias estimation involving negative kernels which are functions of circular densities. Practical rules for selecting the smoothing degree, based on cross-validation, bootstrap and plug-in ideas are derived. Moreover, we provide specific results on the use of kernels based on the von Mises density. Finally, real-data examples and simulation studies illustrate the findings.     

On Parametric Bootstrapping and Bayesian Prediction

Abstract.  We investigate bootstrapping and Bayesian methods for prediction. The observations and the variable being predicted are distributed according to different distributions. Many important problems can be formulated in this setting. This type of prediction problem appears when we deal with a Poisson process. Regression problems can also be formulated in this setting. First, we show that bootstrap predictive distributions are equivalent to Bayesian predictive distributions in the second-order expansion when some conditions are satisfied. Next, the performance of predictive distributions is compared with that of a plug-in distribution with an estimator. The accuracy of prediction is evaluated by using the Kullback–Leibler divergence. Finally, we give some examples.     

Bias prevention of maximum likelihood estimates for scalar skew normal and skew t distributions

The skew normal model is a class of distributions that extends the Gaussian family by including a shape parameter. Despite its nice properties, this model presents some problems with the estimation of the shape parameter. In particular, for moderate sample sizes, the maximum likelihood estimator is infinite with positive probability. As a solution, we use a modified score function as an estimating equation for the shape parameter. It is proved that the resulting modified maximum likelihood estimator is always finite. For confidence intervals a quasi-likelihood approach is considered. When regression and scale parameters are present, the method is combined with maximum likelihood estimators for these parameters. Finally, also the skew t distribution is considered, which may be viewed as an extension of the skew normal. The same method is applied to this model, considering the degrees of freedom as known.     

Resampling-based bias-corrected time series prediction

In this paper, we consider estimation of the mean squared prediction error (MSPE) of the best linear predictor of (possibly) nonlinear functions of finitely many future observations in a stationary time series. We develop a resampling methodology for estimating the MSPE when the unknown parameters in the best linear predictor are estimated. Further, we propose a bias corrected MSPE estimator based on the bootstrap and establish its second order accuracy. Finite sample properties of the method are investigated through a simulation study.     

Bayesian bootstrap prediction

In this paper, bootstrap prediction is adapted to resolve some problems in small sample datasets. The bootstrap predictive distribution is obtained by applying Breiman's bagging to the plug-in distribution with the maximum likelihood estimator. The effectiveness of bootstrap prediction has previously been shown, but some problems may arise when bootstrap prediction is constructed in small sample datasets. In this paper, Bayesian bootstrap is used to resolve the problems. The effectiveness of Bayesian bootstrap prediction is confirmed by some examples. These days, analysis of small sample data is quite important in various fields. In this paper, some datasets are analyzed in such a situation. For real datasets, it is shown that plug-in prediction and bootstrap prediction provide very poor prediction when the sample size is close to the dimension of parameter while Bayesian bootstrap prediction provides stable prediction.     

Irregularly observed time series – some asymptotics and the block bootstrap

We consider time series being observed at random time points. In addition to Parzen's classical modelling by amplitude modulating sequences, we state another modelling using an integer-valued sequence as the observation times. Limiting results are presented for the sample mean and are generalized to the class of functions of smooth means. Motivated by the complicated limiting behaviour, (moving) block bootstrap possibilities are investigated. Conditional on the used modelling for the irregular spacings, one is lead to different interpretations for the block length and hence bootstrap approaches. The block length either can be interpreted as the time (resulting in an observation string of fixed length containing a random number of observations) or as the number of observations (resulting in an observation string of variable length containing a fixed number of values). Both bootstrap approaches are shown to be asymptotically valid for the sample mean. Numerical examples and an application to real-world ozone data conclude the study.     

Robust small area estimation

Small area estimation has received considerable attention in recent years because of growing demand for small area statistics. Basic area‐level and unit‐level models have been studied in the literature to obtain empirical best linear unbiased prediction (EBLUP) estimators of small area means. Although this classical method is useful for estimating the small area means efficiently under normality assumptions, it can be highly influenced by the presence of outliers in the data. In this article, the authors investigate the robustness properties of the classical estimators and propose a resistant method for small area estimation, which is useful for downweighting any influential observations in the data when estimating the model parameters. To estimate the mean squared errors of the robust estimators of small area means, a parametric bootstrap method is adopted here, which is applicable to models with block diagonal covariance structures. Simulations are carried out to study the behaviour of the proposed robust estimators in the presence of outliers, and these estimators are also compared to the EBLUP estimators. Performance of the bootstrap mean squared error estimator is also investigated in the simulation study. The proposed robust method is also applied to some real data to estimate crop areas for counties in Iowa, using farm‐interview data on crop areas and LANDSAT satellite data as auxiliary information. The Canadian Journal of Statistics 37: 381–399; 2009 © 2009 Statistical Society of Canada     

Iterated Bootstrap-t Confidence Intervals for Density Functions

Abstract.  Conventional bootstrap- t intervals for density functions based on kernel density estimators exhibit poor coverages due to failure of the bootstrap to estimate the bias correctly. The problem can be resolved by either estimating the bias explicitly or undersmoothing the kernel density estimate to undermine its bias asymptotically. The resulting bias-corrected intervals have an optimal coverage error of order arbitrarily close to second order for a sufficiently smooth density function. We investigated the effects on coverage error of both bias-corrected intervals when the nominal coverage level is calibrated by the iterated bootstrap. In either case, an asymptotic reduction of coverage error is possible provided that the bias terms are handled using an extra round of smoothed bootstrapping. Under appropriate smoothness conditions, the optimal coverage error of the iterated bootstrap- t intervals has order arbitrarily close to third order. Examples of both simulated and real data are reported to illustrate the iterated bootstrap procedures.