Robust bayesian analysis given a lower bound on the probability of a set

Suppose that just the lower bound of the probability of a measurable subset K in the parameter space Ω is a priori known, when inferences are to be made about measurable subsets A in Ω. Instead of eliciting a unique prior distribution, consider the class Г of all the distributions compatible with such bound. Under mild regularity conditions about the likelihood function, the range of the posterior probability of any A is found, as the prior distribution varies in Г. Such ranges are analysed according to the robust Bayesian viewpoint. Furthermore, some characterising properties of the extended likelihood sets are proved. The prior distributions in Г are then considered as a neighbour class of an elicited prior, comparing likelihood sets and HPD in terms of robustness.     

Sampling Some Truncated Distributions Via Rejection Algorithms

In this article, we develop rejection sampling algorithms to sample from some truncated and tail distributions. Such samplers are needed in many Markov chain Monte Carlo methods, often in connection with Bayesian inference. In addition to univariate normal, gamma, and beta distributions, we consider multivariate normal distributions truncated to certain sets.     

On a generalization of Poisson sampling

In real-time sampling, the units of a population pass a sampler one by one. Alternatively the sampler may successively visit the units of the population. Each unit passes only once and at that time it is decided whether or not it should be included in the sample. The goal is to take a sample and efficiently estimate a population parameter. The list sequential sampling method presented here is called correlated Poisson sampling. The method is an alternative to Poisson sampling, where the units are sampled independently with given inclusion probabilities. Correlated Poisson sampling uses weights to create correlations between the inclusion indicators. In that way it is possible to reduce the variation of the sample size and to make the samples more evenly spread over the population. Simulation shows that correlated Poisson sampling improves the efficiency in many cases.     

Turing’s anticipation of empirical bayes in connection with the cryptanalysis of the naval enigma *

The Enigma was a cryptographic (enciphering) machine used by the German military during WWII. The German navy changed part of the Enigma keys every other day. One of the important cryptanalytic attacks against the naval usage was called Banburismus, a sequentiai Bayesian procedure (anticipating sequential analysis) which was used from the sorine of 1941 until the middle of 1943. It was invented mainlv bv A. M. Turina and was perhaps the first important sequential Bayesian IE is unnecessab to describe it here. Before Banburismus could be started on a given day it was necessary to identifv which of nine ‘biaram’ (or ‘diaraph’) tables was in use on that day. In Turing’s approach to this identification hk had io istimate the probabilities of certain ‘trigraphs’. rrhese trigraphs were used. as described below. for determinine the initial wheel settings of messages). For estimatidg the probabilities, Turing inventedin important special case o the nonparametric (nonhypermetric) Empirid Bayes method independently of Herbert Robbins. The techniaue is the sumxisine form of Emdrical Baves in which a physical prior is assumed to eist but no apbroxiGate functional fonn is assumed for it.     

Accurate probabilities for the sign test

Limitations in currently available methods for producing significance probabilities for the sign test are discussed. Two simple modifications to the continuity corrected normal approximation are derived and presented in a simple form. These modifications are shown to markedly reduce the relative error in approximating exact probabilities. The relative simplicity of these modifications and the importance of accurate p values suggest that one or both modifications could be useful improvements.     

Errors of misclassification associated with the inverse gaussion distribution

Errors of misclassification and their probabilities are studied for classification problems associated with univariate inverse Gaussian distributions. The effects of applying the linear discriminant function (LDF), based on normality, to inverse Gaussian populations are assessed by comparing probabilities (optimum and conditional) based on the LDF with those based on the likelihood ratio rule (LR) for the inverse Gaussian, Both theoretical and empirical results are presented     

General saddlepoint approximations to distributions under an elliptical population

General saddlepoint approximations are derived for the distributions of statistics under an elliptical population. The technique is applied to obtain the tail probabilities of latent roots of a sample covariance matrix. It is shown that the method based on normalizing transformations by Tsuchiya and Konishi (1997) is efficient for the sample correlation coefficient in an elliptical sample.     

Sign test for ranked-set sampling

The exact null distribution of the ranked-set sample (RSS) sign test statistic is computed. The power of this test is compared with the simple random sample (SRS) sign test for some continuous symmetric distributions. The problem of imperfect judgement is discussed. The superiority of RSS over SRS is demonstrated.     

Random effects in generalized linear models and the em algoritham

Nelder and Wedderburn (1972) gave a practical fitting procedure that encompassed a more gencral family of data distributions than the Gaussian distribution and provided an easily understood conceptual framework. In extending the framework to more than one error structure the technical difficulties of the fitting procedure have tended to cloud the concepts. Here we show that a simple extension to the fitting procedure is possible and thus pave the way for a fuller examimtion of mixed effects models in generalized linear model distributions. It is clear that we should not, and do not have to, confine ourselves to fitting random effects using the Gaussian distribiition. In addition, in, some quite general mixing distribution problems the application of the EM algorithm to the complete data likelihood leads to iterative schemes that maximize the marginal likelihood of the observed data variable.     

Model-Averaged Benchmark Concentration Estimates for Continuous Response Data Arising from Epidemiological Studies

Worker populations often provide data on adverse responses associated with exposure to potential hazards. The relationship between hazard exposure levels and adverse response can be modeled and then inverted to estimate the exposure associated with some specified response level. One concern is that this endpoint may be sensitive to the concentration metric and other variables included in the model. Further, it may be that the models yielding different risk endpoints are all providing relatively similar fits. We focus on evaluating the impact of exposure on a continuous response by constructing a model-averaged benchmark concentration from a weighted average of model-specific benchmark concentrations. A method for combining the estimates based on different models is applied to lung function in a cohort of miners exposed to coal dust. In this analysis, we see that a small number of the thousands of models considered survive a filtering criterion for use in averaging. Even after filtering, the models considered yield benchmark concentrations that differ by a factor of 2 to 9 depending on the concentration metric and covariates. The model-average BMC captures this uncertainty, and provides a useful strategy for addressing model uncertainty.