A computable confidence upper limit from discrete data with good coverage properties
We present a new and simple method for constructing a 1-[alpha] upper confidence limit for [theta] in the presence of a nuisance parameter vector [psi], when the data is discrete. Our method is based on computing a P-value P{T[less-than-or-equals, slant]t} from an estimator T of [theta], replacing the nuisance parameter by the profile maximum likelihood estimate for [theta] known, and equating to [alpha]. We provide a theoretical result which suggests that, from the point of view of coverage accuracy, this is close to the optimal replacement for the nuisance parameter. We also consider in detail limits for the (i) slope parameter of a simple linear logistic regression, (ii) odds ratio in two-way tables, (iii) ratio of means for two Poisson variables. In all these examples the coverage performance of our upper limit is a dramatic improvement on the coverage performance of the standard approximate upper limits considered.
Year of publication: |
2000
|
---|---|
Authors: | Kabaila, Paul ; Lloyd, Chris J. |
Published in: |
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 47.2000, 2, p. 189-198
|
Publisher: |
Elsevier |
Keywords: | Upper confidence limit Profile maximum likelihood estimator Coverage error Nuisance parameter |
Saved in:
Saved in favorites
Similar items by person
-
When do best confidence limits exist?
Kabaila, Paul, (2000)
-
On the Optimality and Limitations of Buehler Bounds
Lloyd, Chris J., (2003)
-
The efficiency of Buehler confidence limits
Kabaila, Paul, (2003)
- More ...