On the Optimality and Limitations of Buehler Bounds
AbstractIn 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. Copyright 2003 Australian Statistical Publishing Association Inc..
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Australian Statistical Publishing Association Inc. in its journal Australian & New Zealand Journal of Statistics.
Volume (Year): 45 (2003)
Issue (Month): 2 (06)
Contact details of provider:
Web page: http://www.blackwellpublishing.com/journal.asp?ref=1369-1473
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Lloyd, Chris J., 2008. "More powerful exact tests of binary matched pairs," Statistics & Probability Letters, Elsevier, vol. 78(16), pages 2592-2596, November.
- Kabaila, Paul & Lloyd, Chris J., 2003. "The efficiency of Buehler confidence limits," Statistics & Probability Letters, Elsevier, vol. 65(1), pages 21-28, October.
- Lloyd, Chris J., 2005. "Monotonicity of likelihood support bounds for system failure rates," Statistics & Probability Letters, Elsevier, vol. 73(2), pages 91-97, June.
- Kabaila, Paul, 2008. "Statistical properties of exact confidence intervals from discrete data using studentized test statistics," Statistics & Probability Letters, Elsevier, vol. 78(6), pages 720-727, April.
- Wang, Weizhen, 2012. "An inductive order construction for the difference of two dependent proportions," Statistics & Probability Letters, Elsevier, vol. 82(8), pages 1623-1628.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Wiley-Blackwell Digital Licensing) or (Christopher F. Baum).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.