Monte Carlo Estimation - Statistics Graduate Level
- Approximately how many post-burn-in iterations are needed for the Monte Carlo standard error of the sample mean to be at most ? Answer: iterations, using the full integrated autocorrelation time When estimating with a correlated Markov chain, the variance of the sample mean is not simply . Instead, you must account for autocorrelation through the integrated autocorrelation time , giving: With , the one-sided sum is , so . Setting the Monte Carlo standard error (MCSE) : This confirms D is correct. A is wrong because it ignores autocorrelation entirely, using . This severely underestimates the required sample size — a classic trap when students forget that correlated draws carry less information than independent ones. B uses only the one-sided sum (), yielding . This forgets that the spectral variance formula requires doubling the lagged autocorrelation sum, so it underestimates by half. C applies some inflated doubling incorrectly, arriving at and . There's no justification for replacing with — this overcorrects without theoretical basis. Study tip: Always memorize for geometric autocorrelations — the geometric series simplifies cleanly, making this a common exam calculation. Never treat MCMC draws as independent when autocorrelation is given.
- Ignoring integer-rounding issues in the optimization, which allocation minimizes the estimator's variance? Answer: and , balancing weighted variability against square-root cost When you see a stratified sampling question with both unequal variances and unequal costs, your first instinct should be optimal (cost-adjusted Neyman) allocation, not plain Neyman allocation. The optimal rule says allocate sample sizes proportional to , then scale to meet the budget. Compute the allocation weights: - Stratum 1: - Stratum 2: The ratio is . Now apply the budget constraint with : substituting gives , so and . This confirms answer A is correct. Answer B () uses plain Neyman allocation — proportional to — but ignores the cost differential entirely. This is a classic trap: Neyman allocation only minimizes variance under equal costs. Answer C () allocates purely by stratum weight (0.8 and 0.2), ignoring both within-stratum variance and cost. This is proportional allocation, which is even cruder than Neyman. Answer D () doesn't correspond to any standard optimality criterion — it overloads the cheaper stratum without a principled justification. Study tip: Always check whether costs are equal before applying Neyman allocation. If differs across strata, you must include the factor — forgetting it is the single most common error on optimal allocation problems.
- Which statement correctly compares the two estimators? Answer: The antithetic estimator has smaller variance because the two transformed outputs have negative covariance Variance reduction via antithetic variates is a core Monte Carlo technique worth mastering deeply. When you see a question comparing two estimators that both "use two uniform draws," immediately ask: are those draws independent or negatively correlated? That distinction drives everything. The antithetic estimator is . Since , both terms have the correct marginal distribution, so —the estimator is unbiased. Its variance is . The key insight: because is convex and monotone, when is large, is small, making and move in opposite directions. This produces a negative covariance, shrinking the variance below that of the independent-pair estimator , whose covariance term is zero. Answer C correctly identifies this mechanism. A is wrong because dependence does not imply bias—both and are marginally uniform, preserving unbiasedness. B is wrong because equal marginal distributions do not guarantee equal variances; the covariance structure differs critically between the two estimators. D is wrong because the inputs summing to 1 does not make the outputs constant— still varies with (it equals ), so variance is positive, just reduced. Study tip: For antithetic variates, always verify two things—same marginals (ensures unbiasedness) and negative covariance (ensures variance reduction). Monotone transformations of and always achieve the latter.
- What is the variance of this paired estimator, and how does it compare with using independent random inputs for the two systems? Answer: , which is smaller than the independent-input variance by a factor of When comparing two stochastic systems, the key question is how correlation between paired outputs affects the variance of their difference. Recall that for any two random variables, , where . Here, , , and . So . The variance of a single paired difference is . Averaging over independent pairs gives variance , confirming A is correct. Under independent inputs, the systems are uncorrelated, so the variance would be . The ratio is , meaning the paired estimator is smaller by exactly that factor — the whole point of common random numbers (CRN) as a variance reduction technique. Choice B uses , which would follow if you mistakenly dropped from the calculation. Choice C gives — this is the independent-input variance, reflecting a failure to apply the covariance term at all; it's the benchmark you're comparing against, not the CRN result. Choice D claims variance , which would arise from adding the covariance term instead of subtracting — a sign error that would only apply if you were computing . The key study tip: CRN works precisely because positive correlation reduces the variance of a difference. Whenever you see paired simulation experiments with positive correlation, expect the paired variance to be strictly less than the sum of marginals — and always subtract for differences.
- Using a normal approximation, what is the smallest total number of replications required for a two-sided Monte Carlo confidence interval to have half-width at most ? Answer: replications, because the half-width scales inversely with the square root of sample size Whenever you see a Monte Carlo confidence interval question, anchor yourself to the standard formula: the half-width of a two-sided 95% interval is , where , is the planning variance, and is the number of replications. Your goal is to solve for the smallest such that this half-width is at most the target. Here, the pilot study gives , so . Setting the half-width condition: Solving: , so . Rounding up gives , confirming C is correct. The half-width shrinks at rate , not , which is the critical insight. Choice A confuses the half-width with the standard error itself — it skips multiplying by and sets , yielding only . That ignores the confidence coefficient entirely. Choice B applies an incorrect scaling relationship instead of , producing a nonsensical intermediate formula. Choice D doubles the correct answer as if both endpoints each independently require the full half-width precision, which is a misunderstanding — the half-width already accounts for both directions symmetrically. Your study tip: always write the half-width formula explicitly before solving. The most common trap on precision-planning problems is forgetting either the -multiplier (leading to A) or using instead of as the denominator (leading to B or D).
- Assuming the proposal covers the target support and the needed first moments are finite, which statement is generally correct? Answer: is generally biased for finite but consistent for as increases Whenever you see a question involving ratio estimators in importance sampling, your instinct should be to think carefully about the distinction between exact unbiasedness and asymptotic unbiasedness (consistency). The self-normalized estimator is a ratio of two random quantities. Even though the unknown normalizing constant cancels algebraically, the ratio of two unbiased estimators is not generally unbiased — this is a classic result in statistics. Formally, unless and are independent or the ratio is deterministic. However, by the Law of Large Numbers, both and , so their ratio converges in probability to , confirming B is correct. A is wrong because cancellation of does not eliminate the finite-sample bias introduced by taking the expectation of a ratio. The bias is and vanishes only asymptotically. C is wrong on two counts: rescaling weights to have mean 1 is algebraically equivalent to already written, and the estimator is consistent without any such additional requirement. D is wrong because converges to regardless of the choice of proposal (provided covers the support of ), not to an expectation under . Study tip: On graduate-level exams, always flag ratio estimators — they are virtually never exactly unbiased, but they are often consistent. The phrase "bias-variance tradeoff" and " bias" are your signals that self-normalization is the topic at hand.
- Which proposal gives the smallest variance among the choices, and what is that variance per replication? Answer: , with variance because the weighted output is constant Importance sampling works by rewriting , so the estimator's variance depends entirely on how much the importance weights vary across draws. The holy grail is a proposal that makes those weights constant, because a constant random variable has zero variance. The optimal proposal is proportional to . Here, and , giving a normalizing constant of . This yields and . Under this proposal, every weight equals regardless of which is drawn — the estimator is constant, so its variance is exactly 0. This confirms C is correct. Choice A uses the target itself as the proposal, so weights are all 1 and the estimator simply averages . The variance is . This is valid but far from optimal. Choice B uses uniform weights; you can verify the weighted outputs are and with mean and variance , better than A but not zero. Choice D inverts the sensible direction — piling mass on the rare, high-value state without the precise optimal ratio still leaves weight variability, yielding variance . Your takeaway: whenever you see an importance-sampling variance question, immediately check whether any proposal makes constant. That proposal, , always achieves zero variance and is the theoretical benchmark you should recognize on sight.
- Which quantity should be averaged over independent draws of to obtain the conditional estimator, and what variance guarantee does it satisfy? Answer: , with variance no larger than the crude estimator by the law of total variance Conditional Monte Carlo is a variance reduction technique based on the law of total variance: , which guarantees always. The strategy is to replace a noisy indicator with its conditional expectation given observed information. For with independent of , compute . When , the event is certain: . When , you need by the exponential survival function. This gives the conditional estimator , averaged over draws of — exactly answer B. The law of total variance then guarantees variance no larger than the crude estimator. Choice A omits the term entirely, so it's a biased estimator — it assigns zero when even though the event is guaranteed. Its variance claim of "strictly smaller for every integrand" is also too strong; the law of total variance only guarantees non-strict inequality. Choice C uses instead of , which is simply the wrong survival probability — a sign error inside the exponent. The variance claim about iterated expectation is also a non sequitur. Choice D replaces with the constant , as if substituting , which is neither the conditional expectation nor an unbiased quantity. Your study tip: whenever you condition on a simulated variable, always write out explicitly — identify each case (certain, impossible, or in-between) before writing the formula.
- Which coefficient is variance minimizing, and what is the resulting variance per replication before division by the number of replications? Answer: and variance , using covariance divided by the control variance Whenever you encounter a control variate problem, your instinct should be to minimize the variance of the adjusted estimator . Since replications are independent, the variance of this estimator (per replication, before dividing by ) is: To minimize, take the derivative with respect to and set it to zero: Now plug in the given values. Since , , , we get . Therefore . The minimized variance is: This confirms B is correct. Choice A misuses the formula by dividing correlation by the control standard deviation () — that's not the covariance-to-variance ratio. Choice C incorrectly flips the sign of ; the subtraction in the estimator is already absorbed into the optimization setup. Choice D uses a ratio of standard deviations (... or ), which is related to regression slope only if correlation were 1. Study tip: Always memorize and the resulting variance reduction formula — a quick sanity check here gives ✓.
- Which sample average is an unbiased importance-sampling estimator of the rare-event probability? Answer: Whenever you see an importance sampling problem, your first instinct should be to write out the likelihood ratio (the Radon-Nikodym derivative) between the target and proposal distributions. This ratio is the engine of the estimator. You want where is the standard normal density. Importance sampling rewrites this as , where is the proposal density. Here and , so the likelihood ratio is: The unbiased estimator is therefore , which is answer A. B flips the sign of the exponent, giving . This would correspond to the ratio rather than — it's the reciprocal of the correct weight and produces a heavily biased, explosive estimator. C uses the wrong indicator instead of , so it estimates the wrong probability entirely — , not the rare-event probability. D uses , with the wrong sign on the constant 12.5; this comes from misexpanding and loses the cross-term correction. Study tip: Always expand the exponent in term-by-term and double-check the sign of every piece — sign errors in the weight are the most common trap in importance sampling questions.