Pre-averaged kernel estimators for the drift function of a diffusion process in the presence of microstructure noise

We consider estimation of the drift function of a stationary diffusion process when we observe high-frequency data with microstructure noise over a long time interval. We propose to estimate the drift function at a point by a Nadaraya–Watson estimator that uses observations that have been pre-averaged to reduce the noise. We give conditions under which our estimator is consistent and asympotically normal. Its rate and asymptotic bias and variance are the same as those without microstructure noise. To use our method in data analysis, we propose a data-based cross-validation method to determine the bandwidth in the Nadaraya–Watson estimator. Via simulation, we study several methods of bandwidth choices, and compare our estimator to several existing estimators. In terms of mean squared error, our new estimator outperforms existing estimators.     

Estimators of the regression parameters of the zeta distribution

The zeta distribution with regression parameters has been rarely used in statistics because of the difficulty of estimating the parameters by traditional maximum likelihood. We propose an alternative method for estimating the parameters based on an iteratively reweighted least-squares algorithm. The quadratic distance estimator (QDE) obtained is consistent, asymptotically unbiased and normally distributed; the estimate can also serve as the initial value required by an algorithm to maximize the likelihood function. We illustrate the method with a numerical example from the insurance literature; we compare the values of the estimates obtained by the quadratic distance and maximum likelihood methods and their approximate variance–covariance matrix. Finally, we calculate the bias, variance and the asymptotic efficiency of the QDE compared to the maximum likelihood estimator (MLE) for some values of the parameters.     

Estimating a density under pointwise constraints on the derivatives

Suppose we want to estimate a density at a point where we know the values of its first or higher order derivatives. In this case a given kernel estimator of the density can be modified by adding appropriately weighted kernel estimators of these derivatives. We give conditions under which the modified estimators are asymptotically normal. We also determine the optimal weights. When the highest derivative is known to vanish at a point, then the bias is asymptotically negligible at that point and the asymptotic variance of the kernel estimator can be made arbitrarily small by choosing a large bandwidth.     

The impact of sampling methods on bias and variance in stochastic linear programs

Stochastic linear programs can be solved approximately by drawing a subset of all possible random scenarios and solving the problem based on this subset, an approach known as sample average approximation (SAA). The value of the objective function at the optimal solution obtained via SAA provides an estimate of the true optimal objective function value. This estimator is known to be optimistically biased; the expected optimal objective function value for the sampled problem is lower (for minimization problems) than the optimal objective function value for the true problem. We investigate how two alternative sampling methods, antithetic variates (AV) and Latin Hypercube (LH) sampling, affect both the bias and variance, and thus the mean squared error (MSE), of this estimator. For a simple example, we analytically express the reductions in bias and variance obtained by these two alternative sampling methods. For eight test problems from the literature, we computationally investigate the impact of these sampling methods on bias and variance. We find that both sampling methods are effective at reducing mean squared error, with Latin Hypercube sampling outperforming antithetic variates. For our analytic example and the eight test problems we derive or estimate the condition number as defined in Shapiro et al. (Math. Program. 94:1–19, 2002). We find that for ill-conditioned problems, bias plays a larger role in MSE, and AV and LH sampling methods are more likely to reduce bias.     

Cross-validated bagged learning

Many applications aim to learn a high dimensional parameter of a data generating distribution based on a sample of independent and identically distributed observations. For example, the goal might be to estimate the conditional mean of an outcome given a list of input variables. In this prediction context, bootstrap aggregating (bagging) has been introduced as a method to reduce the variance of a given estimator at little cost to bias. Bagging involves applying an estimator to multiple bootstrap samples and averaging the result across bootstrap samples. In order to address the curse of dimensionality, a common practice has been to apply bagging to estimators which themselves use cross-validation, thereby using cross-validation within a bootstrap sample to select fine-tuning parameters trading off bias and variance of the bootstrap sample-specific candidate estimators. In this article we point out that in order to achieve the correct bias variance trade-off for the parameter of interest, one should apply the cross-validation selector externally to candidate bagged estimators indexed by these fine-tuning parameters. We use three simulations to compare the new cross-validated bagging method with bagging of cross-validated estimators and bagging of non-cross-validated estimators.     

Quantile regression for right-censored and length-biased data

Length-biased data arise in many important fields, including epidemiological cohort studies, cancer screening trials and labor economics. Analysis of such data has attracted much attention in the literature. In this paper we propose a quantile regression approach for analyzing right-censored and length-biased data. We derive an inverse probability weighted estimating equation corresponding to the quantile regression to correct the bias due to length-bias sampling and informative censoring. This method can easily handle informative censoring induced by length-biased sampling. This is an appealing feature of our proposed method since it is generally difficult to obtain unbiased estimates of risk factors in the presence of length-bias and informative censoring. We establish the consistency and asymptotic distribution of the proposed estimator using empirical process techniques. A resampling method is adopted to estimate the variance of the estimator. We conduct simulation studies to evaluate its finite sample performance and use a real data set to illustrate the application of the proposed method.     

α－混合过程条件密度的估计及其性质

本文在{Xr,t∈N）是一个严平稳过程的假设下,用核估计的方法对未来状态XN＋T的条件密度进行估计．在假设{Xt,t∈N）是α-混合过程的情况下,讨论了过程有限维密度核估计的期望与方差,以及过程条件密度核估计的偏及均方误差．在一定条件下,证明了估计的弱收敛性．     

方差分量的二次不变估计的非负改进

研究一类方差分量模型中的方差分量的估计改进问题,首先在含两个方差分量模型中给出σ21二次型估计类,并且此估计类还具有无偏性和不变性.考虑二次损失(δ-θ)2,在此估计类基础上放弃无偏性进行非负改进,不仅得到优于二次不变无偏估计类的σ21的非负二次不变估计类,而且还说明了它优于方差分析估计和最小均方误差估计,文献[5]中给出s>2时的非负改进,但是非负改进存在是有条件的,本文克服了这个缺陷.最后给出了非负改进存在的充分必要条件.     

对于部分线性模型的乘积调整半参估计

本文使用一种带有乘积调整的半参方法估计部分线性模型的非参数部分并给出所得估计的渐近性质。与传统的非参估计方法相比,我们所使用的半参数方法能够有效的降低所得估计的偏差,而方差不受影响。因此在积分均方误差(MISE)的意义下,该半参数方法要优于传统的估计方法。数值模拟也表明了这一点.     

Optimal variance estimation based on lagged second-order difference in nonparametric regression

Differenced estimators of variance bypass the estimation of regression function and thus are simple to calculate. However, there exist two problems: most differenced estimators do not achieve the asymptotic optimal rate for the mean square error; for finite samples the estimation bias is also important and not further considered. In this paper, we estimate the variance as the intercept in a linear regression with the lagged Gasser-type variance estimator as dependent variable. For the equidistant design, our estimator is not only \(n^{1/2}\)-consistent and asymptotically normal, but also achieves the optimal bound in terms of estimation variance with less asymptotic bias. Simulation studies show that our estimator has less mean square error than some existing differenced estimators, especially in the cases of immense oscillation of regression function and small-sized sample.     

Franchissements de niveaux pour un processus à trajectoires régulières et estimation adaptative à partir d'observations discrétisées

We estimate the mean number of level upcrossings for a continuous stationary process with regular trajectories from discretized observations. We apply a non parametric estimator such that the joint probability density function of the process and its derivative is approximated by a polynomial perturbation of the product of the marginal densities. We evaluate the bias and the variance of this estimator with respect to the number of observations, the discretization step and the dimension of the polynomial space.     

Estimating and Visualizing Conditional Densities

Abstract

We consider the kernel estimator of conditional density and derive its asymptotic bias, variance, and mean-square error. Optimal bandwidths (with respect to integrated mean-square error) are found and it is shown that the convergence rate of the density estimator is order n ^–2/3. We also note that the conditional mean function obtained from the estimator is equivalent to a kernel smoother. Given the undesirable bias properties of kernel smoothers, we seek a modified conditional density estimator that has mean equivalent to some other nonparametric regression smoother with better bias properties. It is also shown that our modified estimator has smaller mean square error than the standard estimator in some commonly occurring situations. Finally, three graphical methods for visualizing conditional density estimators are discussed and applied to a data set consisting of maximum daily temperatures in Melbourne, Australia.     

Performance of some boundary-seeking mode estimators on the dome bias model

Expert estimates can be systematically biased for various reasons. The dome perspective bias model provides one instance of this phenomenon. Given data with this suspected property, it is desirable to propose mode estimators which have the capability of producing consensus estimates on the boundary of the convex hull of the sample. Affine linear models are no doubt the simplest class of functions with that capability. This paper uses the maximum decisional efficiency (MDE) principle to estimate the parameters of an affine linear group value function. These estimators vary according to the sample aggregator chosen. Estimators are developed or approximated for the aggregator choices of (i) mean, (ii) minimum or Leontief, and (iii) variance. The respective performances of these estimators are assessed and compared on the dome perspective bias model using Monte Carlo simulation experiments. The estimator based on the mean performed uniformly well on a variety of simulated cases. However, those based on range and variance were not effective.     

Blind SNR estimation for limited time series

A blind SNR estimation method for discrete data is presented. The original noise-free data is assumed to follow a known signal model with an unknown attenuation. The SNR in noisy data is estimated using a polynomial fit obtained from the correlative characteristics between SNR and variance fractal dimension values. The bias and the “standard error” (root mean square error) of the estimator are used as performance measures. The simulated performance of the estimator for a specific signal model with real additive white Gaussian noise assumption is compared to that of a published decision-aided (nonblind) SNR estimator.     

One-stage and two-stage DEA estimation of the effects of contextual variables

Two-stage data envelopment analysis (2-DEA) is commonly used in productive efficiency analysis to estimate the effects of operational conditions and practices on performance. In this method the DEA efficiency estimates are regressed on contextual variables representing the operational conditions. We re-examine the statistical properties of the 2-DEA estimator, and find that it is statistically consistent under more general conditions than earlier studies assume. We further show that the finite sample bias of DEA in the first stage carries over to the second stage regression, causing bias in the estimated coefficients of the contextual variables. This bias is particularly severe when the contextual variables are correlated with inputs. To address this shortcoming, we apply the result that DEA can be formulated as a constrained special case of the convex nonparametric least squares (CNLS) regression. Applying the CNLS formulation, we develop a new semi-nonparametric one-stage estimator for the coefficients of the contextual variables that directly incorporates contextual variables to the standard DEA problem. The proposed method is hence referred to as one-stage DEA (1-DEA). Evidence from Monte Carlo simulations suggests that the new 1-DEA estimator performs systematically better than the conventional 2-DEA estimator both in deterministic and noisy scenarios.     

Data sharpening methods in multivariate local quadratic regression

This paper is concerned with the conditional bias and variance of local quadratic regression to the multivariate predictor variables. Data sharpening methods of nonparametric regression were first proposed by Choi, Hall, Roussion. Recently, a data sharpening estimator of local linear regression was discussed by Naito and Yoshizaki. In this paper, to improve mainly the fitting precision, we extend their results on the asymptotic bias and variance. Using the data sharpening estimator of multivariate local quadratic regression, we are able to derive higher fitting precision. In particular, our approach is simple to implement, since it has an explicit form, and is convenient when analyzing the asymptotic conditional bias and variance of the estimator at the interior and boundary points of the support of the density function.     

A bias corrected nonparametric regression estimator

In this article, we propose a new method of bias reduction in nonparametric regression estimation. The proposed new estimator has asymptotic bias order h⁴, where h is a smoothing parameter, in contrast to the usual bias order h² for the local linear regression. In addition, the proposed estimator has the same order of the asymptotic variance as the local linear regression. Our proposed method is closely related to the bias reduction method for kernel density estimation proposed by Chung and Lindsay (2011). However, our method is not a direct extension of their density estimate, but a totally new one based on the bias cancelation result of their proof.     

A Smirnov–Bickel–Rosenblatt Theorem for Compactly-Supported Wavelets

In nonparametric statistical problems, we wish to find an estimator of an unknown function f. We can split its error into bias and variance terms; Smirnov, Bickel and Rosenblatt have shown that, for a histogram or kernel estimate, the supremum norm of the variance term is asymptotically distributed as a Gumbel random variable. In the following, we prove a version of this result for estimators using compactly-supported wavelets, a popular tool in nonparametric statistics. Our result relies on an assumption on the nature of the wavelet, which must be verified by provably-good numerical approximations. We verify our assumption for Daubechies wavelets and symlets, with N=6,…,20 vanishing moments; larger values of N, and other wavelet bases, are easily checked, and we conjecture that our assumption holds also in those cases.     

On kernel method for sliced average variance estimation

In this paper, we use the kernel method to estimate sliced average variance estimation (SAVE) and prove that this estimator is both asymptotically normal and root n consistent. We use this kernel estimator to provide more insight about the differences between slicing estimation and other sophisticated local smoothing methods. Finally, we suggest a Bayes information criterion (BIC) to estimate the dimensionality of SAVE. Examples and real data are presented for illustrating our method.     

纵向数据边际模型非参数光滑方法的比较

对于纵向数据边际模型的均值函数, 有很多非参数估计方法, 其中回归样条, 光滑样条, 似乎不相关(SUR)核估计等方法在工作协方差阵正确指定时具有最小的渐近方差. 回归样条的渐近偏差与工作协方差阵无关, 而SUR核估计和光滑样条估计的渐近偏差却依赖于工作协方差阵. 本文主要研究了回归样条, 光滑样条和SUR核估计的效率问题. 通过模拟比较发现回归样条估计的表现比较稳定, 在大多数情况下比光滑样条估计和SUR核估计的效率高.