Adaptive wavelet estimation of a density from mixtures under multiplicative censoring

In this paper, a mixture model under multiplicative censoring is considered. We investigate the estimation of a component of the mixture (a density) from the observations. A new adaptive estimator based on wavelets and a hard thresholding rule is constructed for this problem. Under mild assumptions on the model, we study its asymptotic properties by determining an upper bound of the mean integrated squared error over a wide range of Besov balls. We prove that the obtained upper bound is sharp.     

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.     

Data‐driven choice of the smoothing parametrization for kernel density estimators

There are several levels of sophistication when specifying the bandwidth matrix H to be used in a multivariate kernel density estimator, including H to be a positive multiple of the identity matrix, a diagonal matrix with positive elements or, in its most general form, a symmetric positive‐definite matrix. In this paper, the author proposes a data‐based method for choosing the smoothing parametrization to be used in the kernel density estimator. The procedure is fully illustrated by a simulation study and some real data examples. The Canadian Journal of Statistics © 2009 Statistical Society of Canada     

Extreme quantiles and tail index of a distribution based on kernel estimator

In this paper, we reveal the relationship between the tail exponent introduced by Parzen (1979) and tail index for a distribution function. Furthermore, we analyze the domain of attraction of the weighted sum of the distributions and its tail index. We show that the extreme quantiles can estimate directly, through knowing only the tail index of the kernel distribution function used in estimating the distribution function. Moreover, we give a smoothing parameter of extreme quantiles, which does not depend on any distribution function. The simulations and the application to reals data show that the proposed smoothed parameter gives better results for a heavy-tailed distribution, and for small sizes sample in extremes level.     

Subset selection of superior populations when the number of populations is large

The situation where k populations are partitioned into one inferior group and one superior group is considered. The statistical problem is to select a random size subset of superior populations while trying to avoid including any inferior populations. A selection procedure is assumed to satisfy the condition that the probability of selecting at least one superior population is bounded below by P¹<1. The performance of a procedure is measured by the probability of including an inferior population.The asymptotic performance, as k→∞ of Gupta's traditional maximum type procedure ψ^G is considered in the location-model. For normally distributed populations, ψ^G turns out to be asymptotically optimal, provided the size of the inferior group does not become infinitely larger than the size of the superior group.     

Estimation of a quadratic regression functional using the sinc kernel

We use the sinc kernel to construct an estimator for the integrated squared regression function. Asymptotic normality of the estimator at different rates is established, depending on whether the regression function vanishes or not.     

Berry-Esseen-type bounds for the kernel estimator of conditional distribution and conditional quantiles

Berry-Esseen bounds of order O(n^−1/2) have been obtained for several classes of statistics. In this paper, the rates of convergence in central limit theorem for conditional empirical functions and conditional sample quantiles based on kernel estimators are studied for both conditional and unconditional distributions.     

On a fisherian detour of the step-down procedure for manova

The well known step-down procedure for MANOVA given by J. Roy (1958) can be modified by combining the step-down tests using a B-optimal combination method such as Fisher's. The Fisherian detour of the stepwise MANOVA is shown to be asymptotically equivalent to the likelihood ratio test.     

Self‐consistent estimation of mean response functions and their derivatives

Many methods have been developed for the nonparametric estimation of a mean response function, but most of these methods do not lend themselves to simultaneous estimation of the mean response function and its derivatives. Recovering derivatives is important for analyzing human growth data, studying physical systems described by differential equations, and characterizing nanoparticles from scattering data. In this article the authors propose a new compound estimator that synthesizes information from numerous pointwise estimators indexed by a discrete set. Unlike spline and kernel smooths, the compound estimator is infinitely differentiable; unlike local regression smooths, the compound estimator is self‐consistent in that its derivatives estimate the derivatives of the mean response function. The authors show that the compound estimator and its derivatives can attain essentially optimal convergence rates in consistency. The authors also provide a filtration and extrapolation enhancement for finite samples, and the authors assess the empirical performance of the compound estimator and its derivatives via a simulation study and an application to real data. The Canadian Journal of Statistics 39: 280–299; 2011 © 2011 Statistical Society of Canada     

A class of tests for testing ‘new is better than used’

A class of tests is proposed for testing H₀ F?(x) = e^?λx, λ > 0, x≥0 vs. H₁ F?(x + y) ≤ F?(x)F?(y), x, y≥0, with strict inequality for some x, y ≥ 0 (F = new is better than used). Efficiency comparisons of some tests within the class are made and a new test is proposed on the basis of these comparisons. Consistency and the asymptotic normality of the class of tests is proved under fairly broad conditions on the underlying entities.     

Asymptotic distribution of data-driven smoothers in density and regression estimation under dependence

We consider automatic data-driven density, regression and autoregression estimates, based on any random bandwidth selector h/_T. We show that in a first-order asymptotic approximation they behave as well as the related estimates obtained with the “optimal” bandwidth h_T as long as h_T/h_T → 1 in probability. The results are obtained for dependent observations; some of them are also new for independent observations.     

Asymptotic distributions of functions of a sample covariance matrix under the elliptical distribution

This paper is concerned with asymptotic distributions of functions of a sample covariance matrix under the elliptical model. Simple but useful formulae for calculating asymptotic variances and covariances of the functions are derived. Also, an asymptotic expansion formula for the expectation of a function of a sample covariance matrix is derived; it is given up to the second-order term with respect to the inverse of the sample size. Two examples are given: one of calculating the asymptotic variances and covariances of the stepdown multiple correlation coefficients, and the other of obtaining the asymptotic expansion formula for the moments of sample generalized variance.     

Rate of strong uniform convergence of k-NN density estimates

Let f_n(x) be the univariate k-nearest neighbor (k-NN) density estimate proposed by Loftsgaarden and Quesenberry (1965). By using similar techniques as in Bahadur's representation of sample quantiles (1966), and by the recent results on the oscillation of empirical processes by Stute (1982), we derive the rate of strong uniform convergence of f_n(x) on some suitably chosen interval J_δ. Some comparison with the kernel estimates is given, as well as the choice of the bandwidth sequence relative to the sample size.