1997Australian Journal of StatisticsRequires access

TIGHT UPPER CONFIDENCE LIMITS FROM DISCRETE DATA

Paul Kabaila, Chris J. Lloyd

Open publisher page 23 citations

Abstract

summary Consider the problem of finding an upper 1 –α confidence limit for a scalar parameter of interest ø in the presence of a nuisance parameter vector θ when the data are discrete. Approximate upper limitsTmay be found by approximating the relevant unknown finite sample distribution by its limiting distribution. Such approximate upper limits typically have coverage probabilities below, sometimes far below, 1 –α for certain values of (θ, ø). This paper remedies that defect by shifting the possible valuestofTso that they are as small as possible subject both to the minimum coverage probability being greater than or equal to 1 –α, and to the shifted values being in the same order as the unshiftedts. The resulting upper limits are called ‘tight’. Under very weak and easily checked regularity conditions, a formula is developed for the tight upper limits.

About this research paper

What this paper is about

summary Consider the problem of finding an upper 1 –α confidence limit for a scalar parameter of interest ø in the presence of a nuisance parameter vector θ when the data are discrete. Approximate upper limitsTmay be found by approximating the relevant unknown finite sample distribution by its limiting distribution. Such approximate upper limits typically have coverage probabilities below, sometimes far below, 1 –α for certain values of (θ, ø). This paper remedies that defect by shifting the possible valuestofTso that they are as small as possible subject both to the minimum coverage probability being greater than or equal to 1 –α, and to the shifted values being in the same order as the unshiftedts. The resulting upper limits are called ‘tight’. Under very weak and easily checked regularity conditions, a formula is developed for the tight upper limits.

Why it matters

OpenAlex reports 23 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

summary Consider the problem of finding an upper 1 –α confidence limit for a scalar parameter of interest ø in the presence of a nuisance parameter vector θ when the data are discrete. Approximate upper limitsTmay be found by approximating the relevant unknown finite sample distribution by its limiting distribution. Such approximate upper limits typically have coverage probabilities below, sometimes far below, 1 –α for certain values of (θ, ø). This paper remedies that defect by shifting the possible valuestofTso that they are as small as possible subject both to the minimum coverage probability being greater than or equal to 1 –α, and to the shifted values being in the same order as the unshiftedts. The resulting upper limits are called ‘tight’. Under very weak and easily checked regularity conditions, a formula is developed for the tight upper limits.

Key concepts: Nuisance parameter, Limit (mathematics), Mathematics, Upper and lower bounds, Scalar (mathematics), Limiting, Confidence interval, Coverage probability

Related papers

Back to paper searchBrowse research topicsOriginal source
TIGHT UPPER CONFIDENCE LIMITS FROM DISCRETE DATA — Research Paper | ScholarLens