Let where , and set it to zero on the g-null set where . The domination assumption makes there and gives . Integrating it also gives . For iid proposals , the importance sampling estimator isCauchy-Schwarz inequality under gives . Direct integration proves unbiasedness, . MoreoverThusThe iid central limit theorem applies to these finite-variance weighted observations:If the variance is zero, this denotes the point mass at zero. This is the bounded-weight importance-sampling moment bound.
For each proposal , independently draw and accept it whenThe ratio is at most one, as required. For any measurable set ,so the acceptance probability is and the conditional distribution of an accepted proposal has density . Repeating independent trials until acceptance therefore gives an exact draw from , and repeating the whole procedure gives iid target draws. This proves rejection sampling.
The number of proposals for one successful draw is geometric with mean . Thus is also the expected proposal cost of this exact simulation method.
Apply independent uniforms to the proposals, and let indicate acceptance. Each is Bernoulli with success probability , and the indicators are independent because the pairs are independent. HenceFor a fixed acceptance pattern, the values at accepted positions are independent with density , by the single-trial conditional density calculation. The same product law holds for every pattern of a given size. Consequently, conditional on , the ordered accepted observations have joint density . This is the binomial count and iid values in fixed-budget rejection sampling; the count provides no information about those target values.
There is a finite-sample empty-output event, with probability . Any estimator dividing by must be defined separately on .
Write and . The Bernoulli central limit theorem givesIf , all proposals are accepted and this limit is degenerate.
Conditional on , the accepted sample is iid from . Since , its size tends to infinity, and the ordinary target-sample CLT therefore givesAssign any fixed value to the estimator on ; the probability of that event tends to zero, so it does not change this limit. This is the random-count central limit theorem for accepted rejection samples.
For comparison at the same budget of proposals, Slutsky's theorem rescales this asThe distinction between accepted-sample size and proposal count is essential for the final efficiency comparison.
At a common proposal budget, the two asymptotic variances areThus prefer the estimator with the smaller proposal-budget variance; the stated assumptions do not give a universal winner. Importance sampling uses every proposal and avoids an empty accepted sample, but those facts alone do not establish variance dominance. The bound from part (a) only says . If , it does imply that importance sampling is at least as efficient asymptotically.
For explicit nonconstant counterexamples in both directions, take and on , and zero outside, with the sharp envelope . For , direct integration gives , andThe accepted-sample mean is better. For the same densities but , the target variance is unchanged, while andImportance sampling is now better. This is the variance reversal under additive shifts of an importance-sampling integrand.
There is a useful distinction about the Rao-Blackwell theorem. The weighted importance estimator is the conditional expectation, given the proposals, of the fixed-denominator rejection estimator . It is not the conditional expectation of the random-denominator mean . Rao-Blackwell variance reduction for the former therefore does not prove a comparison with the latter. This is the Rao-Blackwell identity for a fixed-denominator rejection estimator. The appropriate answer is the proposal-budget variance comparison of importance and rejection sampling, with the empty-output convention specified.
Articles by others on the same topic
There are currently no matching articles.