Answers are grounded in this paper and cite their sources.
The paper develops one-sided analogs to Scheffe's two-sided confidence bounds for a function f(x), x ∈ Rⁿ. If the domain X of f is a subset of R₊ⁿ = : xᵢ 0, ∀ i\, then the upper Scheffe bounds are conservative upper confidence bounds, which can be sharpened, often to great practical advantage. This sharpening, accomplished by a non-trivial extension of Scheffe's method, is developed by the geometry-probability argument of Section 2. Section 3 derives coverage probabilities for general 2- and 3-parameter functions and illustrates savings by the sharp bounds in two examples.
No takes yet. Share an insight, caveat, or question.
Bohrer et al. (1972) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: