Confidence Bounds For The Binomial N Parameter: A Classical Approach

A method is described for finding the distribution of an estimator for the parameter N of the binomial distribution in order to construct confidence bounds for N. Using a partition generating algorithm, tables of lower confidence bounds are provided for a range of values, illustrating the nature of the problems involved in estimating the parameters. Examples are considered and the lower bounds compared with the convenient approximate bounds due to Hoel (1947), suggesting the approximate bounds are appropriate more generally then originally thought.     

Posterior ranges of functions of parameters under priors with specified quantiles

Suppose some quantiles of the prior distribution of a nonnegative parameter θ are specified. Instead of eliciting just one prior density function, consider the class Γ of all the density functions compatible with the quantile specification. Given a likelihood function, find the posterior upper and lower bounds for the expected value of any real-valued function h(θ), as the density varies in Γ. Such a scheme agrees with a robust Bayesian viewpoint. Under mild regularity conditions about h(θ) and the likelihood, a procedure for finding bounds is derived and applied to an example, after transforming the given functional optimisation problems into finite-dimensional ones.     

On lower bounds for tail probabilities

Chebyshev's inequality and its generalizations make it possible to give upper bounds for the tail probabilities in the distribution of a random variable. We present a method of finding lower bounds for these probabilities . The method is based on improvements of the Lyapunov inequality for moments of a random variable.     

Comparison of bias-reducing methods for estimating the parameter in dilution series

Ten different estimators of the parameter in a limiting or serial dilution assay are compared. Eight of them are constructed to reduce the bias of the commonly used maximum likelihood estimator. Extensive Monte Carlo experiments using various designs, and practical considerations, suggest that a particular jackknife version of the maximum likelihood estimator is preferred, provided that the design is not too small.     

Confidence intervals for a bounded mean in exponential families

Setting confidence bounds or intervals for a parameter in a restricted parameter space is an important issue in applications and is widely discussed in the recent literature. In this article, we focus on the distributions in the exponential families, and propose general forms of the truncated Pratt interval and rp interval for the means. We take the Poisson distribution as an example to illustrate the method and compare it with the other existing intervals. Besides possessing the merits from the theoretical inferences, the proposed intervals are also shown to be competitive approaches from simulation and real-data application studies.     

Robust bayesian analysis given bounds on the probability of a set

Suppose that just the lower and the upper bounds on the probability of a measurable subset K in the parameter space ω are a priori known. Instead of eliciting a unique prior probability measure, consider the class Γ of all the probability measures compatible with such bounds. Under mild regularity conditions about the likelihood function, both prior and posterior bounds on the expected value of any function of the unknown parameter ω are computed, as the prior measure varies in Γ. Such bounds are analysed according to the robust Bayesian viewpoint. Furthermore, lower and upper bounds on the Bayes factor are corisidered. Finally, the local sensitivity analysis is performed, considering the class Γ as a aeighbourhood of an elicited prior     

Percentile Related Bounds and Estimator for the Mean of the Negative Binomial Distribution

Upper and lower bounds are obtained for the mean of the negative binomial distribution. These bounds are simple functions of a percentile determined by the shape parameter. The result is then used to obtain a robust estimate of the mean when the shape parameter is known.     

Estimating numbers of infectious units from serial dilution assays

Summary.  The paper concerns the design and analysis of serial dilution assays to estimate the infectivity of a sample of tissue when it is assumed that the sample contains a finite number of indivisible infectious units such that a subsample will be infectious if it contains one or more of these units. The aim of the study is to estimate the number of infectious units in the original sample. The standard approach to the analysis of data from such a study is based on the assumption of independence of aliquots both at the same dilution level and at different dilution levels, so that the numbers of infectious units in the aliquots follow independent Poisson distributions. An alternative approach is based on calculation of the expected value of the total number of samples tested that are not infectious. We derive the likelihood for the data on the basis of the discrete number of infectious units, enabling calculation of the maximum likelihood estimate and likelihood-based confidence intervals. We use the exact probabilities that are obtained to compare the maximum likelihood estimate with those given by the other methods in terms of bias and standard error and to compare the coverage of the confidence intervals. We show that the methods have very similar properties and conclude that for practical use the method that is based on the Poisson assumption is to be recommended, since it can be implemented by using standard statistical software. Finally we consider the design of serial dilution assays, concluding that it is important that neither the dilution factor nor the number of samples that remain untested should be too large.     

On the Optimality and Limitations of Buehler Bounds

In 1957, R.J. Buehler gave a method of constructing honest upper confidence limits for a parameter that are as small as possible subject to a pre‐specified ordering restriction. In reliability theory, these ‘Buehler bounds’ play a central role in setting upper confidence limits for failure probabilities. Despite their stated strong optimality property, Buehler bounds remain virtually unknown to the wider statistical audience. This paper has two purposes. First, it points out that Buehler's construction is not well defined in general. However, a slightly modified version of the Buehler construction is minimal in a slightly weaker, but still compelling, sense. A proof is presented of the optimality of this modified Buehler construction under minimal regularity conditions. Second, the paper demonstrates that Buehler bounds can be expressed as the supremum of Buehler bounds conditional on any nuisance parameters, under very weak assumptions. This result is then used to demonstrate that Buehler bounds reduce to a trivial construction for the location‐scale model. This places important practical limits on the application of Buehler bounds and explains why they are not as well known as they deserve to be.     

The limiting bound of Efron's W-formula for hypothesis testing when a nuisance parameter is present only under the alternative

When testing a hypothesis with a nuisance parameter present only under the alternative, the maximum of a test statistic over the nuisance parameter space has been proposed. Different upper bounds for the one-sided tail probabilities of the maximum tests were provided. Davies (1977. Biometrika 64, 247–254) studied the problem when the parameter space is an interval, while Efron (1997. Biometrika 84, 143–157) considered the problem with some finite points of the parameter space and obtained a W-formula. We study the limiting bound of Efron's W-formula when the number of points in the parameter space goes to infinity. The conditions under which the limiting bound of the W-formula is identical to that of Davies are given. The results are also extended to two-sided tests. Examples are used to illustrate the conditions, including case-control genetic association studies. Efficient calculations of upper bounds for the tail probability with finite points in the parameter space are described.     

Micro-Level Estimation of Optimal Consumption Choice With Intertemporal Nonseparability in Preferences and Measurement Errors

This article investigates the presence of habit formation in household consumption, using data from the Panel Study of Income Dynamics. We develop an econometric model of internal habit formation of the multiplicative specification. The restrictions of the model allow for classical measurement errors in consumption without parametric assumptions on the distribution of measurement errors. We estimate the parameters by nonlinear generalized method of moments and find that habit formation is an important determinant of household food-consumption patterns. Using the parameter estimates, we develop bounds for the expectation of the implied heterogenous intertemporal elasticity of substitution and relative risk aversion that account for measurement errors, and compute confidence intervals for these bounds. Supplementary materials for this article are available online.     

Kshirsagar-Type Lower Bounds for Mean Squared Error of Prediction

Let Y be an observable random vector and Z be an unobserved random variable with joint density f(y, z | θ), where θ is an unknown parameter vector. Considering the problem of predicting Z based on Y, we derive Kshirsagar type lower bounds for the mean squared error of any predictor of Z. These bounds do not require the regularity conditions of Bhattacharyya bounds and hence are more widely applicable. Moreover, the new bounds are shown to be sharper than the corresponding Bhattacharyya bounds. The conditions for attaining the new lower bounds are useful for easy derivation of best unbiased predictors, which we illustrate with some examples.     

Validation of qualitative microbiological test methods

This paper considers a statistical model for the detection mechanism of qualitative microbiological test methods with a parameter for the detection proportion (the probability to detect a single organism) and a parameter for the false positive rate. It is demonstrated that the detection proportion and the bacterial density cannot be estimated separately, not even in a multiple dilution experiment. Only the product can be estimated, changing the interpretation of the most probable number estimator. The asymptotic power of the likelihood ratio statistic for comparing an alternative method with the compendial method, is optimal for a single dilution experiment. The bacterial density should either be close to two CFUs per test unit or equal to zero, depending on differences in the model parameters between the two test methods. The proposed strategy for method validation is to use these two dilutions and test for differences in the two model parameters, addressing the validation parameters specificity and accuracy. Robustness of these two parameters might still be required, but all other validation parameters can be omitted. A confidence interval‐based approach for the ratio of the detection proportions for the two methods is recommended, since it is most informative and close to the power of the likelihood ratio test. Copyright © 2014 John Wiley & Sons, Ltd.     

部分函数型线性变系数模型的序列相关检验

部分函数型线性变系数模型(PFLVCM)是近几年出现的一个比较灵活、应用广泛的新模型。在实际应用中,搜集到的经济和金融数据往往存在序列相关性。如果不考虑数据间的相关性直接对其进行建模,会影响模型中参数估计的精度和有效性。本文主要研究了PFLVCM中误差的序列相关性的检验问题,基于经验似然,把标量时间序列数据相关性检验的方法拓展到函数型数据中,提出了经验对数似然比检验统计量,并在零假设下得到了检验统计量的近似分布。通过蒙特卡洛数值模拟说明该统计量在有限样本下有良好的水平和功效。最后,把该方法用于检验美国商业用电消费数据是否有序列相关性,证明该统计量的有效性和实用性。     

SHOULD WE ESTIMATE THE PROBABILITY OF CORRECT SELECTION?

Various authors, given k location parameters, have considered lower confidence bounds on (standardized) dserences between the largest and each of the other k - 1 parameters. They have then used these bounds to put lower confidence bounds on the probability of correct selection (PCS) in the same experiment (as was used for finding the lower bounds on differences). It is pointed out that this is an inappropriate inference procedure. Moreover, if the PCS refers to some later experiment it is shown that if a non-trivial confidence bound is possible then it is already possible to conclude, with greater confidence, that correct selection has occurred in the first experiment. The short answer to the question in the title is therefore ‘No’, but this should be qualified in the case of a Bayesian analysis.     

Simultaneous upper confidence bounds for distances from the best two-parameter exponentlal distribution

Consider k independent exponential distributions possibly with different location parameters and a common scale parameter. If the best population is defined to be the one having the largest mean or equivalently having the largest location parameter, we then derive a set of simultaneous upper confidence bounds for all distances of the means from the largest one. These bounds not only can serve as confidence intervals for all distances from the largest parameter but they also can be used to identify the best population. Relationships to ranking and selection procedures are pointed out. Cases in which scale parameters are known or unknown and samples are complete or type II censored are considered. Tables to implement this procedure are given.     

Further results on simultaneous confidence bounds in normal models with restricted alternatives

Consider a setup where one-sided simultaneous confidence bounds for linear parametric functions are desired. Here we improve the Bohrer and Francis (1972) bounds for situations where apriori information on the parameters is available in form of some restrictions on the parameter space. Application is made essentially to ordered ANOVA models and simple-tree ANOVA models.     

Approximate computations for binary Markov random fields and their use in Bayesian models

Discrete Markov random fields form a natural class of models to represent images and spatial datasets. The use of such models is, however, hampered by a computationally intractable normalising constant. This makes parameter estimation and a fully Bayesian treatment of discrete Markov random fields difficult. We apply approximation theory for pseudo-Boolean functions to binary Markov random fields and construct approximations and upper and lower bounds for the associated computationally intractable normalising constant. As a by-product of this process we also get a partially ordered Markov model approximation of the binary Markov random field. We present numerical examples with both the pairwise interaction Ising model and with higher-order interaction models, showing the quality of our approximations and bounds. We also present simulation examples and one real data example demonstrating how the approximations and bounds can be applied for parameter estimation and to handle a fully Bayesian model computationally.     

Asymptotic Bias in Parameter Estimation of AR-Processes Using Recursive Least Squares with Exponential Forgetting

The recursive least squares technique is often extended with exponential forgetting as a tool for parameter estimation in time-varying systems. The distribution of the resulting parameter estimates is, however, unknown when the forgetting factor is less than one. In this paper an approximative expression for bias of the recursively obtained parameter estimates in a time-invariant AR( n_a ) process with arbitrary noise is given, showing that the bias is non-zero and giving bounds on the approximation errors. Simulations confirm the approximation expressions.     

On lower confidence bounds for pcs in truncated location parameter models

We are concerned with deriving lower confidence bounds for the probability of a correct selection in truncated location-parameter models. Two cases are considered according to whether the scale parameter is known or unknown. For each case, a lower confidence bound for the difference between the best and the second best is obtained. These lower confidence bounds are used to construct lower confidence bounds for the probability of a correct selection. The results are then applied to the problem of seleting the best exponential populationhaving the largest truncated location-parameter. Useful tables are provided for implementing the proposed methods.