Minimax-variance L- and R-estimators of location

We consider the problem of minimax-variance, robust estimation of a location parameter, through the use of L- and R-estimators. We derive an easily checked necessary condition for L-estimation to be minimax, and a related sufficient condition for R-estimation to be minimax. Those cases in the literature in which L-estimation is known not to be minimax, and those in which R-estimation is minimax, are derived as consequences of these conditions. New classes of examples are given in each case. As well, we answer a question of Scholz (1974), who showed essentially that the asymptotic variance of an R-estimator never exceeds that of an L-estimator, if both are efficient at the same strongly unimodal distribution. Scholz raised the question of whether or not the assumption of strong unimodality could be dropped. We answer this question in the negative, theoretically and by examples. In the examples, the minimax property fails both for L-estimation and for R-estimation, but the variance of the L-estimator, as the distribution of the observation varies over the given neighbourhood, remains unbounded. That of the R-estimator is unbounded.     

Robust M-estimators of scale: Minimax bias versus maximal variance

In the location-scale estimation problem, we study robustness properties of M-estimators of the scale parameter under unknown ?-contamination of a fixed symmetric unimodal error distribution F₀. Within a general class of M-estimators, the estimator with minimax asymptotic bias is shown to lie within the subclass of α-interquantile ranges of the empirical distribution symmetrized about the sample median. Our main result is that as ? → 0, the limiting minimax asymptotic bias estimator is sometimes (e.g., when F_o is Cauchy), but not always, the median absolute deviation about the median. It is also shown that contamination in the neighbourhood of a discontinuity of the influence function of a minimax bias estimator can sometimes inflate the asymptotic variance beyond that achieved by placing all the ?-contamination at infinity. This effect is quantified by a new notion of asymptotic efficiency that takes into account the effect of infinitesimal contamination of the parametric model for the error distribution.     

Bias-robust L-estimators of a scale parameter

We derive optimal bias-robust L-estimators of a scale parameter σ based on random samples from F(( ·?θ/σ), where θ and σ are unknown and F is an unknown member of a ε-contaminated neighborhood of a fixed symmetric error distribution F ₀. Within a very general class S of L-estimators which are Fisher-consistent at F, we solve for: (i) the estimator with minimax asymptotic bias over the ε-contamination neighborhood; and (ii) the estimator with minimum gross error sensitivity at F ₀ [the limiting case of (i) as ε → 0]. The solutions to problems (i) and (ii) are shown, using a generalized method of moment spaces, to be mixtures of at most two interquantile ranges. A graphical method is presented for finding the optimal bias-robust solutions, and examples are given.     

Efficient bias-Robust M-Estimators of location in Kolmogorov normal neighbourhoods

We consider minimax-bias M-estimation of a location parameter in a Kolmogorov neighbourhood K() of a normal distribution. The maximum asymptotic bias of M-estimators for the Kolmogorov normal neighbourhood is derived, and its relation with the gross-error sensitivity of the estimator at the nominal model (the Gaussian case) is found. In addition, efficient bias-robust M-estimators T_i are constructed. Numerical results are also obtained to show the percentage of increase in maximum asymptotic bias and the efficiency we can achieve for some well-known -functions.     

Redescending M-estimators

In finite sample studies redescending M-estimators outperform bounded M-estimators (see for example, Andrews et al. [1972. Robust Estimates of Location. Princeton University Press, Princeton]). Even though redescenders arise naturally out of the maximum likelihood approach if one uses very heavy-tailed models, the commonly used redescenders have been derived from purely heuristic considerations. Using a recent approach proposed by Shurygin, we study the optimality of redescending M-estimators. We show that redescending M-estimator can be designed by applying a global minimax criterion to locally robust estimators, namely maximizing over a class of densities the minimum variance sensitivity over a class of estimators. As a particular result, we prove that Smith's estimator, which is a compromise between Huber's skipped mean and Tukey's biweight, provides a guaranteed level of an estimator's variance sensitivity over the class of densities with a bounded variance.     

De l'unicité des estimateurs robustes en régression lorsque le paramètre d'échelle et le paramètre de la régression sont estimés simultanément

Several methods have been suggested to calculate robust M- and G-M -estimators of the regression parameter β and of the error scale parameter σ in a linear model. This paper shows that, for some data sets well known in robust statistics, the nonlinear systems of equations for the simultaneous estimation of β, with an M-estimate with a redescending ψ-function, and σ, with the residual median absolute deviation (MAD), have many solutions. This multiplicity is not caused by the possible lack of uniqueness, for redescending ψ-functions, of the solutions of the system defining β with known σ; rather, the simultaneous estimation of β and σ together creates the problem. A way to avoid these multiple solutions is to proceed in two steps. First take σ as the median absolute deviation of the residuals for a uniquely defined robust M-estimate such as Huber's Proposal 2 or the L₁-estimate. Then solve the nonlinear system for the M-estimate with σ equal to the value obtained at the first step to get the estimate of β. Analytical conditions for the uniqueness of M and G-M-estimates are also given.     

L 1-estimation for varying coefficient models

The varying coefficient model is a useful extension of linear models and has many advantages in practical use. To estimate the unknown functions in the model, the kernel type with local linear least-squares (L ₂) estimation methods has been proposed by several authors. When the data contain outliers or come from population with heavy-tailed distributions, L ₁-estimation should yield better estimators. In this article, we present the local linear L ₁-estimation method and derive the asymptotic distributions of the L ₁-estimators. The simulation results for two examples, with outliers and heavy-tailed distribution, respectively, show that the L ₁-estimators outperform the L ₂-estimators.     

Local Linear Estimation for Spatiotemporal Models Based on Least Absolute Deviation

When the data contain outliers or come from population with heavy-tailed distributions, which appear very often in spatiotemporal data, the estimation methods based on least-squares (L₂) method will not perform well. More robust estimation methods are required. In this article, we propose the local linear estimation for spatiotemporal models based on least absolute deviation (L₁) and drive the asymptotic distributions of the L₁-estimators under some mild conditions imposed on the spatiotemporal process. The simulation results for two examples, with outliers and heavy-tailed distribution, respectively, show that the L₁-estimators perform better than the L₂-estimators.     

Ordres stochastiques et efficacité asymptotique des L-estimateurs

The efficiency of an estimator depends heavily on the tails of the distribution of the observations. Several partial orders have been defined to compare probability distributions according to their tails. In this paper we show that the asymptotic relative efficiency of two L-estimators with monotone weight functions is isotonic with respect to the partial orders defined by van Zwet (1964) and Lawrence (1975). We also give results concerning trimmed means.     

Jackknifing L-estimates

Linear functions of order statistics (“L-estimates”) of the form T_n =under jackknifing are investigated. This paper proves that with suitable conditions on the function J, the jackknifed version T_n of the L-estimate T_n has the same limit distribution as T_n. It is also shown that the jackknife estimate of the asymptotic variance of n^1/2 is consistent. Furthermore, the Berry-Esséen rate associated with asymptotic normality, and a law of the iterated logarithm of a class of jackknife L-estimates, are characterized.     

Minimax Asymptotic Mean-Squared-Error of L-Estimators of Scale Parameter

We derive the AMSE (maximal asymptotic mean-squared-error) of the general class of L-estimators of scale that are location-scale equivariant and Fisher consistent. For non-normal error distributions, we determined estimators that have minimum AMSE over the subclass of (i) α-interquantile ranges and (ii) mixtures of at most two α-interquantile ranges. Finally, the L-estimators of scale symmetrized about the median were found to have the same AMSE as their nonsymmetrized counterparts, thus yielding the same results as in the symmetrized case.     

The influence function of penalized regression estimators

To perform regression analysis in high dimensions, lasso or ridge estimation are a common choice. However, it has been shown that these methods are not robust to outliers. Therefore, alternatives as penalized M-estimation or the sparse least trimmed squares (LTS) estimator have been proposed. The robustness of these regression methods can be measured with the influence function. It quantifies the effect of infinitesimal perturbations in the data. Furthermore, it can be used to compute the asymptotic variance and the mean-squared error (MSE). In this paper we compute the influence function, the asymptotic variance and the MSE for penalized M-estimators and the sparse LTS estimator. The asymptotic biasedness of the estimators make the calculations non-standard. We show that only M-estimators with a loss function with a bounded derivative are robust against regression outliers. In particular, the lasso has an unbounded influence function.     

Asymptotics for L1-estimators of regression parameters under heteroscedasticityY

We consider the asymptotic behaviour of L₁ -estimators in a linear regression under a very general form of heteroscedasticity. The limiting distributions of the estimators are derived under standard conditions on the design. We also consider the asymptotic behaviour of the bootstrap in the heteroscedastic model and show that it is consistent to first order only if the limiting distribution is normal.     

Sharp bounds on the expectations of L-statistics expressed in the Gini mean difference units

We describe a method of calculating sharp lower and upper bounds on the expectations of arbitrary, properly centered L-statistics expressed in the Gini mean difference units of the original i.i.d. observations. Precise values of bounds are derived for the single-order statistics, their differences, and some examples of L-estimators. We also present the families of discrete distributions which attain the bounds, possibly in the limit.     

Improved shrinkage estimators for the mean vector of a scale mixture of normals with unknown variance

The problem of estimating the mean θ of a not necessarily normal p-variate (p > 3) distribution with unknown covariance matrix of the form σ²A (A a known diagonal matrix) on the basis of n_i > 2 observations on each coordinate X_t (1 < i < p) is considered. It is argued that the class of scale (or variance) mixtures of normal distributions is a reasonable class to study. Assuming the loss function is quadratic, a large class of improved shrinkage estimators is developed in the case of a balanced design. We generalize results of Berger and Strawderman for one observation in the known-variance case. This methodology also permits the development of a new class of minimax shrinkage estimators of the mean of a p-variate normal distribution for an unbalanced design. Numerical calculations show that the improvements in risk can be substantial.     

A note on the minimum size of an orthogonal array

It is an elementary fact that the size of an orthogonal array of strength t on k factors must be a multiple of a certain number, say L_t, that depends on the orders of the factors. Thus L_t is a lower bound on the size of arrays of strength t on those factors, and is no larger than L_k, the size of the complete factorial design. We investigate the relationship between the numbers L_t, and two questions in particular: For what t is L_t < L_k? And when L_t = L_k, is the complete factorial design the only array of that size and strength t? Arrays are assumed to be mixed-level.

We refer to an array of size less than L_k as a proper fraction. Guided by our main result, we construct a variety of mixed-level proper fractions of strength k ? 1 that also satisfy a certain group-theoretic condition.     

Some robust tests of independence in symmetrical multivariate distributions

Let X =(x)^ij=(11¹, …, X,)_T, i = l, …n, be an n X random matrix having multivariate symmetrical distributions with parameters μ, Σ. The p-variate normal with mean μ and covariance matrix is a member of this family. Let be the squared multiple correlation coefficient between the first and the succeeding p₁ components, and let p² = + be the squared multiple correlation coefficient between the first and the remaining p₁ + p₂ =p – 1 components of the p-variate normal vector. We shall consider here three testing problems for multivariate symmetrical distributions. They are (A) to test p² =0 against; (B) to test against =0, 0; (C) to test against p² =0, We have shown here that for problem (A) the uniformly most powerful invariant (UMPI) and locally minimax test for the multivariate normal is UMPI and is locally minimax as p² 0 for multivariate symmetrical distributions. For problem (B) the UMPI and locally minimax test is UMPI and locally minimax as for multivariate symmetrical distributions. For problem (C) the locally best invariant (LBI) and locally minimax test for the multivariate normal is also LBI and is locally minimax as for multivariate symmetrical distributions.     

Estimating the mean of the selected uniform population

Let π_i(i=1,2,…K) be independent U(0,?_i) populations. Let Y_i denote the largest observation based on a random sample of size n from the i-th population. for selecting the best populaton, that is the one associated with the largest ?_i, we consider the natural selection rule, according to which the population corresponding to the largest Y_i is selected. In this paper, the estimation of M. the mean of the selected population is considered. The natural estimator is positively biased. The UMVUE (uniformly minimum variance unbiased estimator) of M is derived using the (U,V)-method of Robbins (1987) and its asymptotic distribution is found. We obtain a minimax estimator of M for K≤4 and a class of admissible estimators among those of the form cY_max. For the case K = 2, the UMVUE is improved using the Brewster-Zidek (1974) Technique with respect to the squared error loss function L₁ and the scale-invariant loss function L₂. For the case K = 2, the MSE'S of all the estimators are compared for selected values of n and ρ=?₁/(?₁+?₂).     

Rates of convergence of Lp-estimators for a density with an infinity cusp

We study the asymptotics of L_p-estimators, p>0, as estimates of a parameter of location for data coming for a symmetric density with an infinity cusp at the center of symmetry of the distribution. In this situation, the data are more concentrated around the parameter of location than in usual cases. The maximum-likelihood estimator is not defined. The rates of convergence of the L_p-estimators in this situation depend on p and on the shape of the density. For some densities and small values of p, the L_p-estimator converges with a fast rate of convergence.     

Estimation of the mean of the selected gamma population

Let л₁ and л₂ denote two independent gamma populations G(α₁, p) and G(α₂, p) respectively. Assume α(i=1,2)are unknown and the common shape parameter p is a known positive integer. Let Y_i denote the sample mean based on a random sample of size n from the i-th population. For selecting the population with the larger mean, we consider, the natural rule according to which the population corresponding to the larger Y_i is selected. We consider? in this paper, the estimation of M, the mean of the selected population. It is shown that the natural estimator is positively biased. We obtain the uniformly minimum variance unbiased estimator(UMVE) of M. We also consider certain subclasses of estikmators of the form c₁x₍₁₎ +c₁x₍₂₎ and derive admissible estimators in these classes. The minimazity of certain estimators of interest is investigated. Itis shown that p(p+1)^-1x₍₁₎ is minimax and dominates the UMVUE. Also UMVUE is not minimax.