A Berry-Esseen theorem for the kernel quantile estimator with application to studying the deficiency of quantile estimators

A Berry-Esseen bound is established for the kernel quantile estimator under various conditions. The results improve an earlier result of Falk (1985,Ann. Statist.,13, 428–433) and rely on the local smoothness of the quantile function. This new Berry-Esseen bound is applied to studying the deficiency of the sample quantile estimator with respect to the kernel quantile estimator. A new result is obtained which is an extension of that in Falk (1985).     

Estimation of a quantile in some nonstandard cases

A necessary condition for the asymptotic normality of the sample quantile estimator isf(Q(p))=F(Q(p))>0, whereQ(p) is thep-th quantile of the distribution functionF(x). In this paper, we estimate a quantile by a kernel quantile estimator when this condition is violated. We have shown that the kernel quantile estimator is asymptotically normal in some nonstandard cases. The optimal convergence rate of the mean squared error for the kernel estimator is obtained with respect to the asymptotically optimal bandwidth. A law of the iterated logarithm is also established.This research was partially supported by the new faculty award from the University of Oregon.     

Improved confidence intervals for quantiles

We derive the Edgeworth expansion for the studentized version of the kernel quantile estimator. Inverting the expansion allows us to get very accurate confidence intervals for the pth quantile under general conditions. The results are applicable in practice to improve inference for quantiles when sample sizes are moderate.     

Exact convergence rate of bootstrap quantile variance estimator

Summary It is shown that the relative error of the bootstrap quantile variance estimator is of precise order n ^-1/4, when n denotes sample size. Likewise, the error of the bootstrap sparsity function estimator is of precise order n ^-1/4. Therefore as point estimators these estimators converge more slowly than the Bloch-Gastwirth estimator and kernel estimators, which typically have smaller error of order at most n ^-2/5.     

Estimation of a smooth quantile function under the proportional hazards model

The problem of estimating a smooth quantile function, Q(·), at a fixed point p, 0 < p < 1, is treated under a nonparametric smoothness condition on Q. The asymptotic relative deficiency of the sample quantile based on the maximum likelihood estimate of the survival function under the proportional hazards model with respect to kernel type estimators of the quantile is evaluated. The comparison is based on the mean square errors of the estimators. It is shown that the relative deficiency tends to infinity as the sample size, n, tends to infinity.     

左截断右删失数据分位差估计及其渐近性质

我们研究了左截断右删失数据分位差,基于左截断右删失数据乘积限构造了分位差的经验估计,同时克服经验估计的非光滑性,提出了分位数差的核光滑估计.利用经验过程理论推导出这两个估计的渐近偏差和渐近方差,并且在左截断右删失数据下研究了这两个分位差的大样本性质,获得分位差估计的相合性和渐近正态性.同时给出计算模拟以验证光滑分位差估计的表现,在均方损失的意义下模拟结果表明光滑估计比经验估计具有更好的性质.     

Relative deficiency of quantile estimators for left truncated and right censored data

The quantity deficiency which was proposed by Hodges and Lehmann (1970) is used to compare different statistical procedures. In this article, the deficiency of the sample quantile estimator with respect to the kernel quantile estimator for left truncated and right censored (LTRC) data in the sense of Hodges and Lehmann is considered. We also give the optimal bandwidth for the kernel quantile estimator. Monte Carlo studies are conducted to illustrate our results.     

Central limit theorem for perturbed empirical distribution functions evaluated at a random point

Let be an estimator obtained by integrating a kernel type density estimator based on a random sample of size n from a (smooth) distribution function F. Sufficient conditions are given for the central limit theorem to hold for the target statistic where {U_n} is a sequence of U-statistics.     

The Maximum Lq-Likelihood Method: An Application to Extreme Quantile Estimation in Finance

Estimating financial risk is a critical issue for banks and insurance companies. Recently, quantile estimation based on extreme value theory (EVT) has found a successful domain of application in such a context, outperforming other methods. Given a parametric model provided by EVT, a natural approach is maximum likelihood estimation. Although the resulting estimator is asymptotically efficient, often the number of observations available to estimate the parameters of the EVT models is too small to make the large sample property trustworthy. In this paper, we study a new estimator of the parameters, the maximum Lq-likelihood estimator (MLqE), introduced by Ferrari and Yang (Estimation of tail probability via the maximum Lq-likelihood method, Technical Report 659, School of Statistics, University of Minnesota, 2007 ). We show that the MLqE outperforms the standard MLE, when estimating tail probabilities and quantiles of the generalized extreme value (GEV) and the generalized Pareto (GP) distributions. First, we assess the relative efficiency between the MLqE and the MLE for various sample sizes, using Monte Carlo simulations. Second, we analyze the performance of the MLqE for extreme quantile estimation using real-world financial data. The MLqE is characterized by a distortion parameter q and extends the traditional log-likelihood maximization procedure. When q→1, the new estimator approaches the traditional maximum likelihood estimator (MLE), recovering its desirable asymptotic properties; when q ≠ 1 and the sample size is moderate or small, the MLqE successfully trades bias for variance, resulting in an overall gain in terms of accuracy (mean squared error).      

Weighted L quantile distance estimators for randomly censored data

The asymptotic properties of a family of minimum quantile distance estimators for randomly censored data sets are considered. These procedures produce an estimator of the parameter vector that minimizes a weighted L² distance measure between the Kaplan-Meier quantile function and an assumed parametric family of quantile functions. Regularity conditions are provided which insure that these estimators are consistent and asymptotically normal. An optimal weight function is derived for single parameter families, which, for location/scale families, results in censored sample analogs of estimators such as those suggested by Parzen.     

Estimating densities,quantiles, quantile densities and density quantiles

To estimate the quantile density function (the derivative of the quantile function) by kernel means, there are two alternative approaches. One is the derivative of the kernel quantile estimator, the other is essentially the reciprocal of the kernel density estimator. We give ways in which the former method has certain advantages over the latter. Various closely related smoothing issues are also discussed.     

Efficient computation of generalized median estimators

The generalized median (GM) estimator is a family of robust estimators that balances the competing demands of statistical efficiency and robustness. By choosing a kernel that is efficient for the parameter, the GM estimator gains robustness by computing the median of the kernel evaluated at all possible subsets from the sample. The GM estimator is often computationally infeasible because the number of subsets can be large for even modest sample sizes. Writing the estimator in terms of the quantile function facilitates an approximation using a sample of all possible subsets. While both sampling with and without replacement are feasible, sampling without replacement is preferred because of the reduction in variance from the sampling fraction. The proposed algorithm uses sequential sampling to compute an approximation within a user-chosen margin of error.     

Estimating extreme bivariate quantile regions

When simultaneously monitoring two possibly dependent, positive risks one is often interested in quantile regions with very small probability p. These extreme quantile regions contain hardly any or no data and therefore statistical inference is difficult. In particular when we want to protect ourselves against a calamity that has not yet occurred, we need to deal with probabilities p?<?1/n, with n the sample size. We consider quantile regions of the form {(x, y)?∈?(0, ∞?)²: f(x, y)?≤?β}, where f, the joint density, is decreasing in both coordinates. Such a region has the property that it consists of the less likely points and hence that its complement is as small as possible. Using extreme value theory, we construct a natural, semiparametric estimator of such a quantile region and prove a refined form of consistency. A detailed simulation study shows the very good statistical performance of the estimated quantile regions. We also apply the method to find extreme risk regions for bivariate insurance claims.     

Integrated squared error of kernel-type estimator of distribution function

Let X ₁ ,...,X _n be a random sample drawn from distribution function F(x) with density function f(x) and suppose we want to estimate X(x). It is already shown that kernel estimator of F(x) is better than usual empirical distribution function in the sense of mean integrated squared error. In this paper we derive integrated squared error of kernel estimator and compare the error with that of the empirical distribution function. It is shown that the superiority of kernel estimators is not necessarily true in the sense of integrated squared error.     

Asymptotic properties of sample quantiles from a finite population

In this paper we consider the problem of estimating quantiles of a finite population of size N on the basis of a finite sample of size n selected without replacement. We prove the asymptotic normality of the sample quantile and show that the scaled variance of the sample quantile converges to the asymptotic variance under a slight moment condition. We also consider the performance of the bootstrap in this case, and find that the usual (Efron’s) bootstrap method fails to be consistent, but a suitably modified version of the bootstrapped quantile converges to the same asymptotic distribution as the sample quantile. Consistency of the modified bootstrap variance estimate is also proved under the same moment conditions.     

Asymptotic normality of Powell’s kernel estimator

We establish asymptotic normality of Powell’s kernel estimator for the asymptotic covariance matrix of the quantile regression estimator for both i.i.d. and weakly dependent data. As an application, we derive the optimal bandwidth that minimizes the approximate mean squared error of the kernel estimator. We also derive the corresponding results to censored quantile regression.     

Estimation of conditional laws given an extreme component

Let (X,Y) be a bivariate random vector. The estimation of a probability of the form P(Y ≤ y |X > t) is challenging when t is large, and a fruitful approach consists in studying, if it exists, the limiting conditional distribution of the random vector (X,Y), suitably normalized, given that X is large. There already exists a wide literature on bivariate models for which this limiting distribution exists. In this paper, a statistical analysis of this problem is done. Estimators of the limiting distribution (which is assumed to exist) and the normalizing functions are provided, as well as an estimator of the conditional quantile function when the conditioning event is extreme. Consistency of the estimators is proved and a functional central limit theorem for the estimator of the limiting distribution is obtained. The small sample behavior of the estimator of the conditional quantile function is illustrated through simulations. Some real data are analysed.     

Convergence rates in density estimation for data from infinite-order moving average processes

Summary The effect of long-range dependence in nonparametric probability density estimation is investigated under the assumption that the observed data are a sample from a stationary, infinite-order moving average process. It is shown that to first order, the mean integrated squared error (MISE) of a kernel estimator for moving average data may be expanded as the sum of MISE of the kernel estimator for a same-sizerandom sample, plus a term proportional to the variance of the moving average sample mean. The latter term does not depend on bandwidth, and so imposes a ceiling on the convergence rate of a kernel estimator regardless of how bandwidth is chosen. This ceiling can be quite significant in the case of long-range dependence. We show thatall density estimators have the convergence rate ceiling possessed by kernel estimators.The research of Dr. Hart was done while he was visiting the Australian National University, and was supported in part by ONR Contract N00014-85-K-0723     

Error density estimation in high-dimensional sparse linear model

This paper is concerned with the error density estimation in high-dimensional sparse linear model, where the number of variables may be larger than the sample size. An improved two-stage refitted cross-validation procedure by random splitting technique is used to obtain the residuals of the model, and then traditional kernel density method is applied to estimate the error density. Under suitable sparse conditions, the large sample properties of the estimator including the consistency and asymptotic normality, as well as the law of the iterated logarithm are obtained. Especially, we gave the relationship between the sparsity and the convergence rate of the kernel density estimator. The simulation results show that our error density estimator has a good performance. A real data example is presented to illustrate our methods.