Reciprocal-estimation bias in randomized atom inclusion quantifies the nonlinear plug-in loss beyond the sign supplied by Jensen's inequality. Keep the independent-calibration model of atom-probability error in a randomized endpoint rule: true atom probability , unbiased estimate , and included probability , with the upper endpoint calibrated to actual probability . Assume , , and .
The exact algebraic identitygivesThus the loss depends on squared errors weighted by the reciprocal estimated probability. The second-order delta method approximation is , but the exact remainder shows why small estimated probabilities deserve particular attention.
If almost surely for , a nonasymptotic bound isFor an original small-error example, let , let measurement calibration return or equally often, and take , . Here and the variance is . The exact included probability is about ; the second-order approximation is , while the bounded-error calculation puts the coverage loss between about and .
The bounded-relative-error assumption can fail for a finite binomial measurement calibration: an empirical atom fraction can be zero with positive probability. Such near-zero probability estimates in reciprocal plug-in rules require an explicitly defined guard or different measurement calibration model, not division by zero. The auxiliary endpoint decision must remain independent of the future duration and measurement calibration as stipulated. The documented uniform random-variates construction supplies that auxiliary randomness; it does not validate the atom estimate.[ref]
SciPy 1.16.2 documentation. scipy.stats.uniform, support and rvs
Near-zero probability estimates in reciprocal plug-in rules can make a nominal randomization undefined even when the underlying probability estimate is unbiased. For an independent measurement calibration count , the empirical atom fraction has , butThus its reciprocal is not a finite statistic on every measurement calibration outcome. The binomial probability mass function supplies this zero-count probability directly.[ref]
SciPy 1.16.2 documentation. scipy.stats.binom, Notes: pmf; Methods: pmf
In reciprocal-estimation bias in randomized atom inclusion, a fixed upper endpoint contributes actual probability and the auxiliary rule uses . Valid probabilities require a separate rule when , including zero. One possible numerical guard is with . It makes defined and between zero and one. It does not preserve the unbiasedness or the coverage properties of the unguarded formula.
For an original finite measurement calibration example, take , , , , and . A zero count occurs with probability about . On that outcome the guarded rule includes zero with probability , and its included duration-model probability is , below the nominal . Averaging over every measurement calibration outcome givesThe calculation assumes the future duration, measurement calibration sample, and auxiliary random draw have the stipulated independence, and the upper-endpoint probability is exactly .
Such finite-calibration guards for reciprocal endpoint randomization solve a domain problem, not a coverage proof. A validated upper probability bound can provide a different conservative construction under the parent's assumptions, but an arbitrary floor is not automatically such a bound. Calibration size, lower-tail events and the actual guarded rule must all enter the final joint-probability calculation.
Finite-calibration guards for reciprocal endpoint randomization must specify both a valid endpoint decision and how calibration uncertainty enters its probability guarantee. An arbitrary positive floor avoids division by zero but does not establish nominal inclusion, as the example in near-zero probability estimates in reciprocal plug-in rules demonstrates.
One finite-sample construction uses an upper confidence bound for the atom probability , based on independent calibration count . Supposewhere is a calibration failure budget. An exact one-sided binomial bound can be obtained by inversion: for , choose satisfying , and put . This is a confidence statement over calibration samples, not a posterior probability for a fixed after observing one count. The pinned reference documents the exact binomial proportion-interval method.[ref]
SciPy 1.16.2 documentation. BinomTestResult.proportion_ci, confidence_level, exact method and returned bounds
For a fixed upper duration endpoint with actual cumulative probability , setThe rule is defined and . On the event , its conditional included probability is . This calculation also requires independence of the calibration, future duration and auxiliary endpoint draw as stipulated by the parent model.
For an original zero-count example, take and . Since , inversion gives . With , , and stipulated true , the zero-count conditional included probability is approximately . The bound is much larger than the raw estimate zero, reflecting the uncertainty of a small calibration sample rather than inventing a measured atom fraction.
The calibration confidence level is not free. Since included probabilities are nonnegative even on the failure event, a general joint guarantee from this argument is onlyAt conditional target and calibration confidence , this lower guarantee is , not . To certify an unconditional target using this argument, the conditional target must be at least , provided it can fit below , or the failure budget must be reduced. Any upper-endpoint model error also needs separate accounting.
Articles by others on the same topic
There are currently no matching articles.