Recursive kernel estimate of the conditional quantile for functional ergodic data

ABSTRACT

In this article, we study the recursive kernel estimator of the conditional quantile of a scalar response variable Y given a random variable (rv) X taking values in a semi-metric space. Two estimators are considered. While the first one is given by inverting the double-kernel estimate of the conditional distribution function, the second estimator is obtained by using the robust approach. We establish the almost complete consistency of these estimates when the observations are sampled from a functional ergodic process. Finally, a simulation study is carried out to illustrate the finite sample performance of these estimators.     

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.     

Parameter estimation for the skew Ornstein-Uhlenbeck processes based on discrete observations

Abstract

In this paper, the drift parameter estimation for the one-dimensional skew Ornstein-Uhlenbeck process is considered. We derived the moment estimator in terms of the sample moments and invariant density. Then, we proved the strong consistency and asymptotic normality. Finally, some numerical experiments are presented to show the effect of the moment estimator.     

On the estimation of the marginal density of a moving average process

The authors present a new convolution‐type kernel estimator of the marginal density of an MA(1) process with general error distribution. They prove the √n; ‐consistency of the nonparametric estimator and give asymptotic expressions for the mean square and the integrated mean square error of some unobservable version of the estimator. An extension to MA(q) processes is presented in the case of the mean integrated square error. Finally, a simulation study shows the good practical behaviour of the estimator and the strong connection between the estimator and its unobservable version in terms of the choice of the bandwidth.     

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.     

Kernel estimation of regression function gradient

Abstract

This paper is focused on kernel estimation of the gradient of a multivariate regression function. Despite the importance of this topic, the progress in this area is rather slow. Our aim is to construct a gradient estimator using the idea of local linear estimator for a regression function. The quality of this estimator is expressed in terms of the Mean Integrated Square Error. We focus on a choice of bandwidth matrix. Further, we present some data-driven methods for its choice and develop a new approach. The performance of presented methods is illustrated using a simulation study and real data example.     

A new information criterion-based bandwidth selection method for non-parametric regressions

ABSTRACT

Local linear estimator is a popularly used method to estimate the non-parametric regression functions, and many methods have been derived to estimate the smoothing parameter, or the bandwidth in this case. In this article, we propose an information criterion-based bandwidth selection method, with the degrees of freedom originally derived for non-parametric inferences. Unlike the plug-in method, the new method does not require preliminary parameters to be chosen in advance, and is computationally efficient compared to the cross-validation (CV) method. Numerical study shows that the new method performs better or comparable to existing plug-in method or CV method in terms of the estimation of the mean functions, and has lower variability than CV selectors. Real data applications are also provided to illustrate the effectiveness of the new method.     

A note on bias reduction in variable-kernel density estimates

It is well known that the inverse-square-root rule of Abramson (1982) for the bandwidth h of a variable-kernel density estimator achieves a reduction in bias from the fixed-bandwidth estimator, even when a nonnegative kernel is used. Without some form of “clipping” device similar to that of Abramson, the asymptotic bias can be much greater than O(h⁴) for target densities like the normal (Terrell and Scott 1992) or even compactly supported densities. However, Abramson used a nonsmooth clipping procedure intended for pointwise estimation. Instead, we propose a smoothly clipped estimator and establish a globally valid, uniformly convergent bias expansion for densities with uniformly continuous fourth derivatives. The main result extends Hall's (1990) formula (see also Terrell and Scott 1992) to several dimensions, and actually to a very general class of estimators. By allowing a clipping parameter to vary with the bandwidth, the usual O(h⁴) bias expression holds uniformly on any set where the target density is bounded away from zero.     

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.     

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.     

Asymptotic Theory for the Multiscale Wavelet Density Derivative Estimator

Abstract

In this paper we consider the wavelet-based estimation of density derivatives. The multiscale density derivative estimator is proposed which is constructed by using a number of scaling functions. Asymptotic theory is developed in which asymptotic expressions for the bias, the variance and the mean integrated squared error are included. In addition, asymptotic normality of the proposed estimator is proved. Theoretical and numerical comparisons with the usual kernel-based estimators are also reported.     

Simulations and computations of nonparametric density estimates for the deconvolution problem

The nonparametric density function estimation using sample observations which are contaminated with random noise is studied. The particular form of contamination under consideration is Y = X + Z, where Y is an observable random variableZ is a random noise variable with known distribution, and X is an absolutely continuous random variable which cannot be observed directly. The finite sample size performance of a strongly consistent estimator for the density function of the random variable X is illustrated for different distributions. The estimator uses Fourier and kernel function estimation techniques and allows the user to choose constants which relate to bandwidth windows and limits on integration and which greatly affect the appearance and properties of the estimates. Numerical techniques for computation of the estimated densities and for optimal selection of the constant are given.     

Nonparametric localized bandwidth selection for Kernel density estimation

As conventional cross-validation bandwidth selection methods do not work properly in the situation where the data are serially dependent time series, alternative bandwidth selection methods are necessary. In recent years, Bayesian-based methods for global bandwidth selection have been studied. Our experience shows that a global bandwidth is however less suitable than a localized bandwidth in kernel density estimation based on serially dependent time series data. Nonetheless, a di?cult issue is how we can consistently estimate a localized bandwidth. This paper presents a nonparametric localized bandwidth estimator, for which we establish a completely new asymptotic theory. Applications of this new bandwidth estimator to the kernel density estimation of Eurodollar deposit rate and the S&P 500 daily return demonstrate the effectiveness and competitiveness of the proposed localized bandwidth.     

Inference on proportional hazard rate model parameter under Type-I progressively hybrid censoring scheme

ABSTRACT

In this paper, under Type-I progressive hybrid censoring sample, we obtain maximum likelihood estimator of unknown parameter when the parent distribution belongs to proportional hazard rate family. We derive the conditional probability density function of the maximum likelihood estimator using moment-generating function technique. The exact confidence interval is obtained and compared by conducting a Monte Carlo simulation study for burr Type XII distribution. Finally, we obtain the Bayes and posterior regret gamma minimax estimates of the parameter under a precautionary loss function with precautionary index k = 2 and compare their behavior via a Monte Carlo simulation study.     

High-order data sharpening with dependent errors for regression bias reduction

Abstract

In this paper, we show that Y can be introduced into data sharpening to produce non-parametric regression estimators that enjoy high orders of bias reduction. Compared with those in existing literature, the proposed data-sharpening estimator has advantages including simplicity of the estimators, good performance of expectation and variance, and mild assumptions. We generalize this estimator to dependent errors. Finally, we conduct a limited simulation to illustrate that the proposed estimator performs better than existing ones.     

The General Expressions for the Moments of the Stochastic Shrinkage Parameters of the Liu Type Estimator

ABSTRACT

One of the problems with the Liu estimator is the appropriate value for the unknown biasing parameter d. In this article we consider the optimum value for d and give upper bound for the expected value of the estimator of this biasing parameter. We also derive the general expressions for the moments of the stochastic shrinkage parameters of the Liu estimator and the generalized Liu estimator. Numerical calculations are carried out to illustrate the behavior of the mean and variance of the biasing parameter. Also, a numerical example is given to illustrate the effect of the biasing parameter d, on the mean square error of the Liu estimator.     

Central limit theorem for the variable bandwidth kernel density estimators

In this paper we study the ideal variable bandwidth kernel density estimator introduced by McKay (1993a, b) and Jones et al. (1994) and the plug-in practical version of the variable bandwidth kernel estimator with two sequences of bandwidths as in Giné and Sang (2013). Based on the bias and variance analysis of the ideal and plug-in variable bandwidth kernel density estimators, we study the central limit theorems for each of them. The simulation study confirms the central limit theorem and demonstrates the advantage of the plug-in variable bandwidth kernel method over the classical kernel method.     

Classical and Bayesian estimation of stress-strength reliability in type II censored Pareto distributions

ABSTRACT

In this paper, the stress-strength reliability, R, is estimated in type II censored samples from Pareto distributions. The classical inference includes obtaining the maximum likelihood estimator, an exact confidence interval, and the confidence intervals based on Wald and signed log-likelihood ratio statistics. Bayesian inference includes obtaining Bayes estimator, equi-tailed credible interval, and highest posterior density (HPD) interval given both informative and non-informative prior distributions. Bayes estimator of R is obtained using four methods: Lindley's approximation, Tierney-Kadane method, Monte Carlo integration, and MCMC. Also, we compare the proposed methods by simulation study and provide a real example to illustrate them.     

On the Estimation of the Density of a Directional Data Stream

Many directional data such as wind directions can be collected extremely easily so that experiments typically yield a huge number of data points that are sequentially collected. To deal with such big data, the traditional nonparametric techniques rapidly require a lot of time to be computed and therefore become useless in practice if real time or online forecasts are expected. In this paper, we propose a recursive kernel density estimator for directional data which (i) can be updated extremely easily when a new set of observations is available and (ii) keeps asymptotically the nice features of the traditional kernel density estimator. Our methodology is based on Robbins–Monro stochastic approximations ideas. We show that our estimator outperforms the traditional techniques in terms of computational time while being extremely competitive in terms of efficiency with respect to its competitors in the sequential context considered here. We obtain expressions for its asymptotic bias and variance together with an almost sure convergence rate and an asymptotic normality result. Our technique is illustrated on a wind dataset collected in Spain. A Monte‐Carlo study confirms the nice properties of our recursive estimator with respect to its non‐recursive counterpart.