The use of Smooth Bootstrap Techniques for Estimating the Error Rate of a Prediction Rule

In this paper we present a simulation study for comparing differents methods for estimating the prediction error rate in a discrimination problem. We consider the Cross-validation, Bootstrap and Bayesian Bootstrap methods for such as problem, while also elaborating on both simple and Bayesian Bootstrap methods by smoothing techniques. We observe as the smoothing procedure lead to improvements in the estimation of the true error rate of the discrimination rule, specially in the case of the smooth Bayesian Bootstrap estimator, whose reduction in M.S.E. resulted from the high positive correlation between the true error rate and its estimations based in this method.     

A Monte Carlo comparison of three consistent bootstrap procedures

Since bootstrap samples are simple random samples with replacement from the original sample, the information content of some bootstrap samples can be very low. To avoid this fact, several variants of the classical bootstrap have been proposed. In this paper, we consider two of them: the sequential or Poisson bootstrap and the reduced bootstrap. Both of these, like the ordinary bootstrap, can yield second-order accurate distribution estimators, that is, the three bootstrap procedures are asymptotically equivalent. The question that naturally arises is which of them should be used in a practical situation, in other words, which of them should be used for finite sample sizes. To try to answer this question, we have carried out a simulation study. Although no method was found to exhibit best performance in all the considered situations, some recommendations are given.     

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.     

The Wild Bootstrap for Multilevel Models

In this paper, we study the performance of the most popular bootstrap schemes for multilevel data. Also, we propose a modified version of the wild bootstrap procedure for hierarchical data structures. The wild bootstrap does not require homoscedasticity or assumptions on the distribution of the error processes. Hence, it is a valuable tool for robust inference in a multilevel framework. We assess the finite size performances of the schemes through a Monte Carlo study. The results show that for big sample sizes it always pays off to adopt an agnostic approach as the wild bootstrap outperforms other techniques.     

Bootstrap-based bias corrections for INAR count time series

Integer-valued autoregressive (INAR) processes form a very useful class of processes suitable to model time series of counts. Several practically relevant estimators based on INAR data are known to be systematically biased away from their population values, e.g. sample autocovariances, sample autocorrelations, or the dispersion index. We propose to do bias correction for such estimators by using a recently proposed INAR-type bootstrap scheme that is tailor-made for INAR processes, and which has been proven to be asymptotically consistent under general conditions. This INAR bootstrap allows an implementation with and without parametrically specifying the innovations' distribution. To judge the potential of corresponding bias correction, we compare these bootstraps in simulations to several competitors that include the AR bootstrap and block bootstrap. Finally, we conclude with an illustrative data application.     

Bootstrap-assisted tests of symmetry for dependent data*

The paper considers the problem of testing for symmetry (about an unknown centre) of the marginal distribution of a strictly stationary and weakly dependent stochastic process. The possibility of using the autoregressive sieve bootstrap and stationary bootstrap procedures to obtain critical values and P-values for symmetry tests is explored. Bootstrap-assisted tests for symmetry are straightforward to implement and require no prior estimation of asymptotic variances. The small-sample properties of a wide variety of tests are investigated using Monte Carlo experiments. A bootstrap-assisted version of the triples test is found to have the best overall performance.     

Robustness of residual-based bootstrap to the composition of serially correlated errors

In a simple autoregressive model with serially correlated errors, we evaluate size distortions resulting from the residual bootstrap when the Wold innovation is serially dependent and hence is expected to contaminate the inference. The small distortions caused by the presence of strong conditional heteroskedasticity or other nonlinearities can be partly removed further by using the wild bootstrap.     

Diagnostics for the bootstrap and fast double bootstrap

ABSTRACT

The bootstrap is typically less reliable in the context of time-series models with serial correlation of unknown form than when regularity conditions for the conventional IID bootstrap apply. It is, therefore, useful to have diagnostic techniques capable of evaluating bootstrap performance in specific cases. Those suggested in this paper are closely related to the fast double bootstrap (FDB) and are not computationally intensive. They can also be used to gauge the performance of the FDB itself. Examples of bootstrapping time series are presented, which illustrate the diagnostic procedures, and show how the results can cast light on bootstrap performance.     

Non-parametric bootstrap recycling

The double bootstrap provides diagnostics for bootstrap calculations and, if need be, appropriate adjustments. The amount of computation involved is usually considerable, and recycling provides a less computer intensive alternative. Recycling consists of using repeatedly the same samples drawn from a recycling distribution G for estimation under each first-level bootstrap distribution, rather than independently repeating the simulation and estimation steps for each of these.Recycling is successful in parametric applications of the bootstrap, as demonstrated by M.A. Newton and C.J. Geyer (J. Amer. Statist. Assoc. 89: 905–912, 1994). We show that it is bound to fail in non-parametric bootstrap applications, and suggest a modification that makes the method work. The modification consists of smoothing the first-level bootstrap distributions, with the desired consequence that this removes the zero probabilities in the multinomial distributions that define them. We also discuss efficient choices of recycling distributions, both in terms of estimator efficiency and simulation efficiency.     

Goodness of fit tests with interval censored data

Cramér–von Mises type goodness of fit tests for interval censored data case 2 are proposed based on a resampling method called the leveraged bootstrap, and their asymptotic consistency is shown. The proposed tests are computationally efficient, and in fact can be applied to other types of censored data, including right censored data, doubly censored data and (mixture of) case k interval censored data. Some simulation results and an example from AIDS research are presented.     

Valid Resampling of Higher-Order Statistics Using the Linear Process Bootstrap and Autoregressive Sieve Bootstrap

We show that the linear process bootstrap (LPB) and the autoregressive sieve bootstrap (AR sieve) are, in general, not valid for statistics whose large-sample distribution depends on moments of order higher than two, irrespective of whether the data come from a linear time series or not. Inspired by the block-of-blocks bootstrap, we circumvent this non-validity by applying the LPB and AR sieve to suitably blocked data and not to the original data itself. In a simulation study, we compare the LPB, AR sieve, and moving block bootstrap applied directly and to blocked data.     

LASSO order selection for sparse autoregression: a bootstrap approach

Autoregressive models are widely employed for predictions and other inferences in many scientific fields. While the determination of their order is in general a difficult and critical step, this task becomes more complicated and crucial when the time series under investigation is realization of a stochastic process characterized by sparsity. In this paper we present a method for order determination of a stationary AR model with a sparse structure, given a set of observations, based upon a bootstrapped version of MAICE procedure [Akaike H. Prediction and entropy. Springer; 1998], in conjunction with a LASSO-type constraining procedure for lag suppression of insignificant lags. Empirical results will be obtained via Monte Carlo simulations. The quality of our method is assessed by comparison with the commonly adopted cross-validation approach and the non bootstrap counterpart of the presented procedure.     

Estimation of the variance of an adaptive estimator by bootstrapping

In this paper we propose a bootstrap-based method to estimate the standard error of adaptive estimators. We apply it in the standard problem of location estimation discussed in Randies and Hogg (1973) and in Hogg and Lenth (1984). Our adaptive estimator is based on a choice between the mean the 35% trimmed mean and the median. Finally, we carry out a simulation study to see how well the proposed method performs in small and moderate sample sizes.     

Consistency of the Subsample Bootstrap empirical process

In the classical Bootstrap approach the number of distinct observation in the resample is random. To overcome this hitch Rao et al. [Bootstrap by sequential resampling, J. Statist. Plan. Inference 64 (1997), pp. 257–281] have proposed a modified resampling procedure – the so-called Sequential Bootstrap or 0.632-Bootstrap – in which each resample has exactly the same number m ～eq ?0.632 n? of distinct observations. Motivated by this idea we introduce an akin procedure, the Subsample Bootstrap, where additionally even the size of each resample is equal. It will turn out that the Subsample Bootstrap empirical process is consistent for a wide class of Donsker classes.     

Distributed inference for two-sample U-statistics in massive data analysis

This paper considers distributed inference for two-sample U-statistics under the massive data setting. In order to reduce the computational complexity, this paper proposes distributed two-sample U-statistics and blockwise linear two-sample U-statistics. The blockwise linear two-sample U-statistic, which requires less communication cost, is more computationally efficient especially when the data are stored in different locations. The asymptotic properties of both types of distributed two-sample U-statistics are established. In addition, this paper proposes bootstrap algorithms to approximate the distributions of distributed two-sample U-statistics and blockwise linear two-sample U-statistics for both nondegenerate and degenerate cases. The distributed weighted bootstrap for the distributed two-sample U-statistic is new in the literature. The proposed bootstrap procedures are computationally efficient and are suitable for distributed computing platforms with theoretical guarantees. Extensive numerical studies illustrate that the proposed distributed approaches are feasible and effective.     

On a class of m out of n bootstrap confidence intervals

It is widely known that bootstrap failure can often be remedied by using a technique known as the ' m out of n ' bootstrap, by which a smaller number, m say, of observations are resampled from the original sample of size n . In successful cases of the bootstrap, the m out of n bootstrap is often deemed unnecessary. We show that the problem of constructing nonparametric confidence intervals is an exceptional case. By considering a new class of m out of n bootstrap confidence limits, we develop a computationally efficient approach based on the double bootstrap to construct the optimal m out of n bootstrap intervals. We show that the optimal intervals have a coverage accuracy which is comparable with that of the classical double-bootstrap intervals, and we conduct a simulation study to examine their performance. The results are in general very encouraging. Alternative approaches which yield even higher order accuracy are also discussed.     

Robust bootstrap forecast densities for GARCH returns and volatilities

Bootstrap procedures are useful to obtain forecast densities for both returns and volatilities in the context of generalized autoregressive conditional heteroscedasticity models. In this paper, we analyse the effect of additive outliers on the finite sample properties of these bootstrap densities and show that, when obtained using maximum likelihood estimates of the parameters and standard filters for the volatilities, they are badly affected with dramatic consequences on the estimation of Value-at-Risk. We propose constructing bootstrap densities for returns and volatilities using a robust parameter estimator based on variance targeting implemented together with an adequate modification of the volatility filter. We show that the performance of the proposed procedure is adequate when compared with available robust alternatives. The results are illustrated with both simulated and real data.     

Sufficient m-out-of-n (m/n) bootstrap

Traditional resampling methods for estimating sampling distributions sometimes fail, and alternative approaches are then needed. For example, if the classical central limit theorem does not hold and the naïve bootstrap fails, the m/n bootstrap, based on smaller-sized resamples, may be used as an alternative. An alternative to the naïve bootstrap, the sufficient bootstrap, which uses only the distinct observations in a bootstrap sample, is another recently proposed bootstrap approach that has been suggested to reduce the computational burden associated with bootstrapping. It works as long as naïve bootstrap does. However, if the naïve bootstrap fails, so will the sufficient bootstrap. In this paper, we propose combining the sufficient bootstrap with the m/n bootstrap in order to both regain consistent estimation of sampling distributions and to reduce the computational burden of the bootstrap. We obtain necessary and sufficient conditions for asymptotic normality of the proposed method, and propose new values for the resample size m. We compare the proposed method with the naïve bootstrap, the sufficient bootstrap, and the m/n bootstrap by simulation.     

A recentred bootstrap procedure for constructing uniformly correct confidence sets under smooth function models

It has been found, under a smooth function model setting, that the n out of n bootstrap is inconsistent at stationary points of the smooth function, but that the m out of n bootstrap is consistent, provided that a correct convergence rate is specified of the plug-in smooth function estimator. By considering a more general moving-parameter framework, we show that neither of the above bootstrap methods is consistent uniformly over neighbourhoods of stationary points, so that anomalies often arise of coverages of bootstrap sets over certain subsets of parameter values. We propose a recentred bootstrap procedure for constructing confidence sets with uniformly correct coverages over compact sets containing stationary points. A weighted bootstrap procedure is also proposed as an alternative under more general circumstances. Unlike the m out of n bootstrap, both procedures do not require knowledge of the convergence rate of the smooth function estimator. Empirical performance of our procedures is illustrated with numerical examples.