Asymptotic results and tests for the choice of approximative models in nonlinear two-phases regression models, heteroscedatic case

This paper is devoted to the study of the least squares estimator of f for the classical, fixed design, nonlinear model X (t _i)=f(t _i)+ε(t _i), i=1,2,…,n, where the (ε(t _i))_i=1,…,n are independent second order r.v.. The estimation of f is based upon a given parametric form. In Brodeau (1993) this subject has been studied in the homoscedastic case. This time we assume that the ε(t _i) have non constant and unknown variances σ²(t _i). Our main goal is to develop two statistical tests, one for testing that f belongs to a given class of functions possibly discontinuous in their first derivative, and another for comparing two such classes. The fundamental tool is an approximation of the elements of these classes by more regular functions, which leads to asymptotic properties of estimators based on the least squares estimator of the unknown parameters. We point out that Neubauer and Zwanzig (1995) have obtained interesting results for connected subjects by using the same technique of approximation. Received: February 1996     

Estimating a restricted normal mean

Let X ₁, X ₂, ..., X _n be a random sample from a normal distribution with unknown mean μ and known variance σ ². In many practical situations, μ is known a priori to be restricted to a bounded interval, say [−m, m] for some m > 0. The sample mean , then, becomes an inadmissible estimator for μ. It is also not minimax with respect to the squared error loss function. Minimax and other estimators for this problem have been studied by Casella and Strawderman (Ann Stat 9:870–878, 1981), Bickel (Ann Stat 9:1301–1309, 1981) and Gatsonis et al. (Stat Prob Lett 6:21–30, 1987) etc. In this paper, we obtain some new estimators for μ. The case when the variance σ ² is unknown is also studied and various estimators for μ are proposed. Risk performance of all estimators is numerically compared for both the cases when σ ² may be known and unknown.     

Combining kernel estimators in the uniform deconvolution problem

We construct a density estimator and an estimator of the distribution function in the uniform deconvolution model. The estimators are based on inversion formulas and kernel estimators of the density of the observations and its derivative. Initially the inversions yield two different estimators of the density and two estimators of the distribution function. We construct asymptotically optimal convex combinations of these two estimators. We also derive pointwise asymptotic normality of the resulting estimators, the pointwise asymptotic biases and an expansion of the mean integrated squared error of the density estimator. It turns out that the pointwise limit distribution of the density estimator is the same as the pointwise limit distribution of the density estimator introduced by Groeneboom and Jongbloed (Neerlandica, 57, 2003, 136), a kernel smoothed nonparametric maximum likelihood estimator of the distribution function.     

Gamma-admissibility of estimators in the one-parameter exponential family

Summary Admissibility of estimators under vague prior information on the distribution of the unknown parameter is studied which leads to the notion of gamma-admissibility. A sufficient condition for an estimator of the formδ(x)=(ax+b)/(cx+d) to be gamma-admissible in the one-parameter exponential family under squared error loss is established. As an application of this result two equalizer rules are shown to be unique gamma-minimax estimators by proving their gamma-admissibility.     

A general class of estimators for estimating population mean using auxiliary information

Summary A general class of estimators for estimating the population mean of the character under study which make use of auxiliary information is proposed. Under simple random sampling without replacement (SRSWOR), the expressions of Bias and Mean Square Error (MSE), up to the first and the second degrees of approximation are derived. General conditions, up to the first order approximation, are also obtained under which any member of this class performs more efficiently than the mean per unit estimator, the ratio estimator and the product estimator. The class of estimators in its optimum case, under the first degree approximation, is discussed. It is shown that it is not possible to obtain optimum values of parameters “a”, “b” and “p”, that are independent of each other. However, the optimum relation among them is given by (b−a)p=ρ C _y/C _x. Under this condition, the expression of MSE of the class is that of the linear regression estimator.     

Strong uniform convergence for the estimator of the regression function under ϕ-mixing conditions

Suppose the observations (X _i,Y _i), i=1,…, n, are ϕ-mixing. The strong uniform convergence and convergence rate for the estimator of the regression function was studied by serveral authors, e.g. G. Collomb (1984), L. Gy?rfi et al. (1989). But the optimal convergence rates are not reached unless the Y _i are bounded or the E exp (a|Y _i|) are bounded for some a>0. Compared with the i.i.d. case the convergence of the Nadaraya-Watson estimator under ϕ-mixing variables needs strong moment conditions. In this paper we study the strong uniform convergence and convergence rate for the improved kernel estimator of the regression function which has been suggested by Cheng P. (1983). Compared with Theorem A in Y. P. Mack and B. Silverman (1982) or Theorem 3.3.1 in L. Gy?rfi et al. (1989), we prove the convergence for this kind of estimators under weaker moment conditions. The optimal convergence rate for the improved kernel estimator is attained under almost the same conditions of Theorem 3.3.2 in L. Gy?rfi et al. (1989). Received: September 1999     

On Estimators of the Nearest Neighbour Distance Distribution Function for Stationary Point Processes

There are three approaches for the estimation of the distribution function D(r) of distance to the nearest neighbour of a stationary point process: the border method, the Hanisch method and the Kaplan-Meier approach. The corresponding estimators and some modifications are compared with respect to bias and mean squared error (mse). Simulations for Poisson, cluster and hard-core processes show that the classical border estimator has good properties; still better is the Hanisch estimator. Typically, mse depends on r, having small values for small and large r and a maximum in between. The mse is not reduced if the exact intensity λ (if known) or intensity estimators from larger windows are built in the estimators of D(r); in contrast, the intensity estimator should have the same precision as that of λ D(r). In the case of replicated estimation from more than one window the best way of pooling the subwindow estimates is averaging by weights which are proportional to squared point numbers.     

Minimax estimation of a cumulative distribution function by converting to a parametric problem

Let X = (X ₁,...,X _n ) be a sample from an unknown cumulative distribution function F defined on the real line . The problem of estimating the cumulative distribution function F is considered using a decision theoretic approach. No assumptions are imposed on the unknown function F. A general method of finding a minimax estimator d(t;X) of F under the loss function of a general form is presented. The method of solution is based on converting the nonparametric problem of searching for minimax estimators of a distribution function to the parametric problem of searching for minimax estimators of the probability of success for a binomial distribution. The solution uses also the completeness property of the class of monotone decision procedures in a monotone decision problem. Some special cases of the underlying problem are considered in the situation when the loss function in the nonparametric problem is defined by a weighted squared, LINEX or a weighted absolute error.     

On classes of estimators of the variance function of a linear estimator

Summary The variance function of a linear estimator can be expressed into a quadratic form. The present paper presents classes of estimators of this quadratic form along the lines implicitly suggested byHorvitz andThompson [1952] while formulating the classes of linear estimators. Accordingly it is noted that there exist nine principal classes of estimators out of which one principal class is examined in detail. Furthermore to illustrate the theory an example is considered where the expression for a unique estimator variance of the best estimator in theT ₁ class is derived.     

Density estimation for randomly distributed circular objects

Summary Nearest neighbour methods traditionally used to estimate density of a sessile biological population treat individuals as points. The present paper suggests distance-based density estimators which treat individuals as circles with variable areas. Distribution of distance between a sample point and thek-th (k = 1, 2, 3, …) nearest circle is derived. Maximum likelihood estimator of density is obtained from a random sample of point tok-th order distances. Assuming a skewed distribution for the circle radius, moment estimators of density and mean circle area are derived.     

Berry–Esseen bounds for density estimates under NA assumption

Let {X _j } be a strictly stationary sequence of negatively associated random variables with the marginal probability density function f(x). The recursive kernel estimators of f(x) are defined by

Incorrect asymptotic size of subsampling procedures based on post-consistent model selection estimators

Subsampling and the m out of n bootstrap have been suggested in the literature as methods for carrying out inference based on post-model selection estimators and shrinkage estimators. In this paper we consider a subsampling confidence interval (CI) that is based on an estimator that can be viewed either as a post-model selection estimator that employs a consistent model selection procedure or as a super-efficient estimator. We show that the subsampling CI (of nominal level 1−α for any α(0,1)) has asymptotic confidence size (defined to be the limit of finite-sample size) equal to zero in a very simple regular model. The same result holds for the m out of n bootstrap provided m²/n→0 and the observations are i.i.d. Similar zero-asymptotic-confidence-size results hold in more complicated models that are covered by the general results given in the paper and for super-efficient and shrinkage estimators that are not post-model selection estimators. Based on these results, subsampling and the m out of n bootstrap are not recommended for obtaining inference based on post-consistent model selection or shrinkage estimators.     

Estimating the conditional mode of a stationary stochastic process from noisy observations

Let {(X _i, Y _i,)}, i≥1, be a strictly stationary process from noisy observations. We examine the effect of the noise in the response Y and the covariates X on the nonparametric estimation of the conditional mode function. To estimate this function we are using deconvoluting kernel estimators. The asymptotic behavior of these estimators depends on the smoothness of the noise distribution, which is classified as either ordinary smooth or super smooth. Uniform convergence with almost sure convergence rates is established for strongly mixing stochastic processes, when the noise distribution is ordinary smooth. Received: April 1998     

Estimation of the precision matrix of multivariate Pearson type II model

In this paper, the problem of estimating the precision matrix of a multivariate Pearson type II-model is considered. A new class of estimators is proposed. Moreover, the risk functions of the usual and the proposed estimators are explicitly derived. It is shown that the proposed estimator dominates the MLE and the unbiased estimator, under the quadratic loss function. A simulation study is carried out and confirms these results. Improved estimator of tr (Σ ⁻¹) is also obtained.     

The density of the parameter estimators when the observations are distributed exponentially

We present the probability density of parameter estimators whenN independent variables are observed, each of them distributed according to the exponential low (with some parameters to be estimated). The numberN is supposed to be small. Typically, such an experimental situation arises in problems of software reliability, another case is a small sample in the GLIM modeling. The considered estimator is defined by the maximum of the posterior probability density; it is equal to the maximum likelihood estimator when the prior is uniform. The exact density is obtained, and its approximation is discussed in accordance with some information-geometric considerations. The main body of the paper has been prepared during the author’s visit in LMC/IMAG Grenoble, France, on the invitation of Université Joseph Fourier in January 1994.     

Decision theoretic estimation using record statistics

We consider the problem of estimating the scale parameter θ of the shifted exponential distribution with unknown shift based on a set of observed records drawn from a sequential sample of independent and identically distributed random variables. Under a large class of bowl-shaped loss functions, the best affine equivariant estimator (BAEE) of θ is shown to be inadmissible. Two dominating procedures are proposed. A numerical study is performed to show the extent of risk reduction that the improved estimators provide over the BAEE.     

Shrinkage estimation of <Emphasis Type="Italic">P</Emphasis>(<Emphasis Type="Italic">X</Emphasis><<Emphasis Type="Italic">Y</Emphasis>) in the exponential case with common location parameter

We consider the problem of estimating R=P(X<Y) where X and Y have independent exponential distributions with parameters and respectively and a common location parameter . Assuming that there is a prior guess or estimate R₀, we develop various shrinkage estimators of R that incorporate this prior information. The performance of the new estimators is investigated and compared with the maximum likelihood estimator using Monte Carlo methods. It is found that some of these estimators are very successful in taking advantage of the prior estimate available.Acknowledgments. The authors are grateful to the editor and to the referees for their constructive comments that resulted in a substantial improvement of the paper.     

Kernel estimation of a smooth distribution function based on censored data

The problem of estimating a smooth distribution functionF at a pointτ based on randomly right censored data is treated under certain smoothness conditions onF. The asymptotic performance of a certain class of kernel estimators is compared to that of the Kaplan-Meier estimator ofF(τ). It is shown that the relative deficiency of the Kaplan-Meier estimator ofF(τ) with respect to the appropriately chosen kernel type estimator tends to infinity as the sample sizen increases to infinity. Strong uniform consistency and the weak convergence of the normalized process are also proved. Research Surported in part by NIH grant 1R01GM28405.     

Estimating the codifference function of linear time series models with infinite variance

We consider the codifference and the normalized codifference function as dependence measures for stationary processes. Based on the empirical characteristic function, we propose estimators of the codifference and the normalized codifference function. We show consistency of the proposed estimators, where the underlying model is the ARMA with symmetric α-stable innovations, 0 < α ≤ 2. In addition, we derive their limiting distribution. We present a simulation study showing the dependence of the estimator on certain design parameters. Finally, we provide an empirical example using some stocks from Indonesia Stock Exchange.     

Minimax invariant estimation of a continuous distribution function under entropy loss

For the invariant decision problem of estimating a continuous distribution function F with two entropy loss functions, it is proved that the best invariant estimators d ₀ exist and are the same as the best invariant estimator of a continuous distribution function under the squared error loss function L (F, d)=∫|F (t) −d (t) |² dF (t). They are minimax for any sample size n≥1.