Asymptotic posterior normality for multiparameter problems

For asymptotic posterior normality in the one-parameter cases, Weng [2003. On Stein's identity for posterior normality. Statist. Sinica 13, 495–506] proposed to use a version of Stein's Identity to write the posterior expectations for functions of a normalized quantity in a form that is more transparent and can be easily analyzed. In the present paper we extend this approach to the multi-parameter cases and compare our conditions with earlier work. Three examples are used to illustrate the application of this method.     

Non Uniform Bounds on Geometric Approximation Via Stein's Method and w-Functions

In this article, we use Stein's method and w-functions to give uniform and non uniform bounds in the geometric approximation of a non negative integer-valued random variable. We give some applications of the results of this approximation concerning the beta-geometric, Pólya, and Poisson distributions.     

LOWER BOUNDS FOR THE NORMAL APPROXIMATION OF A SUM OF INDEPENDENT RANDOM VARIABLES

The rates of convergence to the normal distribution are investigated for a sum of independent random variables. Using Stein's method, we derive a lower bound of the uniform distance between two distributions of independent sum and normal.     

Minimax estimation of normal precisions via expansion estimators

In this paper, the simultaneous estimation of the precision parameters of k normal distributions is considered under the squared loss function in a decision-theoretic framework. Several classes of minimax estimators are derived by using the chi-square identity, and the generalized Bayes minimax estimators are developed out of the classes. It is also shown that the improvement on the unbiased estimators is characterized by the superharmonic function. This corresponds to Stein's [1981. Estimation of the mean of a multivariate normal distribution. Ann. Statist. 9, 1135–1151] result in simultaneous estimation of normal means.     

An improvement of a non-uniform bound for combinatorial central limit theorem

In this article, we develop a new Rosenthal Inequality for uniform random permutation sums of random variables with finite third moments and apply it to obtain a sharp non-uniform bound for the combinatorial central limit theorem using the Stein's method and the exchangeable pair techniques. The obtained bound is shown to be sharper than other existing bounds.     

The heat equation and Stein's identity: Connections,applications

This article presents two expectation identities and a series of applications. One of the identities uses the heat equation, and we show that in some families of distributions the identity characterizes the normal distribution. We also show that it is essentially equivalent to Stein's identity. The applications we have presented are of a broad range. They include exact formulas and bounds for moments, an improvement and a reversal of Jensen's inequality, linking unbiased estimation to elliptic partial differential equations, applications to decision theory and Bayesian statistics, and an application to counting matchings in graph theory. Some examples are also given.     

On approximating distribution of the quadratic discriminant function

The quadratic discriminant function (QDF) with known parameters has been represented in terms of a weighted sum of independent noncentral chi-square variables. To approximate the density function of the QDF as m-dimensional exponential family, its moments in each order have been calculated. This is done using the recursive formula for the moments via the Stein's identity in the exponential family. We validate the performance of our method using simulation study and compare with other methods in the literature based on the real data. The finding results reveal better estimation of misclassification probabilities, and less computation time with our method.     

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     

Estimation of a scale parameter in mixture models with unknown location

Estimation of the scale parameter in mixture models with unknown location is considered under Stein's loss. Under certain conditions, the inadmissibility of the “usual” estimator is established by exhibiting better estimators. In addition, robust improvements are found for a specified submodel of the original model. The results are applied to mixtures of normal distributions and mixtures of exponential distributions. Improved estimators of the variance of a normal distribution are shown to be robust under any scale mixture of normals having variance greater than the variance of that normal distribution. In particular, Stein's (Ann. Inst. Statist. Math. 16 (1964) 155) and Brewster's and Zidek's (Ann. Statist. 2 (1974) 21) estimators obtained under the normal model are robust under the t model, for arbitrary degrees of freedom, and under the double-exponential model. Improved estimators for the variance of a t distribution with unknown and arbitrary degrees of freedom are also given. In addition, improved estimators for the scale parameter of the multivariate Lomax distribution (which arises as a certain mixture of exponential distributions) are derived and the robustness of Zidek's (Ann. Statist. 1 (1973) 264) and Brewster's (Ann. Statist. 2 (1974) 553) estimators of the scale parameter of an exponential distribution is established under a class of modified Lomax distributions.     

Stein's identity,Fisher information,and projection pursuit: A triangulation

Two separate structure discovery properties of Fisher's LDF are derived in a mixture multivariate normal setting. One of the properties is related to Fisher information and is proved by using Stein's identity. The other property is on lack of unimodality. The properties are used to give three selection rules for choice of informative projections of high-dimensional data, not necessarily multivariate normal. Their usefulness in the two group-classification problem is studied theoretically and by means of examples. Extensions and various issues about practical implementation are discussed.     

A note on Stein's lemma for multivariate elliptical distributions

When two random variables are bivariate normally distributed Stein's original lemma allows to conveniently express the covariance of the first variable with a function of the second. Landsman and Neslehova (2008) extend this seminal result to the family of multivariate elliptical distributions. In this paper we use the technique of conditioning to provide a more elegant proof for their result. In doing so, we also present a new proof for the classical linear regression result that holds for the elliptical family.     

On Stein's method, smoothing estimates in total variation distance and mixture distributions

In many settings it is useful to have bounds on the total variation distance between some random variable Z and its shifted version Z+1. For example, such quantities are often needed when applying Stein's method for probability approximation. This note considers one way in which such bounds can be derived, in cases where Z is either the equilibrium distribution of some birth-death process or the mixture of such a distribution. Applications of these bounds are given to translated Poisson and compound Poisson approximations for Poisson mixtures and the Pólya distribution.     

A reexamination of stein's antifiducial example

In Stein's 1959 example, for any sample with n sufficiently large, there is a confidence set embedded simultaneously within two regular confidence belts—one with coverage frequency smaller than an arbitrary positive ϵ, the other with coverage frequency larger than 1 — ϵ. Thus, Stein's example may be seen as an extreme case of mutually conflicting confidence statements, illustrating a possibility anticipated and denounced by Fisher.     

Minimax property of stein's estimator

Stein's estimator and some other estimators of the mean of a K-variate normal distribution are known to dominate the maximum likelihood estimator under quadratic loss for K > 3, and are therefore minimax. In this paper it is shown that the minimax property of Stein's rule is preserved with respect to a generalized loss function.     

Stein's two sample test of a general linear hypothesis and a noncentral f–type distribution

Stein's two–sample procedure for a general linear model is studied and derived in terms of matrices in which the error tems are distributed as multivatriate student t–error terms. Tests and confidence regions are constructed in a similar way to classical linear models which involves percentage points of student t and F distributions. The advantages of taking two samples are: the variance of the error terms is known, and the power of tests are size of confidence regions are controllable. A new distribution called noncentral F–type distribution different from the nencentral F is found when considerinf the power of the test of general linear hypothesis.     

The Bayes rule of the variance parameter of the hierarchical normal and inverse gamma model under Stein's loss

For the variance parameter of the hierarchical normal and inverse gamma model, we analytically calculate the Bayes rule (estimator) with respect to a prior distribution IG (alpha, beta) under Stein's loss function. This estimator minimizes the posterior expected Stein's loss (PESL). We also analytically calculate the Bayes rule and the PESL under the squared error loss. Finally, the numerical simulations exemplify that the PESLs depend only on alpha and the number of observations. The Bayes rules and PESLs under Stein's loss are unanimously smaller than those under the squared error loss.     

Improved robust Bayes estimators of the error variance in linear models

We consider the problem of estimating the error variance in a general linear model when the error distribution is assumed to be spherically symmetric, but not necessary Gaussian. In particular we study the case of a scale mixture of Gaussians including the particularly important case of the multivariate-t distribution. Under Stein's loss, we construct a class of estimators that improve on the usual best unbiased (and best equivariant) estimator. Our class has the interesting double robustness property of being simultaneously generalized Bayes (for the same generalized prior) and minimax over the entire class of scale mixture of Gaussian distributions.     

STEIN'S METHOD AND THE BERRY-ESSÉEN THEOREM

Stein's method is used to prove the Lindeberg-Feller theorem and a generalization of the Berry-Esséen theorem. The arguments involve only manipulation of probability inequalities, and form an attractive alternative to the less direct Fourier-analytic methods which are traditionally employed.     

A non uniform bound on geometric approximation with w-functions

The aim of this paper is a use of Stein’s method and w-functions to determine a non uniform bound on the geometric approximation for a non negative integer-valued random variable. Some applications of the obtained results are provided to approximate the negative hypergeometric, Pólya and negative Pólya distributions.     

A Study of Expansions of Posterior Distributions

Johnson (1970 Johnson , R. ( 1970 ). Asymptotic expansions associated with posterior distributions . Ann. Math. Statist. 41 : 851 – 864 .[Crossref] , [Google Scholar]) obtained expansions for marginal posterior distributions through Taylor expansions. Here, the posterior expansion is expressed in terms of the likelihood and the prior together with their derivatives. Recently, Weng (2010 Weng , R. C. ( 2010 ). A Bayesian Edgeworth expansion by Stein's Identity . Bayesian Anal. 5 ( 4 ): 741 – 764 .[Crossref], [Web of Science ®] , [Google Scholar]) used a version of Stein's identity to derive a Bayesian Edgeworth expansion, expressed by posterior moments. Since the pivots used in these two articles are the same, it is of interest to compare these two expansions.

We found that our O(t ^?1/2) term agrees with Johnson's arithmetically, but the O(t ^?1) term does not. The simulations confirmed this finding and revealed that our O(t ^?1) term gives better performance than Johnson's.