Bayesian pitman closeness

The present article brings in the notion of Posterior Pitman Closeness (PPC) in contrast to the usual Pitman Closeness (PC) criterion. Unlike the PC criterion, the PPC criterion does not suffer from lack of transitivity. Also, a posterior median is usually a posterior Pitman closest estimator of the parameter of interest. Examples are provided to illustrate these ideas. Also, some multivariate analogs of these results are presented.     

Some Pitman closeness properties pertinent to symmetric populations

In this paper, we focus on Pitman closeness probabilities when the estimators are symmetrically distributed about the unknown parameter θ. We first consider two symmetric estimators θ?₁ and θ?₂ and obtain necessary and sufficient conditions for θ?₁ to be Pitman closer to the common median θ than θ?₂. We then establish some properties in the context of estimation under the Pitman closeness criterion. We define Pitman closeness probability which measures the frequency with which an individual order statistic is Pitman closer to θ than some symmetric estimator. We show that, for symmetric populations, the sample median is Pitman closer to the population median than any other independent and symmetrically distributed estimator of θ. Finally, we discuss the use of Pitman closeness probabilities in the determination of an optimal ranked set sampling scheme (denoted by RSS) for the estimation of the population median when the underlying distribution is symmetric. We show that the best RSS scheme from symmetric populations in the sense of Pitman closeness is the median and randomized median RSS for the cases of odd and even sample sizes, respectively.     

Comparison of Robust Estimators of Standard Deviation in Normal Distributions Within the Context of Quality Control

Pitman criterion is used in simulation to determine the “closer” estimator of the standard deviation among selected choices. The initial simulation utilizes a standard normal distribution from which samples are taken of specific sizes. Popular and commonly used estimators of standard deviation are compared with the known population standard deviation in this study. Closeness criterion is calculated for each comparison and sample size. A secondary simulation applies the findings to variables control charts, in order to verify the ability of each estimator to identify out-of-control conditions.     

Estimation of two ordered normal means when a covariance matrix is known

Estimation of two normal means with an order restriction is considered when a covariance matrix is known. It is shown that restricted maximum likelihood estimator (MLE) stochastically dominates both estimators proposed by Hwang and Peddada [Confidence interval estimation subject to order restrictions. Ann Statist. 1994;22(1):67–93] and Peddada et al. [Estimation of order-restricted means from correlated data. Biometrika. 2005;92:703–715]. The estimators are also compared under the Pitman nearness criterion and it is shown that the MLE is closer to ordered means than the other two estimators. Estimation of linear functions of ordered means is also considered and a necessary and sufficient condition on the coefficients is given for the MLE to dominate the other estimators in terms of mean squared error.     

Karlin's corollary: a topological approach to pitman's measure

In this article, many of the known univariate results about Pitman's Measure of Closeness (PMC) are synthesized through a topological approach. The proofs of many known results are simplified and clarified. The approach extends some previous results established under other restrictions. Connections between PMC and Bayesian estimation are discussed but the inherent interpretations differ. A discourse on this connection can be found in the article of Ghosh and Sen (1991). A transitiveness property for ordered estimators is established and a counter example is given for unordered ones. These results help distinguish between the Bayesian and classical interpretations of Pitman's measure.     

A comparison of biased regression estimators using a pitman nearness criterion

Biased regression estimators have traditionally benn studied using the Mean Square Error (MSE) criterion. Usually these comparisons have been based on the sum of the MSE's of each of the individual parameters, i.e., a scaler valued measure that is the trace of the MSE matrix. However, since this summed MSE does not consider the covariance structure of the estimators, we propose the use of a Pitman Measure of Closeness (PMC) criterion (Keating and Gupta, 1984; Keating and Mason, 1985). In this paper we consider two versions of PMC. One of these compares the estimates and the other compares the resultant predicted values for 12 different regression estimators. These estimators represent three classes of estimators, namely, ridge, shrunken, and principal component estimators. The comparisons of these estimators using the PMC criteria are contrasted with the usual MSE criteria as well as the prediction mean square error. Included in the estimators is a relatively new estimator termed the generalized principal component estimator proposed by Jolliffe. This estimator has previously received little attention in the literature.     

Pitman-closeness of some preliminary test and shrinkage estimators

For the model X ～ N_p: (θ,I)preliminary test estimator (PTE), shrinkage and positive-rule versions of the MLE (X) of θare mutually compared in the light of the Pitman closeness measure. The usual dominance properties of these estimators pertaining to the conventional quadratic loss criterion are shown to remain intact in the current context too. In an asymptotic setup, the conclusions hold for a much wider class of estimators pertaining to general parametric and nonparametric models.     

A Pitman measure of similarity in k-means for clustering heavy-tailed data

One of the most popular methods and algorithms to partition data to k clusters is k-means clustering algorithm. Since this method relies on some basic conditions such as, the existence of mean and finite variance, it is unsuitable for data that their variances are infinite such as data with heavy tailed distribution. Pitman Measure of Closeness (PMC) is a criterion to show how much an estimator is close to its parameter with respect to another estimator. In this article using PMC, based on k-means clustering, a new distance and clustering algorithm is developed for heavy tailed data.     

Equivariant estimation under the pitman closeness criterion

For the point estimation in models with group structures, an invariance approach to deriving superior estimators is discussed in the Pitman closeness (PC) criterion. When the maximal invariant statistic is parameter-free, that is, ancillary, the closest equivariant estimator to the true value in the PC criterion is presented. On the other hand, as an example where a distribution of the maximalinvariant statistic depends on unknown parameters, the paper treats the Stein problem in estimation of a variance and obtains an improved estimator in the PC criterion by Stein's invariance approach. Also the Stein problem in simultaneous estimation of a location vector of a spherical symmetric distribution is studied.     

Minimax estimation of a lower-bounded scale parameter of a gamma distribution for scale-invariant squared-error loss

Let X have a gamma distribution with known shape parameter θr;aL and unknown scale parameter θ. Suppose it is known that θ ≥ a for some known a > 0. An admissible minimax estimator for scale-invariant squared-error loss is presented. This estimator is the pointwise limit of a sequence of Bayes estimators. Further, the class of truncated linear estimators C = {θ_ρ|θ_ρ(x) = max(a, ρ), ρ > 0} is studied. It is shown that each θ_ρ is inadmissible and that exactly one of them is minimax. Finally, it is shown that Katz's [Ann. Math. Statist., 32, 136–142 (1961)] estimator of θ is not minimax for our loss function. Some further properties of and comparisons among these estimators are also presented.     

Comparison of normal variance estimators under multiple criteria and towards a compromise estimator

For estimating a normal variance under the squared error loss function it is well known that the best affine (location and scale) equivariant estimator, which is better than the maximum likelihood estimator as well as the unbiased estimator, is also inadmissible. The improved estimators, e.g., stein type, brown type and Brewster–Zidek type, are all scale equivariant but not location invariant. Lately, a good amount of research has been done to compare the improved estimators in terms of risk, but comparatively less attention had been paid to compare these estimators in terms of the Pitman nearness criterion (PNC) as well as the stochastic domination criterion (SDC). In this paper, we have undertaken a comprehensive study to compare various variance estimators in terms of the PNC and the SDC, which has been long overdue. Finally, using the results for risk, the PNC and the SDC, we propose a compromise estimator (sort of a robust estimator) which appears to work ‘well’ under all the criteria discussed above.     

Pitman closeness,monotonicity and consistency of best linear unbiased and invariant estimators for exponential distribution under Type II censoring

Comparisons of best linear unbiased estimators with some other prominent estimators have been carried out over the last 50 years since the ground breaking work of Lloyd [E.H. Lloyd, Least squares estimation of location and scale parameters using order statistics, Biometrika 39 (1952), pp. 88–95]. These comparisons have been made under many different criteria across different parametric families of distributions. A noteworthy one is by Nagaraja [H.N. Nagaraja, Comparison of estimators and predictors from two-parameter exponential distribution, Sankhyā Ser. B 48 (1986), pp. 10–18], who made a comparison of best linear unbiased (BLUE) and best linear invariant (BLIE) estimators in the case of exponential distribution. In this paper, continuing along the same lines by assuming a Type II right censored sample from a scaled-exponential distribution, we first compare BLUE and BLIE of the exponential mean parameter in terms of Pitman closeness (nearness) criterion. We show that the BLUE is always Pitman closer than the BLIE. Next, we introduce the notions of Pitman monotonicity and Pitman consistency, and then establish that both BLUE and BLIE possess these two properties.     

Improved minimax estimation of a normal precision matrix

Let S_{p × p} have a Wishart distribution with parameter matrix Σ and n degrees of freedom. We consider here the problem of estimating the precision matrix Σ^?1 under the loss functions L₁(σ) tr (σ) - log |σ| and L₂(σ) = tr (σ). James-Stein-type estimators have been derived for an arbitrary p. We also obtain an orthogonal invariant and a diagonal invariant minimax estimator under both loss functions. A Monte-Carlo simulation study indicates that the risk improvement of the orthogonal invariant estimators over the James-Stein type estimators, the Haff (1979) estimator, and the “testimator” given by Sinha and Ghosh (1987) is substantial.     

Estimation of a multivariate mean with constraints on the norm

Estimation of the mean θ of a spherical distribution with prior knowledge concerning the norm ||θ|| is considered. The best equivariant estimator is obtained for the local problem ||θ|| = λ₀, and its risk is evaluated. This yields a sharp lower bound for the risk functions of a large class of estimators. The risk functions of the best equivariant estimator and the best linear estimator are compared under departures from the assumption ||θ|| = λ₀.     

Estimating powers of the generalized variance under the Pitman closeness criterion

For estimating powers of the generalized variance under a multivariate normal distribution with an unknown mean, the inadmissibility of the closest affine equivariant estimator is shown for the Pitman closeness criterion.     

Shrunken estimators via a pitman nearness criterion

Shrunken estimators have traditionally been developed and studied using mean square error (MSE). Recent research on Pitman nearness (PN), however, indicates that it is an interesting, “intrinsic”, alternative to the mean square error (MSE) criterion for investigating estimators. Thus, we develop a shrunken estimator for the mean of a multivariate normal distribution based on minimizing PN, instead of MSE, Further, since the shrinkage factor of this estimator depends on unknown parameters, we examine two approaches for determining this factor: (1) “plug-in” estimates, (2) a range of values for the factor based on an approximate cońfidence interval for the Pitman Nearness probability. A numerical example is given.     

Mean likelihood estimators

The use of Mathematica in deriving mean likelihood estimators is discussed. Comparisons are made between the mean likelihood estimator, the maximum likelihood estimator, and the Bayes estimator based on a Jeffrey's noninformative prior. These estimators are compared using the mean-square error criterion and Pitman measure of closeness. In some cases it is possible, using Mathematica, to derive exact results for these criteria. Using Mathematica, simulation comparisons among the criteria can be made for any model for which we can readily obtain estimators.In the binomial and exponential distribution cases, these criteria are evaluated exactly. In the first-order moving-average model, analytical comparisons are possible only for n = 2. In general, we find that for the binomial distribution and the first-order moving-average time series model the mean likelihood estimator outperforms the maximum likelihood estimator and the Bayes estimator with a Jeffrey's noninformative prior. Mathematica was used for symbolic and numeric computations as well as for the graphical display of results. A Mathematica notebook which provides the Mathematica code used in this article is available: http://www.stats.uwo.ca/mcleod/epubs/mele. Our article concludes with our opinions and criticisms of the relative merits of some of the popular computing environments for statistics researchers.     

Estimating the Expectation of the Log-Likelihood with Censored Data for Estimator Selection

A criterion for choosing an estimator in a family of semi-parametric estimators from incomplete data is proposed. This criterion is the expected observed log-likelihood (ELL). Adapted versions of this criterion in case of censored data and in presence of explanatory variables are exhibited. We show that likelihood cross-validation (LCV) is an estimator of ELL and we exhibit three bootstrap estimators. A simulation study considering both families of kernel and penalized likelihood estimators of the hazard function (indexed on a smoothing parameter) demonstrates good results of LCV and a bootstrap estimator called ELL_bboot . We apply the ELL_bboot criterion to compare the kernel and penalized likelihood estimators to estimate the risk of developing dementia for women using data from a large cohort study.     

Generalized james-stein estimatoes

Let the p-component vector X be normally distributed with mean θ and covariance σ²I where I denotes the identity matrix. Stein's estimator of θ is kown to dominate the usual estimator X for p ≥ 3, We obtain a family of estimators which dominate Stein's estimator for p≥ 3     

Second-order properties of intraclass correlation estimators for a symmetric normal distribution

Consider the problem of estimating the intraclass correlation coefficient of a symmetric normal distribution under the squared error loss function. The general admissibility of the standard estimators of the intraclass correlation coefficient is hard to check due to their complicated sampling distributions. We follow the asymptotic decision-theoretic approach of Ghosh and Sinha (1981) and prove that the three standard intraclass correlation estimators (the maximum-likelihood estimator, the method-of-moments estimator and the first-order unbiased estimator) are second-order admissible for all p ≥ 2, p being the dimension of the distribution.