In this paper we obtain uniform upper bounds for the $L_1$ error of kernel estimators in estimating monotone densities and densities of bounded variation. The bounds are nonasymptotic and optimal in $n$, the sample size. For the bounded variation class, it is also optimal wrt an upper bound of the total variation. The proofs employ a one-sided kernel technique and are extremely simple.
We consider the problem of bandwidth selection for kernel density estimators. Let $H_n$ denote the bandwidth computed by the least squares cross-validation method. Furthermore, let $H^\ast_n$ and $h^\ast_n$ denote the minimizers of the integrated squared error and the mean integrated squared error, respectively. The main theorem establishes asymptotic normality of $H_n - H^\ast_n$ and $H_n - h^\ast_n$, for three classes of densities with comparable smoothness properties.…
Adaptive nonparametric kernel estimators for the location of a peak of the spectral density of a stationary time series are proposed and investigated. They are based on direct smoothing of the periodogram where the amount of smoothing is determined automatically in an asymptotically optimal fashion. These adaptive estimators minimize the asymptotic mean squared error. Adaptivity is derived from the weak convergence of a two-parameter stochastic process in a deviation and a…
We investigate some of the possibilities for improvement of univariate and multivariate kernel density estimates by varying the window over the domain of estimation, pointwise and globally. Two general approaches are to vary the window width by the point of estimation and by point of the sample observation. The first possibility is shown to be of little efficacy in one variable. In particular, nearest-neighbor estimators in all versions perform poorly in one and two…
We discuss procedures based on nonparametric regression for estimating the dominant Lyapunov Exponent λ1 from time series data generated by a nonlinear autoregressive system with additive noise. For systems with bounded fluctuations, λ1 > 0 is the defining feature of chaos. Thus our procedures can be used to examine time series data for evidence of chaotic dynamics. We show that a consistent estimator of the partial derivatives of the autoregression function can be used to…
SUMMARY A simple estimator for β is proposed for the model y = x'β + g(t)+ error, g smooth but unknown. The approach is to approximate the estimating equation obtained from a ***semiparametric likelihood and in the simplest case reduces to minimizing the distance between the 'pseudoresiduals' y - x'β and a local linear cross-validated estimate of them. When the errors are independent with finite variance, the bias and variance of the estimate are computed and compared…
SUMMARY We compare two estimators of error variance, both based on quadratic forms in the residuals about smoothing spline fits to data. The estimators are compared over the whole range of values of the smoothing parameter as well as for data-based choices of the smoothing parameter. We show that the commonly used estimator of variance has the serious drawback of underestimating the error variance for small choices of the smoothing parameter. This drawback is not shared by a…
Donald W. K. Andrews · J. Christopher Monahan·刊期 1992-07 · 卷 60(4)·Econometrica已编入正刊
改进的异方差与自相关一致协方差矩阵估计量AI 解读
This paper considers a new class of heteroskedasticity and autocorrelation consistent (HAC) covariance matrix estimators. The estimators considered are prewhitened kernel estimators with vector autoregressions employed in the prewhitening stage. The paper establishes consistency, rate of convergence, and asymptotic truncated mean squared error (MSE) results for the estimators when a fixed or automatic bandwidth procedure is employed. Conditions are obtained under which…
Sliced inverse regression [Li (1989), (1991) and Duan and Li (1991)] is a nonparametric method for achieving dimension reduction in regression problems. It is widely applicable, extremely easy to implement on a computer and requires no nonparametric smoothing devices such as kernel regression. If $Y$ is the response and $X \in \mathbf{R}^p$ is the predictor, in order to implement sliced inverse regression, one requires an estimate of $\Lambda = E\{\operatorname{cov}(X\mid Y)\} = \operatorname{cov}(X) - \operatorname{cov}\{E(X\mid Y)\}$…
A semiparametric method for estimating densities of normal mean mixtures is presented. This consistent data-driven method of estimation is based on probability spacings. The estimation technique involves iteratively fixing the standard deviation of the normal kernel that serves as a smoothing parameter, and then maximizing a function of the probability spacings over all mixing distributions. Based on the distribution of uniform spacings, a distribution free goodness-of-fit…
Suppose $X_1,X_2,\ldots,X_n$ are i.i.d. with unknown density $f$. There is a well-known expression for the asymptotic mean integrated squared error (MISE) in estimating $f$ by a kernel estimate $\hat{f}_n$, under certain conditions on $f$, the kernel and the bandwidth. Suppose that one would like to choose a sample size so that the MISE is smaller than some preassigned positive number $w$. Based on the asymptotic expression for the MISE, one can identify an appropriate…
It is argued that mean integrated squared error is not a useful measure of the performance of a variable bandwidth density estimator based on Abramson's square root law. The reason is that when the unknown density $f$ has even moderately light tails, properties of those tails drive the formula for optimal bandwidth, to the virtual exclusion of other properties of $f$. We suggest that weighted integrated squared error be employed as the performance criterion, using a weight…
Estimators for location and size of a discontinuity or change-point in an otherwise smooth regression model are proposed. The assumptions needed are much weaker than those made in parametric models. The proposed estimators apply as well to the detection of discontinuities in derivatives and therefore to the detection of change-points of slope and of higher order curvature. The proposed estimators are based on a comparison of left and right one-sided kernel smoothers. Weak…
Several authors have developed bootstrap methods for constructing confidence intervals in nonparametric regression. On each occasion a nonpivotal approach has been employed. Nonpivotal methods are still the overwhelmingly popular choice when statisticians use the bootstrap to compute confidence intervals, but they are not necessarily the most appropriate. In this paper we point out some of the theoretical advantages of pivoting. They include a reduction in the error of the…
An exact and easily computable expression for the mean integrated squared error (MISE) for the kernel estimator of a general normal mixture density, is given for Gaussian kernels of arbitrary order. This provides a powerful new way of understanding density estimation which complements the usual tools of simulation and asymptotic analysis. The family of normal mixture densities is very flexible and the formulae derived allow simple exact analysis for a wide variety of density…
The bootstrap is a poor estimator of bias in problems of curve estimation, and so bias must be corrected by other means when the bootstrap is used to construct confidence intervals for a probability density. Bias may either be estimated explicitly, or allowed for by undersmoothing the curve estimator. Which of these two approaches is to be preferred? In the present paper we address this question from the viewpoint of coverage accuracy, assuming a given number of derivatives…
Robert Kohn · Craig F. Ansley · Chi-Ming Wong·刊期 1992-06 · 卷 79(2)·Biometrika已编入正刊
具有自回归移动平均误差的非参数样条回归AI 解读
We estimate by spline nonparametric regression an unknown function observed with autocorrelated errors when the errors are modelled by an autoregressive moving average model. Unknown parameters are estimated by either maximum likelihood, cross-validation or generalized cross-validation. By expressing the problem in state space form we obtain O(n) algorithms to estimate the function and its derivatives and evaluate the marginal likelihood and cross-validation functions. The…
In a multiple time series regression model the residuals are heteroskedastic and serially correlated of unknown form. GLS estimates of the regression coefficients using kernel regression and spectral methods are shown to be adaptive, in the sense of having the same asymptotic distribution, to the first order, as GLS estimates based on knowledge of the actual heteroskedasticity and serial correlation. A Monte Carlo experiment about the performance of our estimator is…
Joel L. Horowitz·刊期 1992-05 · 卷 60(3)·Econometrica已编入正刊
二元响应模型的平滑最大得分估计量AI 解读
This paper describes a semiparametric estimator for binary response models in which there may be arbitrary heteroskedasticity of unknown form. The estimator is obtained by maximizing a smoothed version of the objective function of C. Manski's maximum score estimator. The smoothing procedure is similar to that used in kernel nonparametric density estimation. The resulting estimator's rate of convergence in probability is the fastest possible under the assumptions that are…
An adaptive maximum likelihood estimator based on the estimation of the log-density by $B$-splines is introduced. A data-driven method of selecting the smoothing parameter involved in the consequent density estimation is demonstrated. A Monte Carlo study is conducted to evaluate the small sample performance of the estimator in a location and a regression problem. The adaptive estimator is seen to compare favorably to some standard estimates. We show that the estimator is…
Ordinary smoothing splines have an integrated mean squared error which is dominated by bias contributions at the boundaries. When the estimated function has additional derivatives, the boundary contribution to the bias affects the asymptotic rate of convergence unless the derivatives of the estimated function meet the natural boundary conditions. This paper introduces relaxed boundary smoothing splines and shows that they obtain the optimal asymptotic rate of convergence…
An approach to bootstrapping kernel spectral density estimates is described which is based on resampling from the periodogram of the original data. We show that it is asymptotically valid under suitable conditions, and we illustrate its performance for a medium-sized time series sample with a small simulation study.
For $i = 1,2,\ldots$, let $X_i$ and $Y_i$ be $\mathbb{R}^d$-valued ($d \geq 1$ integer) and $\mathbb{R}$-valued, respectively, random variables, and let $\{(X_i, Y_i)\}, i \geq 1$, be a strictly stationary and $\alpha$-mixing stochastic process. Set $m(x) = \mathscr{E}(Y_1\mid X_1 = x), x \in \mathbb{R}^d$, and let $\hat{m}_n(x)$ be a certain recursive kernel estimate of $m(x)$. Under suitable regularity conditions and as $n \rightarrow \infty$, it is shown that $\hat{m}_n(x)$…
Methods for estimating nonparametric models for conditional quantiles are suggested based on the regression quantile methods of Koenker and Bassett. Spline parameterizations of the conditional quantile functions are used. The methods are illustrated by estimating hierarchical models for household electricity demand using data from the Chicago metropolitan area. The empirical results show that lower quantiles of demand (“base-load”) vary only slightly across residential…
Some Nonasymptotic Bounds for L1 Density Estimation using Kernels
In this paper we obtain uniform upper bounds for the L1 error of kernel estimators in estimating monotone densities and densities of bounded variation. The bounds are nonasymptotic and optimal in n, the sample size. For the bounded variation class, it is also optimal wrt an upper bound of the total variation. The proofs employ a one-sided kernel technique and are extremely simple.
We consider the problem of bandwidth selection for kernel density estimators. Let Hn denote the bandwidth computed by the least squares cross-validation method. Furthermore, let Hn∗ and hn∗ denote the minimizers of the integrated squared error and the mean integrated squared error, respectively. The main theorem establishes asymptotic normality of Hn−Hn∗ and Hn−hn∗, for three classes of densities with comparable smoothness properties.…
Sliced inverse regression [Li (1989), (1991) and Duan and Li (1991)] is a nonparametric method for achieving dimension reduction in regression problems. It is widely applicable, extremely easy to implement on a computer and requires no nonparametric smoothing devices such as kernel regression. If Y is the response and X∈Rp is the predictor, in order to implement sliced inverse regression, one requires an estimate of Λ=E{cov(X∣Y)}=cov(X)−cov{E(X∣Y)}…
Suppose X1,X2,…,Xn are i.i.d. with unknown density f. There is a well-known expression for the asymptotic mean integrated squared error (MISE) in estimating f by a kernel estimate f^n, under certain conditions on f, the kernel and the bandwidth. Suppose that one would like to choose a sample size so that the MISE is smaller than some preassigned positive number w. Based on the asymptotic expression for the MISE, one can identify an appropriate…
It is argued that mean integrated squared error is not a useful measure of the performance of a variable bandwidth density estimator based on Abramson's square root law. The reason is that when the unknown density f has even moderately light tails, properties of those tails drive the formula for optimal bandwidth, to the virtual exclusion of other properties of f. We suggest that weighted integrated squared error be employed as the performance criterion, using a weight…
An adaptive maximum likelihood estimator based on the estimation of the log-density by B-splines is introduced. A data-driven method of selecting the smoothing parameter involved in the consequent density estimation is demonstrated. A Monte Carlo study is conducted to evaluate the small sample performance of the estimator in a location and a regression problem. The adaptive estimator is seen to compare favorably to some standard estimates. We show that the estimator is…
For i=1,2,…, let Xi and Yi be Rd-valued (d≥1 integer) and R-valued, respectively, random variables, and let {(Xi,Yi)},i≥1, be a strictly stationary and α-mixing stochastic process. Set m(x)=E(Y1∣X1=x),x∈Rd, and let m^n(x) be a certain recursive kernel estimate of m(x). Under suitable regularity conditions and as n→∞, it is shown that m^n(x)…