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.     

Kernel Method Starting with Half-Normal Detection Function for Line Transect Density Estimation

In this article, we introduce the nonparametric kernel method starting with half-normal detection function using line transect sampling. The new method improves bias from O(h ²), as the smoothing parameter h → 0, to O(h ³) and in some cases to O(h ⁴). Properties of the proposed 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 estimator are investigated and compared with the traditional kernel estimator by using simulation technique. A numerical results show that improvements over the traditional kernel estimator often can be realized even when the true detection function is far from the half-normal detection function.     

Uniformly strong consistency and Berry-Esseen bound of frequency polygons for α-mixing samples

In this article, the frequency polygon investigated by Scott is studied as a nonparametric estimator for α-mixing samples. By some known exponent and moment inequalities, we obtain the uniformly strong consistency and Berry-Esseen bound of the estimator. The present results relax the relevant conditions used by Carbon et al. Furthermore, the convergence rate of the uniformly asymptotic normality is derived, which is O(n^{? 1/11}) under the given conditions.     

A bias-corrected histogram estimator for line transect sampling

The classical histogram method has already been applied in line transect sampling to estimate the parameter f(0), which in turns is used to estimate the population abundance D or the population size N. It is well know that the bias convergence rate for histogram estimator of f(0) is o(h²) as h → 0, under the shoulder condition assumption. If the shoulder condition is not true, then the bias convergence rate is only o(h). This paper proposed two new estimators for f(0), which can be considered as modifications of the classical histogram estimator. The first estimator is derived when the shoulder condition is assumed to be valid and it reduces the bias convergence rate from o(h²) to o(h³). The other one is constructed without using the shoulder condition assumption and it reduces the bias convergence rate from o(h) to o(h²). The asymptotic properties of the proposed estimators are derived and formulas for bin width are also given. The finite properties based on a real data set and an extensive simulation study demonstrated the potential practical use of the proposed estimators.     

Bias reduction of the maximum-likelihood estimator for a conditional Gaussian MA(1) model

In this paper, we consider an estimation for the unknown parameters of a conditional Gaussian MA(1) model. In the majority of cases, a maximum-likelihood estimator is chosen because the estimator is consistent. However, for small sample sizes the error is large, because the estimator has a bias of O(n^{? 1}). Therefore, we provide a bias of O(n^{? 1}) for the maximum-likelihood estimator for the conditional Gaussian MA(1) model. Moreover, we propose new estimators for the unknown parameters of the conditional Gaussian MA(1) model based on the bias of O(n^{? 1}). We investigate the properties of the bias, as well as the asymptotical variance of the maximum-likelihood estimators for the unknown parameters, by performing some simulations. Finally, we demonstrate the validity of the new estimators through this simulation study.     

On the mean L1-error in the heteroscedastic deconvolution problem with compactly supported noises

We study the heteroscedastic deconvolution problem when random noises have compactly supported densities. In this context, the Fourier transforms of the densities can vanish on the real line. We propose a truncated type of estimator for target density and derive the convergence rate of the mean L¹-error uniformly over a class of target densities. A lower bound for the mean L¹-error is also established. Some simulations will be given to illustrate the performance of the proposed estimator.     

Polynomial Histograms for Multivariate Density and Mode Estimation

Abstract. We consider the problem of efficiently estimating multivariate densities and their modes for moderate dimensions and an abundance of data. We propose polynomial histograms to solve this estimation problem. We present first‐ and second‐order polynomial histogram estimators for a general d‐dimensional setting. Our theoretical results include pointwise bias and variance of these estimators, their asymptotic mean integrated square error (AMISE), and optimal binwidth. The asymptotic performance of the first‐order estimator matches that of the kernel density estimator, while the second order has the faster rate of O(n^?6/(d+6)). For a bivariate normal setting, we present explicit expressions for the AMISE constants which show the much larger binwidths of the second order estimator and hence also more efficient computations of multivariate densities. We apply polynomial histogram estimators to real data from biotechnology and find the number and location of modes in such data.     

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 .     

Estimation and Inference for Linear Panel Data Models Under Misspecification When Both n and T are Large

This article considers fixed effects (FE) estimation for linear panel data models under possible model misspecification when both the number of individuals, n, and the number of time periods, T, are large. We first clarify the probability limit of the FE estimator and argue that this probability limit can be regarded as a pseudo-true parameter. We then establish the asymptotic distributional properties of the FE estimator around the pseudo-true parameter when n and T jointly go to infinity. Notably, we show that the FE estimator suffers from the incidental parameters bias of which the top order is O(T^{? 1}), and even after the incidental parameters bias is completely removed, the rate of convergence of the FE estimator depends on the degree of model misspecification and is either (nT)^{? 1/2} or n^{? 1/2}. Second, we establish asymptotically valid inference on the (pseudo-true) parameter. Specifically, we derive the asymptotic properties of the clustered covariance matrix (CCM) estimator and the cross-section bootstrap, and show that they are robust to model misspecification. This establishes a rigorous theoretical ground for the use of the CCM estimator and the cross-section bootstrap when model misspecification and the incidental parameters bias (in the coefficient estimate) are present. We conduct Monte Carlo simulations to evaluate the finite sample performance of the estimators and inference methods, together with a simple application to the unemployment dynamics in the U.S.     

Double-smoothing for bias reduction in local linear regression

Local linear regression involves fitting a straight line segment over a small region whose midpoint is the target point x, and the local linear estimate at x   is the estimated intercept of that straight line segment, with an asymptotic bias of order h²$h^2$ and variance of order (nh)^-1$(\mathit{nh}{)}^{-1}$ (h is the bandwidth). In this paper, we propose a new estimator, the double-smoothing local linear estimator, which is constructed by integrally combining all fitted values at x   of local lines in its neighborhood with another round of smoothing. The proposed estimator attempts to make use of all information obtained from fitting local lines. Without changing the order of variance, the new estimator can reduce the bias to an order of h⁴$h^4$. The proposed estimator has better performance than local linear regression in situations with considerable bias effects; it also has less variability and more easily overcomes the sparse data problem than local cubic regression. At boundary points, the proposed estimator is comparable to local linear regression. Simulation studies are conducted and an ethanol example is used to compare the new approach with other competitive methods.     

A Note on Asymptotic Behavior of the Nonparametric Density Estimators in Multivariate Mixtures

The asymptotic behavior of the nonparametric density estimator has been given for a multivariate mixture model. It has been observed that the estimator is asymptotically normally distributed with bias of size h ² and variance of size (nh)^?1.     

Reduction of bias and skewness with applications to second order accuracy

Suppose [^(q)]{\widehat{\theta}} is an estimator of θ in \mathbbR{\mathbb{R}} that satisfies the central limit theorem. In general, inferences on θ are based on the central limit approximation. These have error O(n ^−1/2), where n is the sample size. Many unsuccessful attempts have been made at finding transformations which reduce this error to O(n ⁻¹). The variance stabilizing transformation fails to achieve this. We give alternative transformations that have bias O(n ⁻²), and skewness O(n ⁻³). Examples include the binomial, Poisson, chi-square and hypergeometric distributions.     

A consistent nonparametric density estimator for the deconvolution problem

The problem of nonparametric estimation of a probability density function when the sample observations are contaminated with random noise is studied. A particular estimator f?_n(x) is proposed which uses kernel-density and deconvolution techniques. The estimator f?_n(x) is shown to be uniformly consistent, and its appearance and properties are affected by constants M_n and h_n which the user may choose. The optimal choices of M_n and h_n depend on the sample size n, the noise distribution, and the true distribution which is being estimated. Particular selections for M_n and h_n which minimize upper-bound functions of the mean squared error for f?_n(x) are recommended.     

Some theoretical results regarding the polygonal distribution

Polygonal distributions are a class of distributions that can be defined via the mixture of triangular distributions over the unit interval. We demonstrate that the densities of polygonal distributions are dense in the class of continuous and concave densities with bounded second derivatives. Furthermore, we prove that polygonal density functions provide O(g^{? 2}) approximations (where g is the number of triangular distribution components), in the supremum distance, to any density function from the hypothesized class. Parametric consistency and Hellinger consistency results for the maximum likelihood (ML) estimator are obtained. A result regarding model selection via penalized ML estimation is proved.     

Improved maximum-likelihood estimation of the shape parameter in the Nakagami distribution

We develop and evaluate analytic and bootstrap bias-corrected maximum-likelihood estimators for the shape parameter in the Nakagami distribution. This distribution is widely used in a variety of disciplines, and the corresponding estimator of its scale parameter is trivially unbiased. We find that both ‘corrective’ and ‘preventive’ analytic approaches to eliminating the bias, to O(n ^?2), are equally, and extremely, effective and simple to implement. As a bonus, the sizeable reduction in bias comes with a small reduction in the mean-squared error. Overall, we prefer analytic bias corrections in the case of this estimator. This preference is based on the relative computational costs and the magnitudes of the bias reductions that can be achieved in each case. Our results are illustrated with two real-data applications, including the one which provides the first application of the Nakagami distribution to data for ocean wave heights.     

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.     

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.     

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.     

Nonparametric local polynomial approximation of the time-varying frequency and amplitude

The problem of estimating the time-varying frequency, phase and amplitude of a real-valued harmonic signal is considered. It is assumed that the frequency and amplitude are unspecified rapidly time-varying functions of time. The technique is based on fitting a local polynomial approximation of the phase and amplitude which implements a high-order nonlinear nonparametric estimator. The estimator is shown to be strongly consistent and Gaussian. In particular, the convergence ratesO(h^-3/2 )and O(h^-5/2 ), where $i;h$ei; is the number of observations, are obtained for the frequency estimator when the amplitude is unknown constant or linear in time respectively. The orders of the bias and Gaussian distribution are obtained for a class of the time-varying frequency and amplitude with bounded second derivatives. The a priori amplitude information about the unknown time-varying frequency and amplitude and their derivatives can be incorporated to improve the accuracy of the estimation. Simulation results are given.     

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.