Bayes minimax estimation of a bernoulli p in a restricted parameter space

In many estimation problems the parameter of interest is known,a priori, to belong to a proper subspace of the natural parameter space. Although useful in practice this type of additional information can lead to surprising theoretical difficulties. In this paper the problem of minimax estimation of a Bernoulli pwhen pis restricted to a symmetric subinterval of the natural parameter space is considered. For the sample sizes n = 1,2,3, and 4 least favorable priors with finite support are provided and the corresponding Bayes estimators are shown to be minimax. For n = 5 and 6 the usual constant risk minimax estimator is shown to be the Bayes minimax estimator corresponding to a least favorable prior with finite support, provided the restriction on the parameter space is not too tight.     

On the efficiency of affine minimax rules in estimating a bounded multivariate normal mean

Problems involving bounded parameter spaces, for example T-minimax and minimax esyimation of bounded parameters, have received much attention in recent years. The existing literature is rich. In this paper we consider T-minimax estimation of a multivariate bounded normal mean by affine rules, and discuss the loss of efficiency due to the use of such rules instead of optimal, unrestricted rules. We also investigate the behavior of 'probability restricted' affine rules, i.e., rules that have a guaranteed large probability of being in the bounded parameter space of the problem.     

Sample design for observing classes of objects

We consider optimal sample designs for observing classes of objects. Suppose we will take a simple random sample of equal-sized sectors from a study population and observe the classes existing on these sectors. The classes might be many different things, for example, herbaceous plant species (in sampling quadrats), microinvertebrate species (in sampling cores), and side effects from a drug (in conducting medical trials). Under a nonparametric mixture model and data from a previous related study, we first estimate the optimal number of sample sectors of a given size. Then for negative binomial dispersions of individuals with a common aggregation parameter k, we consider the optimal size as well as number of sample sectors. A simple test exists to check our common k assumption and our optimal size method requires far less data than would be required by a grid method or other method which utilizes data from sample sectors of several different sizes.     

Large deviations for estimators of some threshold parameters

In this paper, we consider a class of statistical models with a real-valued threshold parameter, which is either the minimum or the maximum of the support of the sampling distribution. We prove large deviation principles for sequences of estimators (maximum likelihood estimators and posterior distributions) as the sample size goes to infinity. Furthermore we illustrate some connections with the analogous large deviation results for the natural exponential families.     

Minimax Linear Smoothers

We consider the problem of estimating the mean of a multivariate distribution. As a general alternative to penalized least squares estimators, we consider minimax estimators for squared error over a restricted parameter space where the restriction is determined by the penalization term. For a quadratic penalty term, the minimax estimator among linear estimators can be found explicitly. It is shown that all symmetric linear smoothers with eigenvalues in the unit interval can be characterized as minimax linear estimators over a certain parameter space where the bias is bounded. The minimax linear estimator depends on smoothing parameters that must be estimated in practice. Using results in Kneip (1994), this can be done using Mallows' C _L -statistic and the resulting adaptive estimator is now asymptotically minimax linear. The minimax estimator is compared to the penalized least squares estimator both in finite samples and asymptotically.     

The application of generalized ridge and stein-like general minimax rules to multicollinear data

We consider the use of minimax shrinkage estimators for the linear regression mcjel under several loss functions when severe multicollinearity is present. The examples considered illustrate that little or no departure from the least squares estimates is permitted in many cases when the data is highly multicollinear and/or shrinkage is toward a point in the parameter space that does not closely agree with the sample data     

On asymptotic properties of bootstrap for AR(1) processes

We consider a first-order autoregressive process when the autoregressive parameter β may vary over the entire real line. The standard bootstrap approximation to the sampling distribution of the least squares estimator of β is shown to converge weakly to a random (i.e., nondegenerate) limit for the usual choice of the bootstrap sample size when β equals 1 or −1. The bootstrap approximation, however, is asymptotically valid in probability, or even almost surely, for suitably selected resample sizes, whatever β may be.     

Multi-phase sampling under cost constraints

Multi-phase sampling (M-PhS) scheme is useful when the interest is in the estimation of the population mean of an expensive variable strictly connected with other cheaper (auxiliary) variables. The MSE is an accuracy measure of an estimator. Usually it decreases as the sample size increases. In practice the sample size cannot become arbitrarily large for possible cost constraints. From a practical point of view it would be useful to know the sample sizes which guarantee the best accuracy of the estimates for fixed costs. These “optimum” sample sizes can be, in some cases, computable but not admissible. In other cases, they can be neither admissible nor computable. The main goal of this paper is to propose a solution for both these situations. It will be clear that in both situations the solution is to consider a M-PhS scheme with one or more phases less.     

Missing data mechanisms and their implications on the analysis of categorical data

We review some issues related to the implications of different missing data mechanisms on statistical inference for contingency tables and consider simulation studies to compare the results obtained under such models to those where the units with missing data are disregarded. We confirm that although, in general, analyses under the correct missing at random and missing completely at random models are more efficient even for small sample sizes, there are exceptions where they may not improve the results obtained by ignoring the partially classified data. We show that under the missing not at random (MNAR) model, estimates on the boundary of the parameter space as well as lack of identifiability of the parameters of saturated models may be associated with undesirable asymptotic properties of maximum likelihood estimators and likelihood ratio tests; even in standard cases the bias of the estimators may be low only for very large samples. We also show that the probability of a boundary solution obtained under the correct MNAR model may be large even for large samples and that, consequently, we may not always conclude that a MNAR model is misspecified because the estimate is on the boundary of the parameter space.     

Interval estimators for the population mean for skewed distributions with a small sample size

In finite population sampling, it has long been known that, for small sample sizes, when sampling from a skewed population, the usual frequentist intervals for the population mean cover the true value less often than their stated frequency of coverage. Recently, a non-informative Bayesian approach to some problems in finite population sampling has been developed, which is based on the 'Polya posterior'. For large sample sizes, these methods often closely mimic standard frequentist methods. In this paper, a modification of the 'Polya posterior', which employs the weighted Polya distribution, is shown to give interval estimators with improved coverage properties for problems with skewed populations and small sample sizes. This approach also yields improved tests for hypotheses about the mean of a skewed distribution.     

The cost of not knowing the radius

Robust Statistics considers the quality of statistical decisions in the presence of deviations from the ideal model, where deviations are modelled by neighborhoods of a certain size about the ideal model. We introduce a new concept of optimality (radius-minimaxity) if this size or radius is not precisely known: for this notion, we determine the increase of the maximum risk over the minimax risk in the case that the optimally robust estimator for the false neighborhood radius is used. The maximum increase of the relative risk is minimized in the case that the radius is known only to belong to some interval [r _l ,r _u ]. We pursue this minmax approach for a number of ideal models and a variety of neighborhoods. Also, the effect of increasing parameter dimension is studied for these models. The minimax increase of relative risk in case the radius is completely unknown, compared with that of the most robust procedure, is 18.1% versus 57.1% and 50.5% versus 172.1% for one-dimensional location and scale, respectively, and less than 1/3 in other typical contamination models. In most models considered so far, the radius needs to be specified only up to a factor , in order to keep the increase of relative risk below 12.5%, provided that the radius–minimax robust estimator is employed. The least favorable radii leading to the radius–minimax estimators turn out small: 5–6% contamination, at sample size 100.      

Optimal sample coordination using controlled selection

Sample coordination maximizes or minimizes the overlap of two or more samples selected from overlapping populations. It can be applied to designs with simultaneous or sequential selection of samples. We propose a method for sample coordination in the former case. We consider the case where units are to be selected with maximum overlap using two designs with given unit inclusion probabilities. The degree of coordination is measured by the expected sample overlap, which is bounded above by a theoretical bound, called the absolute upper bound, and which depends on the unit inclusion probabilities. If the expected overlap equals the absolute upper bound, the sample coordination is maximal. Most of the methods given in the literature consider fixed marginal sampling designs, but in many cases, the absolute upper bound is not achieved. We propose to construct optimal sampling designs for given unit inclusion probabilities in order to realize maximal coordination. Our method is based on some theoretical conditions on joint selection probability of two samples and on the controlled selection method with linear programming implementation. The method can also be applied to minimize the sample overlap.     

Estimation of the location parameter and the average worth of the selected subset of two parameter exponential populations under LINEX loss function

Suppose a subset of populations is selected from k exponential populations with unknown location parameters θ₁, θ₂, …, θ_k and common known scale parameter σ. We consider the estimation of the location parameter of the selected population and the average worth of the selected subset under an asymmetric LINEX loss function. We show that the natural estimator of these parameters is biased and find the uniformly minimum risk-unbiased (UMRU) estimator of these parameters. In the case of k = 2, we find the minimax estimator of the location parameter of the smallest selected population. Furthermore, we compare numerically the risk of UMRU, minimax, and the natural estimators.     

Robust M- and L-Estimators of Scale Parameter

We consider first the class of M-estimators of scale that are location-scale equivariant and Fisher consistent at the error distribution of the shrinking contamination neighborhood and derive an expression for the maximal asymptotic mean-squared-error, for a suitably regular score function, followed by a lower bound on it. We next show that the minimax asymptotic mean-squzred-error is attained at an M-estimator of scale with the truncated MLE score function which, when specialized to the Standard Normal error distribution has the form of Huber's Proposal 2. The latter minimax property is also shown to hold for α-trimmed variance as an L-estimator of scale.     

A class of simple approximate sequential tests for adaptive comparison of two treatments

We consider the problem of sequentially deciding which of two treatments is superior, A class of simple approximate sequential tests is proposed. These have the probabilities of correct selection approximately independent of the sampling rule and depending on unknown parameters only through the function of interest, such as the difference or ratio of mean responses. The tests are obtained by using a normal approximation, and this is employed to derive approximate expressions for the probabilities of correct selection and the expected sample sizes. A class of data-dependent sampling rules is proposed for minimizing any weighted average of the expected sample sizes on the two treatments, with the weights being allowed to depend on unknown parameters. The tests are studied in the particular cases of exponentially.     

Quasi-Minimax Estimation in the Linear Model with Measurement Errors

In this article, we consider quasi-minimax estimation in the linear regression model where some covariates are measured with additive errors. When measurement errors are directly ignored the minimax risk of the resulting estimator can be large. By correcting the attenuation we propose a penalized quadratic risk function. A simulation study is conducted to illustrate the performance of the proposed estimators.     

Performance of Interval Estimators for the Inverse Hypergeometric Distribution

The inverse hypergeometric distribution is of interest in applications of inverse sampling without replacement from a finite population where a binary observation is made on each sampling unit. Thus, sampling is performed by randomly choosing units sequentially one at a time until a specified number of one of the two types is selected for the sample. Assuming the total number of units in the population is known but the number of each type is not, we consider the problem of estimating this parameter. We use the Delta method to develop approximations for the variance of three parameter estimators. We then propose three large sample confidence intervals for the parameter. Based on these results, we selected a sampling of parameter values for the inverse hypergeometric distribution to empirically investigate performance of these estimators. We evaluate their performance in terms of expected probability of parameter coverage and confidence interval length calculated as means of possible outcomes weighted by the appropriate outcome probabilities for each parameter value considered. The unbiased estimator of the parameter is the preferred estimator relative to the maximum likelihood estimator and an estimator based on a negative binomial approximation, as evidenced by empirical estimates of closeness to the true parameter value. Confidence intervals based on the unbiased estimator tend to be shorter than the two competitors because of its relatively small variance but at a slight cost in terms of coverage probability.     

On Some Optimal Bayesian Nonparametric Rules for Estimating Distribution Functions

In this paper, we present a novel approach to estimating distribution functions, which combines ideas from Bayesian nonparametric inference, decision theory and robustness. Given a sample from a Dirichlet process on the space (𝒳, A), with parameter η in a class of measures, the sampling distribution function is estimated according to some optimality criteria (mainly minimax and regret), when a quadratic loss function is assumed. Estimates are then compared in two examples: one with simulated data and one with gas escapes data in a city network.     

Approximate minimax estimation in linear regression: theoretical results

We consider to ordinary linear regression model where the parameter vector ß is constrained to a given ellipsoid. It will be shown that within the class of linear statistics for ß where exists a (sub-)sequence of approximate minimax estimators converging to an exact minimax estimator. This result is valid for an arbitrary quadratic loss function.     

Statistical Inference for Renewal Processes

We consider non‐parametric estimation for interarrival times density of a renewal process. For continuous time observation, a projection estimator in the orthonormal Laguerre basis is built. Nonstandard decompositions lead to bounds on the mean integrated squared error (MISE), from which rates of convergence on Sobolev–Laguerre spaces are deduced, when the length of the observation interval gets large. The more realistic setting of discrete time observation is more difficult to handle. A first strategy consists in neglecting the discretization error. A more precise strategy aims at taking into account the convolution structure of the data. Under a simplifying ‘dead‐zone’ condition, the corresponding MISE is given for any sampling step. In the three cases, an automatic model selection procedure is described and gives the best MISE, up to a logarithmic term. The results are illustrated through a simulation study.