Nonparametric Estimation of Volatility Function with Variable Bandwidth Parameter

In this article, we introduce a new method for the volatility function estimation of continuous-time diffusion process dX _t  = μ(X _t )dt + σ(X _t )dW _t , which is based on combining the idea of local linear smoother and variable bandwidth. We give the expressions for the conditional MSE and MISE of the estimator and obtain the optimal variable bandwidth. An explicit formula for the optimal variable bandwidth is presented by minimizing the MISE, which extends the related results in Fan and Gijbels (1992 Fan , J. Q. , Gijbels , I. ( 1992 ). Variable bandwidth and local linear regression smoother . Ann. Statist. 20 ( 4 ): 2008 – 2036 .[Crossref], [Web of Science ®] , [Google Scholar]), etc. Finally, some simulations show that the performance of the proposed estimator with optimal variable bandwidth is often much better than that of the local linear estimator with invariable bandwidth.     

On panel data filtering in technical efficiency estimation

In present days it is commonly recognized that firm production datasets are affected by some level of random perturbation, and that consequently production frontiers have a stochastic nature. Mathematical programming methods, traditionally employed for frontier evaluation, are then reputed capable of mistaking errors for technical (in)efficiency. Therefore, recent literature is oriented towards a statistical view: frontiers are designed by enveloping data that have been preliminarly filtered from noise.In this paper a nonparametric smoother for filtering panel production data is presented. We pursue a recent approach of Kneip and Simar (1996), and frame it into a more general formulation whose a setting constitutes our specific proposal. The major feature of the method is that noise reduction and outlier detection are faced separately: i) a high order local polynomial fit is used as smoother; and ii) data are weighted by robustness scores. An extensive numerical study on some common production models yields encouraging results from a competition with Kneip and Simars filter.     

Fast computation of spatially adaptive kernel estimates

Kernel smoothing of spatial point data can often be improved using an adaptive, spatially varying bandwidth instead of a fixed bandwidth. However, computation with a varying bandwidth is much more demanding, especially when edge correction and bandwidth selection are involved. This paper proposes several new computational methods for adaptive kernel estimation from spatial point pattern data. A key idea is that a variable-bandwidth kernel estimator for d-dimensional spatial data can be represented as a slice of a fixed-bandwidth kernel estimator in \((d+1)\)-dimensional scale space, enabling fast computation using Fourier transforms. Edge correction factors have a similar representation. Different values of global bandwidth correspond to different slices of the scale space, so that bandwidth selection is greatly accelerated. Potential applications include estimation of multivariate probability density and spatial or spatiotemporal point process intensity, relative risk, and regression functions. The new methods perform well in simulations and in two real applications concerning the spatial epidemiology of primary biliary cirrhosis and the alarm calls of capuchin monkeys.     

Smoothing Time Series with Local Polynomial Regression on Time

Time series smoothers estimate the level of a time series at time t as its conditional expectation given present, past and future observations, with the smoothed value depending on the estimated time series model. Alternatively, local polynomial regressions on time can be used to estimate the level, with the implied smoothed value depending on the weight function and the bandwidth in the local linear least squares fit. In this article we compare the two smoothing approaches and describe their similarities. Through simulations, we assess the increase in the mean square error that results when approximating the estimated optimal time series smoother with the local regression estimate of the level.     

Robust nonparametric estimation of the intensity function of point data

Intensity functions—which describe the spatial distribution of the occurrences of point processes—are useful for risk assessment. This paper deals with the robust nonparametric estimation of the intensity function of space–time data from events such as earthquakes. The basic approach consists of smoothing the frequency histograms with the local polynomial regression (LPR) estimator. This method allows for automatic boundary corrections, and its jump-preserving ability can be improved with robustness. We derive a robust local smoother from the weighted-average approach to M-estimation and we select its bandwidths with robust cross-validation (RCV). Further, we develop a robust recursive algorithm for sequential processing of the data binned in time. An extensive application to the Northern California earthquake catalog in the San Francisco, CA, area illustrates the method and proves its validity.     

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.     

On the nonparametric smooth estimation of the reversed Hazard Rate function

The Reversed Hazard Rate (RHR) function is an important measure as a tool in the analysis of the reliability of both natural and man-made systems. In this paper, we present several new estimators of the RHR function using nonparametric techniques. These estimators are obtained by incorporating different binning techniques with fixed design local polynomial regression. We show that these estimators are asymptotically unbiased and consistent and, to determine the bandwidth, we propose two simple yet efficient plug-in bandwidth selection methods for even and odd order local polynomial estimators. Simulated and real life data are subsequently used to evaluate the performances of these estimators.     

Bandwidth selection in pre-smoothed particle filters

For the purpose of maximum likelihood estimation of static parameters, we apply a kernel smoother to the particles in the standard SIR filter for non-linear state space models with additive Gaussian observation noise. This reduces the Monte Carlo error in the estimates of both the posterior density of the states and the marginal density of the observation at each time point. We correct for variance inflation in the smoother, which together with the use of Gaussian kernels, results in a Gaussian (Kalman) update when the amount of smoothing turns to infinity. We propose and study of a criterion for choosing the optimal bandwidth h in the kernel smoother. Finally, we illustrate our approach using examples from econometrics. Our filter is shown to be highly suited for dynamic models with high signal-to-noise ratio, for which the SIR filter has problems.     

On the Uniform Strong Consistency of Local Polynomial Regression Under Dependence Conditions

Abstract

In this article, nonparametric estimators of the regression function, and its derivatives, obtained by means of weighted local polynomial fitting are studied. Consider the fixed regression model where the error random variables are coming from a stationary stochastic process satisfying a mixing condition. Uniform strong consistency, along with rates, are established for these estimators. Furthermore, when the errors follow an AR(1) correlation structure, strong consistency properties are also derived for a modified version of the local polynomial estimators proposed by Vilar-Fernández and Francisco-Fernández (Vilar-Fernández, J. M., Francisco-Fernández, M. (2002 Vilar-Fernández, J. M. and Francisco-Fernández, M. 2002. Local polynomial regression smoothers with AR-error structure. TEST, 11(2): 439–464.  [Google Scholar]). Local polynomial regression smoothers with AR-error structure. TEST 11(2):439–464).     

Testing for random effects and serial correlation in spatial autoregressive models

This paper constructs and evaluates tests for random effects and serial correlation in spatial autoregressive panel data models. In these models, ignoring the presence of random effects not only produces misleading inference but inconsistent estimation of the regression coefficients. Two different estimation methods are considered: maximum likelihood and instrumental variables. For each estimator, optimal tests are constructed: Lagrange multiplier in the first case; Neyman's C(α)$C(\alpha )$ in the second. In addition, locally size-robust tests, for individual hypotheses under local misspecification of the unconsidered parameter, are constructed. Extensive Monte Carlo evidence is presented.     

Simple boundary correction for kernel density estimation

If a probability density function has bounded support, kernel density estimates often overspill the boundaries and are consequently especially biased at and near these edges. In this paper, we consider the alleviation of this boundary problem. A simple unified framework is provided which covers a number of straightforward methods and allows for their comparison: generalized jackknifing generates a variety of simple boundary kernel formulae. A well-known method of Rice (1984) is a special case. A popular linear correction method is another: it has close connections with the boundary properties of local linear fitting (Fan and Gijbels, 1992). Links with the optimal boundary kernels of Müller (1991) are investigated. Novel boundary kernels involving kernel derivatives and generalized reflection arise too. In comparisons, various generalized jackknifing methods perform rather similarly, so this, together with its existing popularity, make linear correction as good a method as any. In an as yet unsuccessful attempt to improve on generalized jackknifing, a variety of alternative approaches is considered. A further contribution is to consider generalized jackknife boundary correction for density derivative estimation. En route to all this, a natural analogue of local polynomial regression for density estimation is defined and discussed.     

Measuring the Discrepancy of a Parametric Model via Local Polynomial Smoothing

Abstract. In the context of multivariate mean regression, we propose a new method to measure and estimate the inadequacy of a given parametric model. The measure is basically the missed fraction of variation after adjusting the best possible parametric model from a given family. The proposed approach is based on the minimum L ² ‐distance between the true but unknown regression curve and a given model. The estimation method is based on local polynomial averaging of residuals with a polynomial degree that increases with the dimension d of the covariate. For any d ≥ 1 and under some weak assumptions we give a Bahadur‐type representation of the estimator from which ‐consistency and asymptotic normality are derived for strongly mixing variables. We report the outcomes of a simulation study that aims at checking the finite sample properties of these techniques. We present the analysis of a dataset on ultrasonic calibration for illustration.     

Kernel spline regression

The authors propose «kernel spline regression,» a method of combining spline regression and kernel smoothing by replacing the polynomial approximation for local polynomial kernel regression with the spline basis. The new approach retains the local weighting scheme and the use of a bandwidth to control the size of local neighborhood. The authors compute the bias and variance of the kernel linear spline estimator, which they compare with local linear regression. They show that kernel spline estimators can succeed in capturing the main features of the underlying curve more effectively than local polynomial regression when the curvature changes rapidly. They also show through simulation that kernel spline regression often performs better than ordinary spline regression and local polynomial regression.     

Bootstrap inference in local polynomial regression of time series

In this paper we consider the inferential aspect of the nonparametric estimation of a conditional function , where X _t,m represents the vector containing the m conditioning lagged values of the series. Here is an arbitrary measurable function. The local polynomial estimator of order p is used for the estimation of the function g, and of its partial derivatives up to a total order p. We consider α-mixing processes, and we propose the use of a particular resampling method, the local polynomial bootstrap, for the approximation of the sampling distribution of the estimator. After analyzing the consistency of the proposed method, we present a simulation study which gives evidence of its finite sample behaviour.     

Efficient Bandwidth Selection in Non-parametric Regression

In this paper we use non-parametric local polynomial methods to estimate the regression function, m ( x ). Y may be a binary or continuous response variable, and X is continuous with non-uniform density. The main contributions of this paper are the weak convergence of a bandwidth process for kernels of order (0, k ), k =2 ^j , j ≥1 and the proposal of a local data-driven bandwidth selection method which is particularly beneficial for the case when X is not distributed uniformly. This selection method minimizes estimates of the asymptotic MSE and estimates the bias portion in an innovative way which relies on the order of the kernel and not estimation of m ²( x ) directly. We show that utilization of this method results in the achievement of the optimal asymptotic MSE by the estimator, i.e. the method is efficient. Simulation studies are provided which illustrate the method for both binary and continuous response cases.     

Computing location depth and regression depth in higher dimensions

The location depth (Tukey 1975) of a point relative to a p-dimensional data set Z of size n is defined as the smallest number of data points in a closed halfspace with boundary through . For bivariate data, it can be computed in O(nlogn) time (Rousseeuw and Ruts 1996). In this paper we construct an exact algorithm to compute the location depth in three dimensions in O(n2logn) time. We also give an approximate algorithm to compute the location depth in p dimensions in O(mp3+mpn) time, where m is the number of p-subsets used.Recently, Rousseeuw and Hubert (1996) defined the depth of a regression fit. The depth of a hyperplane with coefficients (1,...,p) is the smallest number of residuals that need to change sign to make (1,...,p) a nonfit. For bivariate data (p=2) this depth can be computed in O(nlogn) time as well. We construct an algorithm to compute the regression depth of a plane relative to a three-dimensional data set in O(n2logn) time, and another that deals with p=4 in O(n3logn) time. For data sets with large n and/or p we propose an approximate algorithm that computes the depth of a regression fit in O(mp3+mpn+mnlogn) time. For all of these algorithms, actual implementations are made available.     

Asymptotics of improved generalized moment estimators for spatial autoregressive error models

Abstract

This article considers linear models with a spatial autoregressive error structure. Extending Arnold and Wied (2010) Arnold, M., Wied, D. (2010). Improved GMM estimation of the spatial autoregressive error model. Econ. Lett. 108:65–68.[Crossref], [Web of Science ®] , [Google Scholar], who develop an improved generalized method of moment (GMM) estimator for the parameters of the disturbance process to reduce the bias of existing estimation approaches, we establish the asymptotic normality of a new weighted version of this improved estimator and derive the efficient weighting matrix. We also show that this efficiently weighted GMM estimator is feasible as long as the regression matrix of the underlying linear model is non stochastic and illustrate the performance of the new estimator by a Monte Carlo simulation and an application to real data.