Beta-Bernstein Smoothing for Regression Curves with Compact Support

ABSTRACT. The problem of boundary bias is associated with kernel estimation for regression curves with compact support. This paper proposes a simple and uni(r)ed approach for remedying boundary bias in non-parametric regression, without dividing the compact support into interior and boundary areas and without applying explicitly different smoothing treatments separately. The approach uses the beta family of density functions as kernels. The shapes of the kernels vary according to the position where the curve estimate is made. Theyare symmetric at the middle of the support interval, and become more and more asymmetric nearer the boundary points. The kernels never put any weight outside the data support interval, and thus avoid boundary bias. The method is a generalization of classical Bernstein polynomials, one of the earliest methods of statistical smoothing. The proposed estimator has optimal mean integrated squared error at an order of magnitude n ^−4/5, equivalent to that of standard kernel estimators when the curve has an unbounded support.     

Boundary modification for kernel regression

We present a simple and effective method of modifying a kernel regression estimate near the boundary. The modification ensures that the bias and variance near the boundary are of the same order of magnitude as in the interior.     

Boundary and Bias Correction in Kernel Hazard Estimation

A new class of local linear hazard estimators based on weighted least square kernel estimation is considered. The class includes the kernel hazard estimator of Ramlau-Hansen (1983), which has the same boundary correction property as the local linear regression estimator (see Fan & Gijbels, 1996). It is shown that all the local linear estimators in the class have the same pointwise asymptotic properties. We derive the multiplicative bias correction of the local linear estimator. In addition we propose a new bias correction technique based on bootstrap estimation of additive bias. This latter method has excellent theoretical properties. Based on an extensive simulation study where we compare the performance of competing estimators, we also recommend the use of the additive bias correction in applied work.     

Smoothing Splines with Boundary Correction

Regular smoothing splines are known to have a type of boundary bias problem that can reduce their estimation efficiency. In this paper, a boundary corrected smoothing spline with general order is designed in a way that the risk will decay at an optimal rate. An O(n) algorithm is also developed to compute the resultant estimator efficiently.     

On the boundary properties of Bernstein polynomial estimators of density and distribution functions

For density and distribution functions supported on [0,1], Bernstein polynomial estimators are known to have optimal mean integrated squared error (MISE) properties under the usual smoothness conditions on the function to be estimated. These estimators are also known to be well-behaved in terms of bias: they have uniform bias over the entire unit interval. What is less known, however, is that some of these estimators do experience a boundary effect, but of a different nature than what is seen with the usual kernel estimators.     

Boundary corrected cubic smoothing splines

Smoothing splines are known to exhibit a type of boundary bias that can reduce their estimation efficiency. In this paper, a boundary corrected cubic smoothing spline is developed in a way that produces a uniformly fourth order estimator. The resulting estimator can be calculated efficiently using an O(n) algorithm that is designed for the computation of fitted values and associated smoothing parameter selection criteria. A simulation study shows that use of the boundary corrected estimator can improve estimation efficiency in finite samples. Applications to the construction of asymptotically valid pointwise confidence intervals are also investigated .     

A new non parametric estimator for Pdf based on inverse gamma distribution

ABSTRACT

The non parametric approach is considered to estimate probability density function (Pdf) which is supported on(0, ∞). This approach is the inverse gamma kernel. We show that it has same properties as gamma, reciprocal inverse Gaussian, and inverse Gaussian kernels such that it is free of the boundary bias, non negative, and it achieves the optimal rate of convergence for the mean integrated squared error. Also some properties of the estimator were established such as bias and variance. Comparison of the bandwidth selection methods for inverse gamma kernel estimation of Pdf is done.     

A generalized reflection method of boundary correction in kernel density estimation

The kernel method of estimation of curves is now popular and widely used in statistical applications. Kernel estimators suffer from boundary effects, however, when the support of the function to be estimated has finite endpoints. Several solutions to this problem have already been proposed. Here the authors develop a new method of boundary correction for kernel density estimation. Their technique is a kind of generalized reflection involving transformed data. It generates a class of boundary corrected estimators having desirable properties such as local smoothness and nonnegativity. Simulations show that the proposed method performs quite well when compared with the existing methods for almost all shapes of densities. The authors present the theory behind this new methodology, and they determine the bias and variance of their estimators.     

Estimation Bias in the First-Order Autoregressive Model and Its Impact on Predictions and Prediction Intervals

The least squares estimate of the autoregressive coefficient in the AR(1) model is known to be biased towards zero, especially for parameters close to the stationarity boundary. Several methods for correcting the autoregressive parameter estimate for the bias have been suggested. Using simulations, we study the bias and the mean square error of the least squares estimate and the bias-corrections proposed by Kendall and Quenouille.

We also study the mean square forecast error and the coverage of the 95% prediction interval when using the biased least squares estimate or one of its bias-corrected versions. We find that the estimation bias matters little for point forecasts, but that it affects the coverage of the prediction intervals. Prediction intervals for forecasts more than one step ahead, when calculated with the biased least squares estimate, are too narrow.     

A locally adaptive transformation method of boundary correction in kernel density estimation

Kernel smoothing methods are widely used in many research areas in statistics. However, kernel estimators suffer from boundary effects when the support of the function to be estimated has finite endpoints. Boundary effects seriously affect the overall performance of the estimator. In this article, we propose a new method of boundary correction for univariate kernel density estimation. Our technique is based on a data transformation that depends on the point of estimation. The proposed method possesses desirable properties such as local adaptivity and non-negativity. Furthermore, unlike many other transformation methods available, the proposed estimator is easy to implement. In a Monte Carlo study, the accuracy of the proposed estimator is numerically analyzed and compared with the existing methods of boundary correction. We find that it performs well for most shapes of densities. The theory behind the new methodology, along with the bias and variance of the proposed estimator, are presented. Results of a data analysis are also given.     

Nonparametric kernel regression estimation near endpoints

When kernel regression is used to produce a smooth estimate of a curve over a finite interval, boundary problems detract from the global performance of the estimator. A new kernel is derived to reduce this boundary problem. A generalized jackknife combination of two unsatisfactory kernels produces the desired result. One motivation for adopting a jackknife combination is that they are simple to construct and evaluate. Furthermore, as in other settings, the bias reduction property need not cause an inordinate increase in variability. The convergence rate with the new boundary kernel is the same as for the non-boundary. To illustrate the general approach, a new second-order boundary kernel, which is continuously linked to the Epanechnikov (1969, Theory Probab. Appl. 14, 153–158) kernel, is produced. The asymptotic mean square efficiencies relative to smooth optimal kernels due to Gasser and Müller (1984, Scand. J. Statist. 11, 171–185), Müller (1991, Biometrika 78, 521–530) and Müller and Wang (1994, Biometrics 50, 61–76) indicate that the new kernel is also competitive in this sense.     

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.     

Missing data mechanisms and their implications on the analysis of categorical data

We review some issues related to the implications of different missing data mechanisms on statistical inference for contingency tables and consider simulation studies to compare the results obtained under such models to those where the units with missing data are disregarded. We confirm that although, in general, analyses under the correct missing at random and missing completely at random models are more efficient even for small sample sizes, there are exceptions where they may not improve the results obtained by ignoring the partially classified data. We show that under the missing not at random (MNAR) model, estimates on the boundary of the parameter space as well as lack of identifiability of the parameters of saturated models may be associated with undesirable asymptotic properties of maximum likelihood estimators and likelihood ratio tests; even in standard cases the bias of the estimators may be low only for very large samples. We also show that the probability of a boundary solution obtained under the correct MNAR model may be large even for large samples and that, consequently, we may not always conclude that a MNAR model is misspecified because the estimate is on the boundary of the parameter space.     

Automatic polynomial wavelet regression

In Oh, Naveau and Lee (2001) a simple method is proposed for reducing the bias at the boundaries for wavelet thresholding regression. The idea is to model the regression function as a sum of wavelet basis functions and a low-order polynomial. The latter is expected to account for the boundary problem. Practical implementation of this method requires the choice of the order of the low-order polynomial, as well as the wavelet thresholding value. This paper proposes two automatic methods for making such choices. Finite sample performances of these two methods are evaluated via numerical experiments.     

LOCAL POLYNOMIAL QUASI-LIKELIHOOD REGRESSION ON RANDOM FIELDS

In this paper, local quasi‐likelihood regression is considered for stationary random fields of dependent variables. In the case of independent data, local polynomial quasi‐likelihood regression is known to have several appealing features such as minimax efficiency, design adaptivity and good boundary behaviour. These properties are shown to carry over to the case of random fields. The asymptotic normality of the regression estimator is established and explicit formulae for its asymptotic bias and variance are derived for strongly mixing stationary random fields. The extension to multi‐dimensional covariates is also provided in full generality. Moreover, evaluation of the finite sample performance is made through a simulation study.     

Maximum likelihood estimation for reflected Ornstein-Uhlenbeck processes

In this paper, we investigate the maximum likelihood estimation for the reflected Ornstein-Uhlenbeck (ROU) processes based on continuous observations. Both the cases with one-sided barrier and two-sided barriers are considered. We derive the explicit formulas for the estimators, and then prove their strong consistency and asymptotic normality. Moreover, the bias and mean square errors are represented in terms of the solutions to some PDEs with homogeneous Neumann boundary conditions. We also illustrate the asymptotic behavior of the estimators through a simulation study.     

On improving convergence rate of Bernstein polynomial density estimator

This paper is concerned with the Bernstein estimator [Vitale, R.A. (1975), ‘A Bernstein Polynomial Approach to Density Function Estimation’, in Statistical Inference and Related Topics, ed. M.L. Puri, 2, New York: Academic Press, pp. 87–99] to estimate a density with support [0, 1]. One of the major contributions of this paper is an application of a multiplicative bias correction [Terrell, G.R., and Scott, D.W. (1980), ‘On Improving Convergence Rates for Nonnegative Kernel Density Estimators’, The Annals of Statistics, 8, 1160–1163], which was originally developed for the standard kernel estimator. Moreover, the renormalised multiplicative bias corrected Bernstein estimator is studied rigorously. The mean squared error (MSE) in the interior and mean integrated squared error of the resulting bias corrected Bernstein estimators as well as the additive bias corrected Bernstein estimator [Leblanc, A. (2010), ‘A Bias-reduced Approach to Density Estimation Using Bernstein Polynomials’, Journal of Nonparametric Statistics, 22, 459–475] are shown to be O(n^?8/9) when the underlying density has a fourth-order derivative, where n is the sample size. The condition under which the MSE near the boundary is O(n^?8/9) is also discussed. Finally, numerical studies based on both simulated and real data sets are presented.     

Large Sample Approximation of the Distribution for Convex-Hull Estimators of Boundaries

Abstract.  Given n independent and identically distributed observations in a set G  = {( x ,  y ) ∈ [0, 1] ^p  ×  R  : 0 ≤  y  ≤  g ( x )} with an unknown function g , called a boundary or frontier, it is desired to estimate g from the observations. The problem has several important applications including classification and cluster analysis, and is closely related to edge estimation in image reconstruction. The convex-hull estimator of a boundary or frontier is also very popular in econometrics, where it is a cornerstone of a method known as 'data envelope analysis'. In this paper, we give a large sample approximation of the distribution of the convex-hull estimator in the general case where p  ≥ 1. We discuss ways of using the large sample approximation to correct the bias of the convex-hull and the DEA estimators and to construct confidence intervals for the true function.     

Nonparametric density estimation for multivariate bounded data

We propose a new nonparametric estimator for the density function of multivariate bounded data. As frequently observed in practice, the variables may be partially bounded (e.g. nonnegative) or completely bounded (e.g. in the unit interval). In addition, the variables may have a point mass. We reduce the conditions on the underlying density to a minimum by proposing a nonparametric approach. By using a gamma, a beta, or a local linear kernel (also called boundary kernels), in a product kernel, the suggested estimator becomes simple in implementation and robust to the well known boundary bias problem. We investigate the mean integrated squared error properties, including the rate of convergence, uniform strong consistency and asymptotic normality. We establish consistency of the least squares cross-validation method to select optimal bandwidth parameters. A detailed simulation study investigates the performance of the estimators. Applications using lottery and corporate finance data are provided.     

On the Local Polynomial Estimators of the Counting Process Intensity Function and its Derivatives

Abstract. We consider the properties of the local polynomial estimators of a counting process intensity function and its derivatives. By expressing the local polynomial estimators in a kernel smoothing form via effective kernels, we show that the bias and variance of the estimators at boundary points are of the same magnitude as at interior points and therefore the local polynomial estimators in the context of intensity estimation also enjoy the automatic boundary correction property as they do in other contexts such as regression. The asymptotically optimal bandwidths and optimal kernel functions are obtained through the asymptotic expressions of the mean square error of the estimators. For practical purpose, we suggest an effective and easy‐to‐calculate data‐driven bandwidth selector. Simulation studies are carried out to assess the performance of the local polynomial estimators and the proposed bandwidth selector. The estimators and the bandwidth selector are applied to estimate the rate of aftershocks of the Sichuan earthquake and the rate of the Personal Emergency Link calls in Hong Kong.