On variable bandwidth selection in local polynomial regression

The performances of data-driven bandwidth selection procedures in local polynomial regression are investigated by using asymptotic methods and simulation. The bandwidth selection procedures considered are based on minimizing 'prelimit' approximations to the (conditional) mean-squared error (MSE) when the MSE is considered as a function of the bandwidth h . We first consider approximations to the MSE that are based on Taylor expansions around h=0 of the bias part of the MSE. These approximations lead to estimators of the MSE that are accurate only for small bandwidths h . We also consider a bias estimator which instead of using small h approximations to bias naïvely estimates bias as the difference of two local polynomial estimators of different order and we show that this estimator performs well only for moderate to large h . We next define a hybrid bias estimator which equals the Taylor-expansion-based estimator for small h and the difference estimator for moderate to large h . We find that the MSE estimator based on this hybrid bias estimator leads to a bandwidth selection procedure with good asymptotic and, for our Monte Carlo examples, finite sample properties.     

An Adaptive Two-stage Estimation Method for Additive Models

Abstract.  In this paper, a two-stage estimation method for non-parametric additive models is investigated. Differing from Horowitz and Mammen's two-stage estimation, our first-stage estimators are designed not only for dimension reduction but also as initial approximations to all of the additive components. The second-stage estimators are obtained by using one-dimensional non-parametric techniques to refine the first-stage ones. From this procedure, we can reveal a relationship between the regression function spaces and convergence rate, and then provide estimators that are optimal in the sense that, better than the usual one-dimensional mean-squared error (MSE) of the order n ^−4/5 , the MSE of the order n ^{− 1} can be achieved when the underlying models are actually parametric. This shows that our estimation procedure is adaptive in a certain sense. Also it is proved that the bandwidth that is selected by cross-validation depends only on one-dimensional kernel estimation and maintains the asymptotic optimality. Simulation studies show that the new estimators of the regression function and all components outperform the existing estimators, and their behaviours are often similar to that of the oracle estimator.     

Simple Transformation Techniques for Improved Non-parametric Regression

We propose and investigate two new methods for achieving less bias in non- parametric regression. We show that the new methods have bias of order h ⁴, where h is a smoothing parameter, in contrast to the basic kernel estimator's order h ². The methods are conceptually very simple. At the first stage, perform an ordinary non-parametric regression on { x_i , Y_i } to obtain m^ ( x_i ) (we use local linear fitting). In the first method, at the second stage, repeat the non-parametric regression but on the transformed dataset { m^ ( x_i , Y_i )}, taking the estimator at x to be this second stage estimator at m^ ( x ). In the second, and more appealing, method, again perform non-parametric regression on { m^ ( x_i , Y_i )}, but this time make the kernel weights depend on the original x scale rather than using the m^ ( x ) scale. We concentrate more of our effort in this paper on the latter because of its advantages over the former. Our emphasis is largely theoretical, but we also show that the latter method has practical potential through some simulated examples.     

Parametric models for response-biased sampling

Suppose that subjects in a population follow the model f   ( y ^* x ^*; ) where y ^* denotes a response, x ^* denotes a vector of covariates and is the parameter to be estimated. We consider response-biased sampling, in which a subject is observed with a probability which is a function of its response. Such response-biased sampling frequently occurs in econometrics, epidemiology and survey sampling. The semiparametric maximum likelihood estimate of is derived, along with its asymptotic normality, efficiency and variance estimates. The estimate proposed can be used as a maximum partial likelihood estimate in stratified response-selective sampling. Some computation algorithms are also provided.     

Nonparametric multistep-ahead prediction in time series analysis

Summary.  We consider the problem of multistep-ahead prediction in time series analysis by using nonparametric smoothing techniques. Forecasting is always one of the main objectives in time series analysis. Research has shown that non-linear time series models have certain advantages in multistep-ahead forecasting. Traditionally, nonparametric k -step-ahead least squares prediction for non-linear autoregressive AR( d ) models is done by estimating E ( X _{t + k}  | X _t , …,  X _{t − d +1}) via nonparametric smoothing of X _{t + k} on ( X _t , …,  X _{t − d +1}) directly. We propose a multistage nonparametric predictor. We show that the new predictor has smaller asymptotic mean-squared error than the direct smoother, though the convergence rate is the same. Hence, the predictor proposed is more efficient. Some simulation results, advice for practical bandwidth selection and a real data example are provided.     

Local linear variable bandwidth hazard rate estimation

A new hazard rate estimator under the random right censorship model is proposed in this article. The estimator arises naturally as a combination of the local linear fitting and variable bandwidth methods. As a consequence, it also inherits the benefits of both approaches. The asymptotic properties of the estimate in the boundary and in the interior of the region of estimation are provided and its asymptotic distribution is established. In addition, an automatic data-driven bandwidth selection procedure is proposed and evaluated via Monte Carlo simulations. Further numerical studies compare the performance of the proposed estimate with that of estimates with similar asymptotic properties.     

Non-parametric Regression with Dependent Censored Data

Abstract.  Let ( X _i , Y _i ) ( i = 1 ,…, n ) be n replications of a random vector ( X , Y  ), where Y is supposed to be subject to random right censoring. The data ( X _i , Y _i ) are assumed to come from a stationary α -mixing process. We consider the problem of estimating the function m ( x ) = E ( φ ( Y ) |  X = x ), for some known transformation φ . This problem is approached in the following way: first, we introduce a transformed variable     , that is not subject to censoring and satisfies the relation     , and then we estimate m ( x ) by applying local linear regression techniques. As a by-product, we obtain a general result on the uniform rate of convergence of kernel type estimators of functionals of an unknown distribution function, under strong mixing assumptions.     

Relative error prediction via kernel regression smoothers

In this article, we introduce and study local constant and local linear nonparametric regression estimators when it is appropriate to assess performance in terms of mean squared relative error of prediction. We give asymptotic results for both boundary and non-boundary cases. These are special cases of more general asymptotic results that we provide concerning the estimation of the ratio of conditional expectations of two functions of the response variable. We also provide a good bandwidth selection method for the estimators. Examples of application, limited simulation results and discussion of related problems and approaches are also given.     

Matching estimators and optimal bandwidth choice

Optimal bandwidth choice for matching estimators and their finite sample properties are examined. An approximation to their MSE is derived, as a basis for a plug-in bandwidth selector. In small samples, this approximation is not very accurate, though. Alternatively, conventional cross-validation bandwidth selection is considered and performs rather well in simulation studies: Compared to standard pair-matching, kernel and ridge matching achieve reductions in MSE of about 25 to 40%. Local linear matching and weighting perform poorly. Furthermore, the scope for developing better bandwidth selectors seems to be limited for ridge matching, but non-negligible for kernel and local linear matching.     

Plug-in bandwidth choice for estimation of nonparametric part in partial linear regression models with strong mixing errors

Consider a regression model where the regression function is the sum of a linear and a nonparametric component. Assuming that the errors of the model follow a stationary strong mixing process with mean zero, the problem of bandwidth selection for a kernel estimator of the nonparametric component is addressed here. We obtain an asymptotic expression for an optimal band-width and we propose to use a plug-in methodology in order to estimate this bandwidth through preliminary estimates of the unknown quantities. Asymptotic optimality for the plug-in bandwidth is established.     

Testing Hypotheses in the Functional Linear Model

The functional linear model with scalar response is a regression model where the predictor is a random function defined on some compact set of R and the response is scalar. The response is modelled as Y =Ψ( X )+ ɛ , where Ψ is some linear continuous operator defined on the space of square integrable functions and valued in R . The random input X is independent from the noise ɛ . In this paper, we are interested in testing the null hypothesis of no effect, that is, the nullity of Ψ restricted to the Hilbert space generated by the random variable X . We introduce two test statistics based on the norm of the empirical cross-covariance operator of ( X , Y ). The first test statistic relies on a χ ² approximation and we show the asymptotic normality of the second one under appropriate conditions on the covariance operator of X . The test procedures can be applied to check a given relationship between X and Y . The method is illustrated through a simulation study.     

Local Smoothing Using the Bootstrap

We consider the problem of data-based choice of the bandwidth of a kernel density estimator, with an aim to estimate the density optimally at a given design point. The existing local bandwidth selectors seem to be quite sensitive to the underlying density and location of the design point. For instance, some bandwidth selectors perform poorly while estimating a density, with bounded support, at the median. Others struggle to estimate a density in the tail region or at the trough between the two modes of a multimodal density. We propose a scale invariant bandwidth selection method such that the resulting density estimator performs reliably irrespective of the density or the design point. We choose bandwidth by minimizing a bootstrap estimate of the mean squared error (MSE) of a density estimator. Our bootstrap MSE estimator is different in the sense that we estimate the variance and squared bias components separately. We provide insight into the asymptotic accuracy of the proposed density estimator.     

Variance function estimation of a one-dimensional nonstationary process

We propose a flexible nonparametric estimation of a variance function from a one-dimensional process where the process errors are nonstationary and correlated. Due to nonstationarity a local variogram is defined, and its asymptotic properties are derived. We include a bandwidth selection method for smoothing taking into account the correlations in the errors. We compare the proposed difference-based nonparametric approach with Anderes and Stein(2011)’s local-likelihood approach. Our method has a smaller integrated MSE, easily fixes the boundary bias, and requires far less computing time than the likelihood-based method.     

Kernel Smoothing to Improve Bootstrap Confidence Intervals

Some studies of the bootstrap have assessed the effect of smoothing the estimated distribution that is resampled, a process usually known as the smoothed bootstrap. Generally, the smoothed distribution for resampling is a kernel estimate and is often rescaled to retain certain characteristics of the empirical distribution. Typically the effect of such smoothing has been measured in terms of the mean-squared error of bootstrap point estimates. The reports of these previous investigations have not been encouraging about the efficacy of smoothing. In this paper the effect of resampling a kernel-smoothed distribution is evaluated through expansions for the coverage of bootstrap percentile confidence intervals. It is shown that, under the smooth function model, proper bandwidth selection can accomplish a first-order correction for the one-sided percentile method. With the objective of reducing the coverage error the appropriate bandwidth for one-sided intervals converges at a rate of n ^−1/4, rather than the familiar n ^−1/5 for kernel density estimation. Applications of this same approach to bootstrap t and two-sided intervals yield optimal bandwidths of order n ^−1/2. These bandwidths depend on moments of the smooth function model and not on derivatives of the underlying density of the data. The relationship of this smoothing method to both the accelerated bias correction and the bootstrap t methods provides some insight into the connections between three quite distinct approximate confidence intervals.     

Robust plug-in bandwidth estimators in nonparametric regression

In this paper, we propose a robust bandwidth selection method for local M-estimates used in nonparametric regression. We study the asymptotic behavior of the resulting estimates. We use the results of a Monte Carlo study to compare the performance of various competitors for moderate samples sizes. It appears that the robust plug-in bandwidth selector we propose compares favorably to its competitors, despite the need to select a pilot bandwidth. The Monte Carlo study shows that the robust plug-in bandwidth selector is very stable and relatively insensitive to the choice of the pilot.     

Local regression when the responses are Interval-Censored

Conditional expectation imputation and local-likelihood methods are contrasted with a midpoint imputation method for bivariate regression involving interval-censored responses. Although the methods can be extended in principle to higher order polynomials, our focus is on the local constant case. Comparisons are based on simulations of data scattered about three target functions with normally distributed errors. Two censoring mechanisms are considered: the first is analogous to current-status data in which monitoring times occur according to a homogeneous Poisson process; the second is analogous to a coarsening mechanism such as would arise when the response values are binned. We find that, according to a pointwise MSE criterion, no method dominates any other when interval sizes are fixed, but when the intervals have a variable width, the local-likelihood method often performs better than the other methods, and midpoint imputation performs the worst. Several illustrative examples are presented.     

On Smooth Statistical Tail Functionals

Many estimators of the extreme value index of a distribution function F that are based on a certain number k _n of largest order statistics can be represented as a statistical tail function al, that is a functional T applied to the empirical tail quantile function Q _n. We study the asymptotic behaviour of such estimators with a scale and location invariant functional T under weak second order conditions on F . For that purpose first a new approximation of the empirical tail quantile function is established. As a consequence we obtain weak consistency and asymptotic normality of T ( Q _n) if T is continuous and Hadamard differentiable, respectively, at the upper quantile function of a generalized Pareto distribution and k _pn tends to infinity sufficiently slowly. Then we investigate the asymptotic variance and bias. In particular, those functionals T re characterized that lead to an estimator with minimal asymptotic variance. Finally, we introduce a method to construct estimators of the extreme value index with a made-to-order asymptotic behaviour     

On Variance-Stabilizing Multivariate Non Parametric Regression Estimation

The mean squared error (MSE)-minimizing local variable bandwidth for the univariate local linear estimator (the LL) is well-known. This bandwidth does not stabilize variance over the domain. Moreover, in regions where a regression function has zero curvature, the LL estimator is discontinuous. In this paper, we propose a variance-stabilizing (VS) local variable diagonal bandwidth matrix for the multivariate LL estimator. Theoretically, the VS bandwidth can outperform the multivariate extension of the MSE-minimizing local variable scalar bandwidth in terms of asymptotic mean integrated squared error and can avoid discontinuity created by the MSE-minimizing bandwidth. We present an algorithm for estimating the VS bandwidth and simulation studies.     

Tail Exactness of Multivariate Saddlepoint Approximations

We consider a log-concave density f in R ^m satisfying certain weak conditions, particularly on the Hessian matrix of log f . For such a density, we prove tail exactness of the multivariate saddlepoint approximation. The proof is based on a local limit theorem for the exponential family generated by f . However, the result refers not to asymptotic behaviour under repeated sampling, but to a limiting property at the boundary of the domain of f . Our approach does not apply any complex analysis, but relies totally on convex analysis and exponential models arguments.     

An Adaptive Efficient Test for Gumbel Domain of Attraction

We consider n independent observations, generated identically by some distribution function, which belongs to the domain of attraction of an extreme value distribution with unknown shape and scale parameter. We treat the scale parameter as a nuisance parameter and establish an adaptive efficient test sequence, which is based on the k _n largest observations, for the Gumbel domain of attraction. Efficiency is achieved along certain contiguous extreme value alternatives within the concept of local asymptotic normality (LAN). Simulations exemplify the results