Simultaneous Confidence Intervals for the Population Cell Means,for Two-by-Two Factorial Data,that Utilize Uncertain Prior Information

Consider a two-by-two factorial experiment with more than one replicate. Suppose that we have uncertain prior information that the two-factor interaction is zero. We describe new simultaneous frequentist confidence intervals for the four population cell means, with simultaneous confidence coefficient 1 ? α, that utilize this prior information in the following sense. These simultaneous confidence intervals define a cube with expected volume that (a) is relatively small when the two-factor interaction is zero and (b) has maximum value that is not too large. Also, these intervals coincide with the standard simultaneous confidence intervals obtained by Tukey’s method, with simultaneous confidence coefficient 1 ? α, when the data strongly contradict the prior information that the two-factor interaction is zero. We illustrate the application of these new simultaneous confidence intervals to a real data set.     

The performance of model averaged tail area confidence intervals

We investigate the exact coverage and expected length properties of the model averaged tail area (MATA) confidence interval proposed by Turek and Fletcher, CSDA, 2012, in the context of two nested, normal linear regression models. The simpler model is obtained by applying a single linear constraint on the regression parameter vector of the full model. For given length of response vector and nominal coverage of the MATA confidence interval, we consider all possible models of this type and all possible true parameter values, together with a wide class of design matrices and parameters of interest. Our results show that, while not ideal, MATA confidence intervals perform surprisingly well in our regression scenario, provided that we use the minimum weight within the class of weights that we consider on the simpler model.     

Profile upper Confidence Limits from Discrete Data

When the data are discrete, standard approximate confidence limits often have coverage well below nominal for some parameter values. While ad hoc adjustments may largely solve this problem for particular cases, Kabaila & Lloyd (1997) gave a more systematic method of adjustment which leads to tight upper limits, which have coverage which is never below nominal and are as small as possible within a particular class. However, their computation for all but the simplest models is infeasible. This paper suggests modifying tight upper limits by an initial replacement of the unknown nuisance parameter vector by its profile maximum likelihood estimator. While the resulting limits no longer possess the optimal properties of tight limits exactly, the paper presents both numerical and theoretical evidence that the resulting coverage function is close to optimal. Moreover these profile upper limits are much (possibly many orders of magnitude) easier to compute than tight upper limits.     

ON THE COVERAGE PROBABILITY OF CONFIDENCE INTERVALS IN REGRESSION AFTER VARIABLE SELECTION

This paper considers a linear regression model with regression parameter vector β. The parameter of interest is θ= a^Tβ where a is specified. When, as a first step, a data‐based variable selection (e.g. minimum Akaike information criterion) is used to select a model, it is common statistical practice to then carry out inference about θ, using the same data, based on the (false) assumption that the selected model had been provided a priori. The paper considers a confidence interval for θ with nominal coverage 1 ‐ α constructed on this (false) assumption, and calls this the naive 1 ‐ α confidence interval. The minimum coverage probability of this confidence interval can be calculated for simple variable selection procedures involving only a single variable. However, the kinds of variable selection procedures used in practice are typically much more complicated. For the real‐life data presented in this paper, there are 20 variables each of which is to be either included or not, leading to 2²⁰ different models. The coverage probability at any given value of the parameters provides an upper bound on the minimum coverage probability of the naive confidence interval. This paper derives a new Monte Carlo simulation estimator of the coverage probability, which uses conditioning for variance reduction. For these real‐life data, the gain in efficiency of this Monte Carlo simulation due to conditioning ranged from 2 to 6. The paper also presents a simple one‐dimensional search strategy for parameter values at which the coverage probability is relatively small. For these real‐life data, this search leads to parameter values for which the coverage probability of the naive 0.95 confidence interval is 0.79 for variable selection using the Akaike information criterion and 0.70 for variable selection using Bayes information criterion, showing that these confidence intervals are completely inadequate.     

CONFIDENCE INTERVALS UTILIZING PRIOR INFORMATION IN THE BEHRENS–FISHER PROBLEM

Consider two independent random samples of size f + 1 , one from an N (μ₁, σ²₁) distribution and the other from an N (μ₂, σ²₂) distribution, where σ²₁/σ²₂∈ (0, ∞) . The Welch ‘approximate degrees of freedom’ (‘approximate t‐solution’) confidence interval for μ₁?μ₂ is commonly used when it cannot be guaranteed that σ²₁/σ²₂= 1 . Kabaila (2005, Comm. Statist. Theory and Methods 34 , 291–302) multiplied the half‐width of this interval by a positive constant so that the resulting interval, denoted by J₀, has minimum coverage probability 1 ?α. Now suppose that we have uncertain prior information that σ²₁/σ²₂= 1. We consider a broad class of confidence intervals for μ₁?μ₂ with minimum coverage probability 1 ?α. This class includes the interval J₀, which we use as the standard against which other members of will be judged. A confidence interval utilizes the prior information substantially better than J₀ if (expected length of J)/(expected length of J₀) is (a) substantially less than 1 (less than 0.96, say) for σ²₁/σ²₂= 1 , and (b) not too much larger than 1 for all other values of σ²₁/σ²₂ . For a given f, does there exist a confidence interval that satisfies these conditions? We focus on the question of whether condition (a) can be satisfied. For each given f, we compute a lower bound to the minimum over of (expected length of J)/(expected length of J₀) when σ²₁/σ²₂= 1 . For 1 ?α= 0.95 , this lower bound is not substantially less than 1. Thus, there does not exist any confidence interval belonging to that utilizes the prior information substantially better than J₀.     

Admissible variable-selection procedures when fitting misspecified regression models by least squares

For loss equal to squared error of prediction, Kempthorne(l984) has proved that all variable-selection procedures are admissible for choosing among least-squares fits of a normal linear regression model. We extend this result to the case of a normal linear regression model in which the form of the expected response vector is misspecified.     

The Coverage Probability of Confidence Intervals in One‐Way Analysis of Covariance after Two F Tests

Volume 3 of Analysis of Messy Data by Milliken & Johnson (2002) provides detailed recommendations about sequential model development for the analysis of covariance. In his review of this volume, Koehler (2002) asks whether users should be concerned about the effect of this sequential model development on the coverage probabilities of confidence intervals for comparing treatments. We present a general methodology for the examination of these coverage probabilities in the context of the two‐stage model selection procedure that uses two F tests and is proposed in Chapter 2 of Milliken & Johnson (2002). We apply this methodology to an illustrative example from this volume and show that these coverage probabilities are typically very far below nominal. Our conclusion is that users should be very concerned about the coverage probabilities of confidence intervals for comparing treatments constructed after this two‐stage model selection procedure.     

Exact short poisson confidence intervals

The authors propose a new method for constructing a confidence interval for the expectation θ of a Poisson random variable. The interval they obtain cannot be shortened without the infimum over θ of the coverage probability falling below 1 ‐ α. In addition, the endpoints of the interval are strictly increasing functions of the observed variable. An easy‐to‐program algorithm is provided for computing this interval.