A consistent nonparametric density estimator for the deconvolution problem

The problem of nonparametric estimation of a probability density function when the sample observations are contaminated with random noise is studied. A particular estimator f?_n(x) is proposed which uses kernel-density and deconvolution techniques. The estimator f?_n(x) is shown to be uniformly consistent, and its appearance and properties are affected by constants M_n and h_n which the user may choose. The optimal choices of M_n and h_n depend on the sample size n, the noise distribution, and the true distribution which is being estimated. Particular selections for M_n and h_n which minimize upper-bound functions of the mean squared error for f?_n(x) are recommended.     

Estimation of the derivative of a density and related functions

Let Y₁,…,Y _n, (Y₁ <Y₂<…<Y _n) be the order statistics of a random sample from a distribution F with density f on the realline. This paper gives a class of estimators of the derivativef'(x) of the density f at points x for which f has

a continuoussecond derivative. These estimators are based on spacings inthe order statistics Y_j+kn -y _j j = 1,…,n-k_n,k_n<n.     

New estimators of distribution functions

ABSTRACT

This article considers the estimation of a distribution function F_X(x) based on a random sample X₁, X₂, …, X_n when the sample is suspected to come from a close-by distribution F₀(x). The new estimators, namely the preliminary test (PTE) and Stein-type estimator (SE) are defined and compared with the “empirical distribution function” (edf) under local departure. In this case, we show that Stein-type estimators are superior to edf and PTE is superior to edf when it is close to F₀(x). As a by-product similar estimators are proposed for population quantiles.     

Simulations and computations of nonparametric density estimates for the deconvolution problem

The nonparametric density function estimation using sample observations which are contaminated with random noise is studied. The particular form of contamination under consideration is Y = X + Z, where Y is an observable random variableZ is a random noise variable with known distribution, and X is an absolutely continuous random variable which cannot be observed directly. The finite sample size performance of a strongly consistent estimator for the density function of the random variable X is illustrated for different distributions. The estimator uses Fourier and kernel function estimation techniques and allows the user to choose constants which relate to bandwidth windows and limits on integration and which greatly affect the appearance and properties of the estimates. Numerical techniques for computation of the estimated densities and for optimal selection of the constant are given.     

Estimating with percentile grouped and truncated date from a scale parameter distribution

Data which is grouped and truncated is considered. We are given numbers n₁<…<n_k=n and we observe X_ni ),i=1,…k, and the tottal number of observations available (N> n_k is unknown. If the underlying distribution has one unknown parameter θ which enters as a scale parameter, we examine the form of the equations for both conditional, unconditional and modified maximum likelihood estimators of θ and N and examine when these estimators will be finite, and unique. We also develop expressions for asymptotic bias and search for modified estimators which minimize the maximum asymptotic bias. These results are specialized tG the zxponential distribution. Methods of computing the solutions to the likelihood equatims are also discussed.     

On the asymptotic non‐equivalence of efficient‐GMM and MEL estimators in models with missing data

The generalized method of moments (GMM) and empirical likelihood (EL) are popular methods for combining sample and auxiliary information. These methods are used in very diverse fields of research, where competing theories often suggest variables satisfying different moment conditions. Results in the literature have shown that the efficient‐GMM (GMM_E) and maximum empirical likelihood (MEL) estimators have the same asymptotic distribution to order n^?1/2 and that both estimators are asymptotically semiparametric efficient. In this paper, we demonstrate that when data are missing at random from the sample, the utilization of some well‐known missing‐data handling approaches proposed in the literature can yield GMM_E and MEL estimators with nonidentical properties; in particular, it is shown that the GMM_E estimator is semiparametric efficient under all the missing‐data handling approaches considered but that the MEL estimator is not always efficient. A thorough examination of the reason for the nonequivalence of the two estimators is presented. A particularly strong feature of our analysis is that we do not assume smoothness in the underlying moment conditions. Our results are thus relevant to situations involving nonsmooth estimating functions, including quantile and rank regressions, robust estimation, the estimation of receiver operating characteristic (ROC) curves, and so on.     

Penalized least-squares estimation for regression coefficients in high-dimensional partially linear models

We consider a partially linear model with diverging number of groups of parameters in the parametric component. The variable selection and estimation of regression coefficients are achieved simultaneously by using the suitable penalty function for covariates in the parametric component. An MM-type algorithm for estimating parameters without inverting a high-dimensional matrix is proposed. The consistency and sparsity of penalized least-squares estimators of regression coefficients are discussed under the setting of some nonzero regression coefficients with very small values. It is found that the root p_n/n-consistency and sparsity of the penalized least-squares estimators of regression coefficients cannot be given consideration simultaneously when the number of nonzero regression coefficients with very small values is unknown, where p_n and n, respectively, denote the number of regression coefficients and sample size. The finite sample behaviors of penalized least-squares estimators of regression coefficients and the performance of the proposed algorithm are studied by simulation studies and a real data example.     

A Note on Support Vector Density Estimation for the Deconvolution Problem

The problem of support vector density estimation is studied when the sample observations are contaminated with random noise. A procedure based on support vector method and the Fourier transform is presented and is compared with kernel density estimators by the simulation study.     

DISTRIBUTIONS IN R WITH ROTATIONAL SYMMETRIES1

Let X ∈ R be a random vector with a distribution which is invariant under rotations within the subspaces V_j (dim V_j. = q_j) whose direct sum is R. The large sample distributions of the eigenvalues and vectors of M_n= n^-1Σⁿ_l x_ix_i are studied. In particular it is shown that several eigenvalue results of Anderson & Stephens (1972) for uniformly distributed unit vectors hold more generally.     

Minimum-Distance Estimator for Stable Exponent

Assume that X ₁, X ₂,…, X _n is a sequence of i.i.d. random variables with α-stable distribution (α ∈ (0,2], the stable exponent, is the unknown parameter). We construct minimum distance estimators for α by minimizing the Kolmogorov distance or the Cramér–von-Mises distance between the empirical distribution function G _n , and a class of distributions defined based on the sum-preserving property of stable random variables. The minimum distance estimators can also be obtained by minimizing a U-statistic estimate of an empirical distribution function involving the stable exponent. They share the same invariance property with the maximum likelihood estimates. In this article, we prove the strong consistency of the minimum distance estimators. We prove the asymptotic normality of our estimators. Simulation study shows that the new estimators are competitive to the existing ones and perform very closely even to the maximum likelihood estimator.     

Estimation of the Jump Size Density in a Mixed Compound Poisson Process

In this paper, we consider a mixed compound Poisson process, that is, a random sum of independent and identically distributed (i.i.d.) random variables where the number of terms is a Poisson process with random intensity. We study nonparametric estimators of the jump density by specific deconvolution methods. Firstly, assuming that the random intensity has exponential distribution with unknown expectation, we propose two types of estimators based on the observation of an i.i.d. sample. Risks bounds and adaptive procedures are provided. Then, with no assumption on the distribution of the random intensity, we propose two non‐parametric estimators of the jump density based on the joint observation of the number of jumps and the random sum of jumps. Risks bounds are provided, leading to unusual rates for one of the two estimators. The methods are implemented and compared via simulations.     

A modified cluster sampling method for estimating the bacterial density in Xanthan gum

Suppose particles are randomly distributed in a certain medium, powder or liquid, which is conceptually divided into N cells. Let p_i denote the probability that a particle falls in the ith cell and Y_i denote the number of particles in the ith cell. Assume that the joint probability function of the Y_i follows a multinomial distribution with cell probabilities p_i respectively. Take n (≤N) cells at random without replacement and put each of the cells separately through a mixing mechanism of dilution and swirl. These n cells constitute the first stage samples and the number of particles in these cells are not observable. Now conceptually divide each of n cells into M subcells of equal size and let X_ij denote the number of particles in the jth subcell of the ith cell selected in the first stage; i=1,2,…,N and j=1,2,…,M. Consequently assume that the conditional joint probability function of the X_ij given Y_i=y_i follows a multinomial distribution with equal cell probabilities. Now take m (≤M) subcells at random from each of the cells selected in the first stage sample. Assume that the numbers of particles in M×N subcells are observable. The properties of the estimator of the particle density per sample unit are investigated under the modified two-stage cluster sampling method. A laboratory experiment for Xanthan Gum Products is analyzed in order to examine the appropriateness of the model assumed in this paper.     

A note on L1 consistent estimation

Let (??, ??) be a space with a σ-field, M = {P_s; s o} a family of probability measures on A, Θ arbitrary, X₁,…,X_n independently and identically distributed P random variables. Metrize Θ with the L₁ distance between measures, and assume identifiability. Minimum-distance estimators are constructed that relate rates of convergence with Vapnik-Cervonenkis exponents when M is “regular”. An alternative construction of estimates is offered via Kolmogorov's chain argument.     

KERNEL ESTIMATORS OF PROBABILITY DENSITY FUNCTIONS BY RANKED-SET SAMPLING

ABSTRACT

Kernel estimation of probability density functions is considered when ranked-set samples are available. The properties of the resulting estimators are derived for small and large samples, while performance with respect to the usual simple random sample estimators is investigated for a range of probability density models.     

Mean intergrated squared error properties and optimal kernels when estimating a diatribution function

Let X₁,X₂,… X_n be a sample of independent identically distributed (i.i.d)random variables having an unknown absolutely continuous distribution function f with density f the twofold aim of his paper consists in, firstly deriving asymptotic expressions of the mean intergrated squared error (MISE) of a kernel estimator of F when f is either assumed to be continuous everywhere or problem of finding optimal kernels in these two cases is studied in detail.     

PORT Hill and Moment Estimators for Heavy-Tailed Models

In this article, we use the peaks over random threshold (PORT)-methodology, and consider Hill and moment PORT-classes of extreme value index estimators. These classes of estimators are invariant not only to changes in scale, like the classical Hill and moment estimators, but also to changes in location. They are based on the sample of excesses over a random threshold, the order statistic X _[np]+1:n , 0 ≤ p < 1, being p a tuning parameter, which makes them highly flexible. Under convenient restrictions on the underlying model, these classes of estimators are consistent and asymptotically normal for adequate values of k, the number of top order statistics used in the semi-parametric estimation of the extreme value index γ. In practice, there may however appear a stability around a value distant from the target γ when the minimum is chosen for the random threshold, and attention is drawn for the danger of transforming the original data through the subtraction of the minimum. A new bias-corrected moment estimator is also introduced. The exact performance of the new extreme value index PORT-estimators is compared, through a large-scale Monte-Carlo simulation study, with the original Hill and moment estimators, the bias-corrected moment estimator, and one of the minimum-variance reduced-bias (MVRB) extreme value index estimators recently introduced in the literature. As an empirical example we estimate the tail index associated to a set of real data from the field of finance.     

Recurrence relations for single and product moments of progressively Type-II censored order statistics from generalized logistic distribution with applications to inference

In this article, we establish several recurrence relations for the single and product moments of progressively Type-II right censored order statistics from a generalized logistic distribution. The use of these relations in a systematic manner allow us to compute all the means, variances, and covariances of progressively Type-II right censored order statistics from the generalized logistic distribution for all sample sizes n, effective sample sizes m, and all progressive censoring schemes (R₁, …, R_m). These moments are then utilized to derive best linear unbiased estimators of the scale and location-scale parameters of the generalized logistic distribution. A comparison of these estimators with the maximum likelihood estimates is then made through Monte Carlo simulations. Finally, the best linear unbiased predictors of censored failure times is discussed briefly.     

Modified weighted squared error estimation procedures with special emphasis on the stable laws

Two families of parameter estimation procedures for the stable laws based on a variant of the characteristic function are provided. The methodology which produces viable computational procedures for the stable laws is generally applicable to other families of distributions across a variety of settings. Both families of procedures may be described as a modified weighted chi-squared minimization procedure, and both explicitly take account of constraints on the parameter space. Influence func-tions for and efficiencies of the estimators are given. If x₁, x₂, …x_n random sample from an unknown distribution F , a method for determining the stable law to which F is attracted is developed. Procedures for regression and autoregres-sion with stable error structure are provided. A number of examples are given.     

Estimating Mixing Densities in Exponential Family Models for Discrete Variables

This paper is concerned with estimating a mixing density g using a random sample from the mixture distribution f(x)=∫f x | θ)g(θ)dθ where f(· | θ) is a known discrete exponen tial family of density functions. Recently two techniques for estimating g have been proposed. The first uses Fourier analysis and the method of kernels and the second uses orthogonal polynomials. It is known that the first technique is capable of yielding estimators that achieve (or almost achieve) the minimax convergence rate. We show that this is true for the technique based on orthogonal polynomials as well. The practical implementation of these estimators is also addressed. Computer experiments indicate that the kernel estimators give somewhat disappoint ing finite sample results. However, the orthogonal polynomial estimators appear to do much better. To improve on the finite sample performance of the orthogonal polynomial estimators, a way of estimating the optimal truncation parameter is proposed. The resultant estimators retain the convergence rates of the previous estimators and a Monte Carlo finite sample study reveals that they perform well relative to the ones based on the optimal truncation parameter.     

Maximum likelihood estimation in convex hull models

In this paper we consider models involving the convex hull operation of the parameter and the noise i.e. Y_i = CH(A, X_X). Then we generalize the basic models to ANOVA models; i.e. Y_ij=CH(A∪B_j,X_ij). In some cases the consistent estimators for the J U new parameters are derived. Assuming the existence of density forrandom convex sets, we derive the likelihood for the convex hull model. We then find the maximum Likelihood Estimators for the parameters. Examples for some random convex sets with finite dimensional distributions are derived to show how good these estimators are.