Adaptive smoothing in associated kernel discrete functions estimation using Bayesian approach

This paper demonstrates that cross-validation (CV) and Bayesian adaptive bandwidth selection can be applied in the estimation of associated kernel discrete functions. This idea is originally proposed by Brewer [A Bayesian model for local smoothing in kernel density estimation, Stat. Comput. 10 (2000), pp. 299–309] to derive variable bandwidths in adaptive kernel density estimation. Our approach considers the adaptive binomial kernel estimator and treats the variable bandwidths as parameters with beta prior distribution. The best variable bandwidth selector is estimated by the posterior mean in the Bayesian sense under squared error loss. Monte Carlo simulations are conducted to examine the performance of the proposed Bayesian adaptive approach in comparison with the performance of the Asymptotic mean integrated squared error estimator and CV technique for selecting a global (fixed) bandwidth proposed in Kokonendji and Senga Kiessé [Discrete associated kernels method and extensions, Stat. Methodol. 8 (2011), pp. 497–516]. The Bayesian adaptive bandwidth estimator performs better than the global bandwidth, in particular for small and moderate sample sizes.     

Nonparametric density estimation based on beta prime kernel

Abstract

In this work, we propose beta prime kernel estimator for estimation of a probability density functions defined with nonnegative support. For the proposed estimator, beta prime probability density function used as a kernel. It is free of boundary bias and nonnegative with a natural varying shape. We obtained the optimal rate of convergence for the mean squared error (MSE) and the mean integrated squared error (MISE). Also, we use adaptive Bayesian bandwidth selection method with Lindley approximation for heavy tailed distributions and compare its performance with the global least squares cross-validation bandwidth selection method. Simulation studies are performed to evaluate the average integrated squared error (ISE) of the proposed kernel estimator against some asymmetric competitors using Monte Carlo simulations. Moreover, real data sets are presented to illustrate the findings.     

Asymptotic properties of nonparametric regression for long memory random fields

The kernel estimator of spatial regression function is investigated for stationary long memory (long range dependent) random fields observed over a finite set of spatial points. A general result on the strong consistency of the kernel density estimator is first obtained for the long memory random fields, and then, under some mild regularity assumptions, the asymptotic behaviors of the regression estimator are established. For the linear long memory random fields, a weak convergence theorem is also obtained for kernel density estimator. Finally, some related issues on the inference of long memory random fields are discussed through a simulation example.     

Smooth estimation of a monotone density

We investigate the interplay of smoothness and monotonicity assumptions when estimating a density from a sample of observations. The nonparametric maximum likelihood estimator of a decreasing density on the positive half line attains a rate of convergence of [Formula: See Text] at a fixed point t if the density has a negative derivative at t. The same rate is obtained by a kernel estimator of bandwidth [Formula: See Text], but the limit distributions are different. If the density is both differentiable at t and known to be monotone, then a third estimator is obtained by isotonization of a kernel estimator. We show that this again attains the rate of convergence [Formula: See Text], and compare the limit distributions of the three types of estimators. It is shown that both isotonization and smoothing lead to a more concentrated limit distribution and we study the dependence on the proportionality constant in the bandwidth. We also show that isotonization does not change the limit behaviour of a kernel estimator with a bandwidth larger than [Formula: See Text], in the case that the density is known to have more than one derivative.     

A Remedy for Kernel Estimation Under Random Design

Two common kernel-based methods for non-parametric regression estimation suffer from well-known drawbacks when the design is random. The Gasser-Müller estimator is inadmissible due to its high variance while the Nadaraya-Watson estimator has zero asymptotic efficiency because of poor bias behavior. Under asymptotic consideration, the local linear estimator avoids these two drawbacks of kernel estimators and achieves minimax optimality. However, when based on compact support kernels its finite sample behavior is disappointing because sudden kinks may show up in the estimate.

This paper proposes a modification of the kernel estimator, called the binned convolution estimator leading to a fast O(n) method. Provided the design density is continously differentiable and the conditional fourth moments exist the binned convolution estimator has asymptotic properties identical with those of the local linear estimator.     

EMPIRICAL LIKELIHOOD-BASED KERNEL DENSITY ESTIMATION

This paper considers the estimation of a probability density function when extra distributional information is available (e.g. the mean of the distribution is known or the variance is a known function of the mean). The standard kernel method cannot exploit such extra information systematically as it uses an equal probability weight n^-1 at each data point. The paper suggests using empirical likelihood to choose the probability weights under constraints formulated from the extra distributional information. An empirical likelihood-based kernel density estimator is given by replacing n^-1 by the empirical likelihood weights, and has these advantages: it makes systematic use of the extra information, it is able to reflect the extra characteristics of the density function, and its variance is smaller than that of the standard kernel density estimator.     

Variable kernel density estimation

This paper considers the problem of selecting optimal bandwidths for variable (sample‐point adaptive) kernel density estimation. A data‐driven variable bandwidth selector is proposed, based on the idea of approximating the log‐bandwidth function by a cubic spline. This cubic spline is optimized with respect to a cross‐validation criterion. The proposed method can be interpreted as a selector for either integrated squared error (ISE) or mean integrated squared error (MISE) optimal bandwidths. This leads to reflection upon some of the differences between ISE and MISE as error criteria for variable kernel estimation. Results from simulation studies indicate that the proposed method outperforms a fixed kernel estimator (in terms of ISE) when the target density has a combination of sharp modes and regions of smooth undulation. Moreover, some detailed data analyses suggest that the gains in ISE may understate the improvements in visual appeal obtained using the proposed variable kernel estimator. These numerical studies also show that the proposed estimator outperforms existing variable kernel density estimators implemented using piecewise constant bandwidth functions.     

LARGE AND MODERATE DEVIATIONS PRINCIPLES FOR KERNEL ESTIMATION OF A MULTIVARIATE DENSITY AND ITS PARTIAL DERIVATIVES

This paper studies the large deviations behaviour of the kernel estimator of a probability density f, by considering the case when the kernel takes negative values. It establishes large and moderate deviations principles for the kernel estimators of the partial derivatives of f. The estimators of the derivatives exhibit a quadratic behaviour for both the large and the moderate deviations scales, whereas for the density estimator there is a classical gap between the large deviations and the moderate deviations asymptotics.     

A Semiparametric Model for Line Transect Sampling

This paper introduces an appealing semiparametric model for estimating wildlife abundance based on line transect data. The proposed method requires the existence of a parametric model and then improves the estimator using a kernel method. Properties of the resultant estimator are derived and an expression for the asymptotic mean square error (AMSE) of the estimator is given. Minimization of the AMSE leads to an explicit formula for an optimal choice of the smoothing parameter. Small-sample properties of the proposed estimator using the parametric half-normal model are investigated and compared with the classical kernel estimator using both simulations and real data. Numerical results show that improvements over the classical kernel estimator often can be realized even when the true density is far from the half-normal model.     

Asymptotic behaviour of binned kernel density estimators for locally non-stationary random fields

We investigate the asymptotic behaviour of binned kernel density estimators for dependent and locally non-stationary random fields converging to stationary random fields. We focus on the study of the bias and the asymptotic normality of the estimators. A simulation experiment conducted shows that both the kernel density estimator and the binned kernel density estimator have the same behavior and both estimate accurately the true density when the number of fields increases. We apply our results to the 2002 incidence rates of tuberculosis in the departments of France.     

Limiting bias-reduced Amoroso kernel density estimators for non-negative data

The Amoroso kernel density estimator (Igarashi and Kakizawa 2017 Igarashi, G., and Y. Kakizawa. 2017. Amoroso kernel density estimation for nonnegative data and its bias reduction. Department of Policy and Planning Sciences Discussion Paper Series No. 1345, University of Tsukuba. [Google Scholar]) for non-negative data is boundary-bias-free and has the mean integrated squared error (MISE) of order O(n^{? 4/5}), where n is the sample size. In this paper, we construct a linear combination of the Amoroso kernel density estimator and its derivative with respect to the smoothing parameter. Also, we propose a related multiplicative estimator. We show that the MISEs of these bias-reduced estimators achieve the convergence rates n^{? 8/9}, if the underlying density is four times continuously differentiable. We illustrate the finite sample performance of the proposed estimators, through the simulations.     

Estimation of a probability density function using interval aggregated data

ABSTRACT

In economics and government statistics, aggregated data instead of individual level data are usually reported for data confidentiality and for simplicity. In this paper we develop a method of flexibly estimating the probability density function of the population using aggregated data obtained as group averages when individual level data are grouped according to quantile limits. The kernel density estimator has been commonly applied to such data without taking into account the data aggregation process and has been shown to perform poorly. Our method models the quantile function as an integral of the exponential of a spline function and deduces the density function from the quantile function. We match the aggregated data to their theoretical counterpart using least squares, and regularize the estimation by using the squared second derivatives of the density function as the penalty function. A computational algorithm is developed to implement the method. Application to simulated data and US household income survey data show that our penalized spline estimator can accurately recover the density function of the underlying population while the common use of kernel density estimation is severely biased. The method is applied to study the dynamic of China's urban income distribution using published interval aggregated data of 1985–2010.     

Estimating Percentiles of Time-to-Failure Distribution Obtained from a Linear Degradation Model Using Kernel Density Method

In this article, we propose a nonparametric estimator for percentiles of the time-to-failure distribution obtained from a linear degradation model using the kernel density method. The properties of the proposed kernel estimator are investigated and compared with well-known maximum likelihood and ordinary least squares estimators via a simulation technique. The mean squared error and the length of the bootstrap confidence interval are used as the basis criteria of the comparisons. The simulation study shows that the performance of the kernel estimator is acceptable as a general estimator. When the distribution of the data is assumed to be known, the maximum likelihood and ordinary least squares estimators perform better than the kernel estimator, while the kernel estimator is superior when the assumption of our knowledge of the data distribution is violated. A comparison among different estimators is achieved using a real data set.     

LOG-PERIODOGRAM ESTIMATION OF LONG MEMORY VOLATILITY DEPENDENCIES WITH CONDITIONALLY HEAVY TAILED RETURNS

ABSTRACT

Many recent papers have used semiparametric methods, especially the log-periodogram regression, to detect and estimate long memory in the volatility of asset returns. In these papers, the volatility is proxied by measures such as squared, log-squared, and absolute returns. While the evidence for the existence of long memory is strong using any of these measures, the actual long memory parameter estimates can be sensitive to which measure is used. In Monte-Carlo simulations, I find that if the data is conditionally leptokurtic, the log-periodogram regression estimator using squared returns has a large downward bias, which is avoided by using other volatility measures. In United States stock return data, I find that squared returns give much lower estimates of the long memory parameter than the alternative volatility measures, which is consistent with the simulation results. I conclude that researchers should avoid using the squared returns in the semiparametric estimation of long memory volatility dependencies.     

Asymptotic Unbiased Kernel Estimator for Line Transect Sampling

In this article, we propose a new estimator for the density of objects using line transect data. The proposed estimator combines the nonparametric kernel estimator with parametric detection function: the exponential or the half normal detection function to estimate the density of objects. The selection of the detection function depends on the testing of the shoulder condition assumption. If the shoulder condition is true then the half-normal detection function is introduced together with the kernel estimator. Otherwise, the negative exponential is combined with the kernel estimator. Under these assumptions, the proposed estimator is asymptotically unbiased and it is strongly consistent estimator for the density of objects using line transect data. The simulation results indicate that the proposed estimator is very successful in taking the advantage of the parametric detection function available.     

A Convolution Estimator for the Density of Nonlinear Regression Observations

Abstract. The problem of estimating an unknown density function has been widely studied. In this article, we present a convolution estimator for the density of the responses in a nonlinear heterogenous regression model. The rate of convergence for the mean square error of the convolution estimator is of order n ^?1 under certain regularity conditions. This is faster than the rate for the kernel density method. We derive explicit expressions for the asymptotic variance and the bias of the new estimator, and further a data‐driven bandwidth selector is proposed. We conduct simulation experiments to check the finite sample properties, and the convolution estimator performs substantially better than the kernel density estimator for well‐behaved noise densities.     

Moving Average-Based Estimators of Integrated Variance

We examine moving average (MA) filters for estimating the integrated variance (IV) of a financial asset price in a framework where high-frequency price data are contaminated with market microstructure noise. We show that the sum of squared MA residuals must be scaled to enable a suitable estimator of IV. The scaled estimator is shown to be consistent, first-order efficient, and asymptotically Gaussian distributed about the integrated variance under restrictive assumptions. Under more plausible assumptions, such as time-varying volatility, the MA model is misspecified. This motivates an extensive simulation study of the merits of the MA-based estimator under misspecification. Specifically, we consider nonconstant volatility combined with rounding errors and various forms of dependence between the noise and efficient returns. We benchmark the scaled MA-based estimator to subsample and realized kernel estimators and find that the MA-based estimator performs well despite the misspecification.     

Consistency of the beta kernel density function estimator

The authors give the exact asymptotic behaviour of the expected average absolute error of a beta kernel density estimator proposed by Chen (1999). They also prove the uniform weak consistency of this estimator for the class of continuous densities.     

Moving Average-Based Estimators of Integrated Variance

We examine moving average (MA) filters for estimating the integrated variance (IV) of a financial asset price in a framework where high-frequency price data are contaminated with market microstructure noise. We show that the sum of squared MA residuals must be scaled to enable a suitable estimator of IV. The scaled estimator is shown to be consistent, first-order efficient, and asymptotically Gaussian distributed about the integrated variance under restrictive assumptions. Under more plausible assumptions, such as time-varying volatility, the MA model is misspecified. This motivates an extensive simulation study of the merits of the MA-based estimator under misspecification. Specifically, we consider nonconstant volatility combined with rounding errors and various forms of dependence between the noise and efficient returns. We benchmark the scaled MA-based estimator to subsample and realized kernel estimators and find that the MA-based estimator performs well despite the misspecification.