On the block thresholding wavelet estimators with censored data

We consider block thresholding wavelet-based density estimators with randomly right-censored data and investigate their asymptotic convergence rates. Unlike for the complete data case, the empirical wavelet coefficients are constructed through the Kaplan-Meier estimators of the distribution functions in the censored data case. On the basis of a result of Stute [W. Stute, The central limit theorem under random censorship, Ann. Statist. 23 (1995) 422-439] that approximates the Kaplan-Meier integrals as averages of i.i.d. random variables with a certain rate in probability, we can show that these wavelet empirical coefficients can be approximated by averages of i.i.d. random variables with a certain error rate in L². Therefore we can show that these estimators, based on block thresholding of empirical wavelet coefficients, achieve optimal convergence rates over a large range of Besov function classes , p≥2, q≥1 and nearly optimal convergence rates when 1≤p<2. We also show that these estimators achieve optimal convergence rates over a large class of functions that involve many irregularities of a wide variety of types, including chirp and Doppler functions, and jump discontinuities. Therefore, in the presence of random censoring, wavelet estimators still provide extensive adaptivity to many irregularities of large function classes. The performance of the estimators is tested via a modest simulation study.     

A semiparametric density estimator based on elliptical distributions

In the paper we study a semiparametric density estimation method based on the model of an elliptical distribution. The method considered here shows a way to overcome problems arising from the curse of dimensionality. The optimal rate of the uniform strong convergence of the estimator under consideration coincides with the optimal rate for the usual one-dimensional kernel density estimator except in a neighbourhood of the mean. Therefore the optimal rate does not depend on the dimension. Moreover, asymptotic normality of the estimator is proved.     

Strong convergence in nonparametric regression with truncated dependent data

In this paper we derive rates of uniform strong convergence for the kernel estimator of the regression function in a left-truncation model. It is assumed that the lifetime observations with multivariate covariates form a stationary α-mixing sequence. The estimation of the covariate’s density is considered as well. Under the assumption that the lifetime observations are bounded, we show that, by an appropriate choice of the bandwidth, both estimators of the covariate’s density and regression function attain the optimal strong convergence rate known from independent complete samples.     

Variance function estimation in multivariate nonparametric regression with fixed design

Variance function estimation in multivariate nonparametric regression is considered and the minimax rate of convergence is established in the iid Gaussian case. Our work uses the approach that generalizes the one used in [A. Munk, Bissantz, T. Wagner, G. Freitag, On difference based variance estimation in nonparametric regression when the covariate is high dimensional, J. R. Stat. Soc. B 67 (Part 1) (2005) 19-41] for the constant variance case. As is the case when the number of dimensions d=1, and very much contrary to standard thinking, it is often not desirable to base the estimator of the variance function on the residuals from an optimal estimator of the mean. Instead it is desirable to use estimators of the mean with minimal bias. Another important conclusion is that the first order difference based estimator that achieves minimax rate of convergence in the one-dimensional case does not do the same in the high dimensional case. Instead, the optimal order of differences depends on the number of dimensions.     

Superefficient estimation of the marginals by exploiting knowledge on the copula

We consider the problem of estimating the marginals in the case where there is knowledge on the copula. If the copula is smooth, it is known that it is possible to improve on the empirical distribution functions: optimal estimators still have a rate of convergence n^−1/2, but a smaller asymptotic variance. In this paper we show that for non-smooth copulas it is sometimes possible to construct superefficient estimators of the marginals: we construct both a copula and, exploiting the information our copula provides, estimators of the marginals with the rate of convergence logn/n.     

Estimating the inter-arrival time density of Markov renewal processes under structural assumptions on the transition distribution

We consider a stationary Markov renewal process whose inter-arrival time density depends multiplicatively on the distance between the past and present state of the embedded chain. This is appropriate when the jump size is governed by influences that accumulate over time. Then we can construct an estimator for the inter-arrival time density that has the parametric rate of convergence. The estimator is a local von Mises statistic. The result carries over to the corresponding semi-Markov process.     

Using wavelet methods to solve noisy Abel-type equations with discontinuous inputs

One way of estimating a function from indirect, noisy measurements is to regularise an inverse of its Fourier transformation, using properties of the adjoint of the transform that degraded the function in the first place. It is known that when the function is smooth, this approach can perform well and produce estimators that have optimal convergence rates. When the function is unsmooth, in particular when it suffers jump discontinuities, an analogue of this approach is to invert the wavelet transform and use thresholding to decide whether wavelet terms should be included or excluded in the final approximation. We evaluate the performance of this approach by applying it to a large class of Abel-type transforms, and show that the smoothness of the target function and the smoothness of the transform interact in a particularly subtle way to determine the overall convergence rate. The most serious difficulties arise when the target function has a jump discontinuity at the origin; this has a considerably greater, and deleterious, impact on performance than a discontinuity elsewhere. In the absence of a discontinuity at the origin, the rate of convergence is determined principally by an inequality between the smoothness of the function and the smoothness of the transform.     

An estimator for the quadratic covariation of asynchronously observed Itô processes with noise: Asymptotic distribution theory

The article is devoted to the nonparametric estimation of the quadratic covariation of non-synchronously observed Itô processes in an additive microstructure noise model. In a high-frequency setting, we aim at establishing an asymptotic distribution theory for a generalized multiscale estimator including a feasible central limit theorem with optimal convergence rate on convenient regularity assumptions. The inevitably remaining impact of asynchronous deterministic sampling schemes and noise corruption on the asymptotic distribution is precisely elucidated. A case study for various important examples, several generalizations of the model and an algorithm for the implementation warrant the utility of the estimation method in applications.     

A note on nonparametric density estimation for dependent variables using a delta sequence

Summary A general method based on “delta sequences” due to Walter and Blum [12] is extended to sequences of strictly stationary mixing random variables having the same marginal distribution admitting a Lebesgue probability density function. It is proved that, under certain conditions, the rate of mean square convergence obtained in the i.i.d. case by Walter and Blum, continues to hold. University of Petroleum and Minerals     

K-sample subsampling in general spaces: The case of independent time series

The problem of subsampling in two-sample and K-sample settings is addressed where both the data and the statistics of interest take values in general spaces. We focus on the case where each sample is a stationary time series, and construct subsampling confidence intervals and hypothesis tests with asymptotic validity. Some examples are also given, and the problem of optimal block size choice is discussed.     

Optimal rates of convergence in the Weibull model based on kernel-type estimators

Let F be a distribution function in the maximal domain of attraction of the Gumbel distribution such that −log(1−F(x))=x^1/θL(x) for a positive real number θ, called the Weibull tail index, and a slowly varying function L. It is well known that the estimators of θ have a very slow rate of convergence. We establish here a sharp optimality result in the minimax sense, that is when L is treated as an infinite dimensional nuisance parameter belonging to some functional class. We also establish the rate optimal asymptotic property of a data-driven choice of the sample fraction that is used for estimation.     

On rates of convergence in functional linear regression

This paper investigates the rate of convergence of estimating the regression weight function in a functional linear regression model. It is assumed that the predictor as well as the weight function are smooth and periodic in the sense that the derivatives are equal at the boundary points. Assuming that the functional data are observed at discrete points with measurement error, the complex Fourier basis is adopted in estimating the true data and the regression weight function based on the penalized least-squares criterion. The rate of convergence is then derived for both estimators. A simulation study is also provided to illustrate the numerical performance of our approach, and to make a comparison with the principal component regression approach.     

An adaptive wavelet shrinkage approach to the Spektor-Lord-Willis problem

The stereological problem of unfolding the sphere size distribution from linear sections is considered. A minimax estimator of the intensity function of a Poisson process that describes the problem is introduced and an adaptive estimator is constructed that achieves the optimal rate of convergence over Besov balls to within logarithmic factors. The construction of these estimators uses Wavelet-Vaguelette Decomposition (WVD) of the operator that defines our inverse problem.     

Estimating the support of multivariate densities under measurement error

We consider the problem of estimating the support of a multivariate density based on contaminated data. We introduce an estimator, which achieves consistency under weak conditions on the target density and its support, respecting the assumption of a known error density. Especially, no smoothness or sharpness assumptions are needed for the target density. Furthermore, we derive an iterative and easily computable modification of our estimation and study its rates of convergence in a special case; a numerical simulation is given.     

On the risk of estimates for block decreasing densities

A density f=f(x₁,…,x_d) on [0,∞)^d is block decreasing if for each j∈{1,…,d}, it is a decreasing function of x_j, when all other components are held fixed. Let us consider the class of all block decreasing densities on [0,1]^d bounded by B. We shall study the minimax risk over this class using n i.i.d. observations, the loss being measured by the L₁ distance between the estimate and the true density. We prove that if S=log(1+B), lower bounds for the risk are of the form C(S^d/n)^1/(d+2), where C is a function of d only. We also prove that a suitable histogram with unequal bin widths as well as a variable kernel estimate achieve the optimal multivariate rate. We present a procedure for choosing all parameters in the kernel estimate automatically without loosing the minimax optimality, even if B and the support of f are unknown.     

A note on testing hypotheses for stationary processes in the frequency domain

In a recent paper, Eichler (2008) [11] considered a class of non- and semiparametric hypotheses in multivariate stationary processes, which are characterized by a functional of the spectral density matrix. The corresponding statistics are obtained using kernel estimates for the spectral distribution and are asymptotically normally distributed under the null hypothesis and local alternatives. In this paper, we derive the asymptotic properties of these test statistics under fixed alternatives. In particular, we also show weak convergence but with a different rate compared to the null hypothesis. We also discuss potential statistical applications of the asymptotic theory by means of a small simulation study.     

Sieve maximum likelihood estimation for doubly semiparametric zero-inflated Poisson models

For nonnegative measurements such as income or sick days, zero counts often have special status. Furthermore, the incidence of zero counts is often greater than expected for the Poisson model. This article considers a doubly semiparametric zero-inflated Poisson model to fit data of this type, which assumes two partially linear link functions in both the mean of the Poisson component and the probability of zero. We study a sieve maximum likelihood estimator for both the regression parameters and the nonparametric functions. We show, under routine conditions, that the estimators are strongly consistent. Moreover, the parameter estimators are asymptotically normal and first order efficient, while the nonparametric components achieve the optimal convergence rates. Simulation studies suggest that the extra flexibility inherent from the doubly semiparametric model is gained with little loss in statistical efficiency. We also illustrate our approach with a dataset from a public health study.     

Rates of convergence for partitioning and nearest neighbor regression estimates with unbounded data

Estimation of regression functions from independent and identically distributed data is considered. The L₂ error with integration with respect to the design measure is used as an error criterion. Usually in the analysis of the rate of convergence of estimates besides smoothness assumptions on the regression function and moment conditions on Y also boundedness assumptions on X are made. In this article we consider partitioning and nearest neighbor estimates and show that by replacing the boundedness assumption on X by a proper moment condition the same rate of convergence can be shown as for bounded data.     

Functional nonparametric estimation of conditional extreme quantiles

We address the estimation of quantiles from heavy-tailed distributions when functional covariate information is available and in the case where the order of the quantile converges to one as the sample size increases. Such “extreme” quantiles can be located in the range of the data or near and even beyond the boundary of the sample, depending on the convergence rate of their order to one. Nonparametric estimators of these functional extreme quantiles are introduced, their asymptotic distributions are established and their finite sample behavior is investigated.     

On estimation of the L r norm of a regression function

f be observed with noise. In the present paper we study the problem of nonparametric estimation of certain nonsmooth functionals of f, specifically, L _r norms ||f|| _r of f. Known from the literature results on functional estimation deal mostly with two extreme cases: estimating a smooth (differentiable in L ₂ ) functional or estimating a singular functional like the value of f at certain point or the maximum of f. In the first case, the convergence rate typically is n ^−1/2, n being the number of observations. In the second case, the rate of convergence coincides with the one of estimating the function f itself in the corresponding norm. We show that the case of estimating ||f|| _r is in some sense intermediate between the above extremes. The optimal rate of convergence is worse than n ^−1/2 but is better than the rate of convergence of nonparametric estimates of f. The results depend on the value of r. For r even integer, the rate occurs to be n ^{−β/(2β+1−1/r)} where β is the degree of smoothness. If r is not an even integer, then the nonparametric rate n ^{−β/(2β+1)} can be improved, but only by a logarithmic in n factor. Received: 6 February 1996hinspaceairsp/Revised version: 10 June 1998