Statistics Graduate Level Quiz: Monte Carlo Estimation
10 questions · exam conditions
0:00
Monte Carlo EstimationQuestion 1 of 10

A target distribution assigns probabilities p(0)=0.8p(0)=0.8 and p(1)=0.2p(1)=0.2. The integrand satisfies h(0)=1h(0)=1 and h(1)=9h(1)=9. An importance-sampling estimate of Ep[h(X)]E_p[h(X)] is formed by averaging h(X)p(X)/q(X)h(X)p(X)/q(X) over independent draws from a proposal qq.

Which proposal gives the smallest variance among the choices, and what is that variance per replication?

q=(0.8,0.2)q=(0.8,0.2), with variance 10.2410.24 because sampling from the target avoids weight variability
q=(0.5,0.5)q=(0.5,0.5), with variance 11 because it oversamples the larger integrand value
q=(4/13,9/13)q=(4/13,9/13), with variance 00 because the weighted output is constant
q=(1/13,12/13)q=(1/13,12/13), with variance 0.640.64 because it places most probability on the rare state
← Back to quizzes

Statistics Graduate Level Quiz

Statistics Graduate Level Quiz: Monte Carlo Estimation

Practice Monte Carlo Estimation in Statistics Graduate Level with focused quiz questions that help you check what you know, review explanations, and build confidence with test-style prompts.

What this quiz covers

This quiz focuses on Monte Carlo Estimation, giving you a quick way to practice the rules, question types, and explanations that matter most for Statistics Graduate Level.

How to use this quiz

Try each quiz question before looking at the correct answer. Use the explanations to review missed ideas, then come back to similar questions until the pattern feels familiar.

All questions

Question 1

A target distribution assigns probabilities p(0)=0.8p(0)=0.8 and p(1)=0.2p(1)=0.2. The integrand satisfies h(0)=1h(0)=1 and h(1)=9h(1)=9. An importance-sampling estimate of Ep[h(X)]E_p[h(X)] is formed by averaging h(X)p(X)/q(X)h(X)p(X)/q(X) over independent draws from a proposal qq.

Which proposal gives the smallest variance among the choices, and what is that variance per replication?

  1. q=(0.8,0.2)q=(0.8,0.2), with variance 10.2410.24 because sampling from the target avoids weight variability
  2. q=(0.5,0.5)q=(0.5,0.5), with variance 11 because it oversamples the larger integrand value
  3. q=(4/13,9/13)q=(4/13,9/13), with variance 00 because the weighted output is constant (correct answer)
  4. q=(1/13,12/13)q=(1/13,12/13), with variance 0.640.64 because it places most probability on the rare state
Explanation: Importance sampling works by rewriting Ep[h(X)]=Eq[h(X)p(X)q(X)]E_p[h(X)] = E_q\left[\frac{h(X)p(X)}{q(X)}\right], so the estimator's variance depends entirely on how much the importance weights w(x)=h(x)p(x)/q(x)w(x) = h(x)p(x)/q(x) 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 h(x)p(x)|h(x)|p(x). Here, h(0)p(0)=1×0.8=0.8h(0)p(0) = 1 \times 0.8 = 0.8 and h(1)p(1)=9×0.2=1.8h(1)p(1) = 9 \times 0.2 = 1.8, giving a normalizing constant of 0.8+1.8=2.6=13/50.8 + 1.8 = 2.6 = 13/5. This yields q(0)=0.8/2.6=4/13q^*(0) = 0.8/2.6 = 4/13 and q(1)=1.8/2.6=9/13q^*(1) = 1.8/2.6 = 9/13. Under this proposal, every weight equals h(x)p(x)/q(x)=2.6h(x)p(x)/q^*(x) = 2.6 regardless of which xx 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 h(X)h(X). The variance is Ep[h2](Ep[h])2=(0.81+0.281)(0.8+1.8)2=176.76=10.24E_p[h^2] - (E_p[h])^2 = (0.8 \cdot 1 + 0.2 \cdot 81) - (0.8 + 1.8)^2 = 17 - 6.76 = 10.24. This is valid but far from optimal. Choice B uses uniform weights; you can verify the weighted outputs are 1.61.6 and 3.63.6 with mean 2.62.6 and variance 11, 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 0.640.64. Your takeaway: whenever you see an importance-sampling variance question, immediately check whether any proposal makes h(x)p(x)/q(x)h(x)p(x)/q(x) constant. That proposal, qh(x)p(x)q \propto h(x)p(x), always achieves zero variance and is the theoretical benchmark you should recognize on sight.

Question 2

Two stochastic systems are compared using common random numbers. Under a shared random input, their outputs have variances 99 and 44 and correlation 0.750.75. The target is the difference between their expected outputs, estimated by the average of paired output differences over nn independent shared inputs.

What is the variance of this paired estimator, and how does it compare with using independent random inputs for the two systems?

  1. 4/n4/n, which is smaller than the independent-input variance by a factor of 13/413/4 (correct answer)
  2. 9/n9/n, which is smaller than the independent-input variance by a factor of 13/913/9
  3. 13/n13/n, which is unchanged because common random numbers preserve both marginal variances
  4. 22/n22/n, which is larger because positive correlation adds variability to a difference
Explanation: 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, Var(XY)=Var(X)+Var(Y)2Cov(X,Y)\text{Var}(X - Y) = \text{Var}(X) + \text{Var}(Y) - 2\text{Cov}(X,Y), where Cov(X,Y)=ρVar(X)Var(Y)\text{Cov}(X,Y) = \rho\sqrt{\text{Var}(X)\cdot\text{Var}(Y)}. Here, Var(X)=9\text{Var}(X) = 9, Var(Y)=4\text{Var}(Y) = 4, and ρ=0.75\rho = 0.75. So Cov(X,Y)=0.7594=0.75×6=4.5\text{Cov}(X,Y) = 0.75\sqrt{9 \cdot 4} = 0.75 \times 6 = 4.5. The variance of a single paired difference is 9+42(4.5)=139=49 + 4 - 2(4.5) = 13 - 9 = 4. Averaging over nn independent pairs gives variance 4/n4/n, confirming A is correct. Under independent inputs, the systems are uncorrelated, so the variance would be (9+4)/n=13/n(9 + 4)/n = 13/n. The ratio is 13/413/4, 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 9/n9/n, which would follow if you mistakenly dropped Var(Y)\text{Var}(Y) from the calculation. Choice C gives 13/n13/n — 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 22/n22/n, which would arise from adding the covariance term instead of subtracting — a sign error that would only apply if you were computing Var(X+Y)\text{Var}(X + Y). 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 2Cov2\text{Cov} for differences.

Question 3

A target density is known only up to a normalizing constant: p(x)=p~(x)/Zp(x)=\widetilde p(x)/Z. Independent draws are obtained from a proposal density qq, and unnormalized weights are w(x)=p~(x)/q(x)w(x)=\widetilde p(x)/q(x). The self-normalized importance-sampling estimator is μ^=i=1nwih(Xi)/i=1nwi\widehat\mu=\sum_{i=1}^n w_i h(X_i)/\sum_{i=1}^n w_i.

Assuming the proposal covers the target support and the needed first moments are finite, which statement is generally correct?

  1. μ^\widehat\mu is exactly unbiased for every nn because the unknown constant cancels from the ratio
  2. μ^\widehat\mu is generally biased for finite nn but consistent for Ep[h(X)]E_p[h(X)] as nn increases (correct answer)
  3. μ^\widehat\mu is inconsistent unless the weights are rescaled to have sample mean exactly 11
  4. μ^\widehat\mu is unbiased only when q=pq=p, but otherwise converges to an expectation under qq
Explanation: 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 μ^=iwih(Xi)iwi\widehat\mu = \frac{\sum_i w_i h(X_i)}{\sum_i w_i} is a ratio of two random quantities. Even though the unknown normalizing constant ZZ cancels algebraically, the ratio of two unbiased estimators is not generally unbiased — this is a classic result in statistics. Formally, E[AB]E[A]E[B]E\left[\frac{A}{B}\right] \neq \frac{E[A]}{E[B]} unless AA and BB are independent or the ratio is deterministic. However, by the Law of Large Numbers, both 1niwih(Xi)pEq[w(X)h(X)]\frac{1}{n}\sum_i w_i h(X_i) \xrightarrow{p} E_q[w(X)h(X)] and 1niwipEq[w(X)]=Z\frac{1}{n}\sum_i w_i \xrightarrow{p} E_q[w(X)] = Z, so their ratio converges in probability to Ep[h(X)]E_p[h(X)], confirming B is correct. A is wrong because cancellation of ZZ does not eliminate the finite-sample bias introduced by taking the expectation of a ratio. The bias is O(1/n)O(1/n) and vanishes only asymptotically. C is wrong on two counts: rescaling weights to have mean 1 is algebraically equivalent to μ^\widehat\mu already written, and the estimator is consistent without any such additional requirement. D is wrong because μ^\widehat\mu converges to Ep[h(X)]E_p[h(X)] regardless of the choice of proposal qq (provided qq covers the support of pp), not to an expectation under qq. 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 "O(1/n)O(1/n) bias" are your signals that self-normalization is the topic at hand.

Question 4

A stationary Markov chain is used to estimate Eπ[h(X)]E_\pi[h(X)]. Under the stationary distribution, Varπ(h)=4\operatorname{Var}_\pi(h)=4, and the lag-kk autocorrelation of h(Xt)h(X_t) is ρk=0.5k\rho_k=0.5^k. The usual large-sample Markov chain variance approximation is assumed.

Approximately how many post-burn-in iterations are needed for the Monte Carlo standard error of the sample mean to be at most 0.020.02?

  1. 10,00010{,}000 iterations, treating the correlated draws as independent
  2. 20,00020{,}000 iterations, using only the one-sided sum of autocorrelations
  3. 40,00040{,}000 iterations, replacing autocorrelations by their absolute doubled sum
  4. 30,00030{,}000 iterations, using the full integrated autocorrelation time (correct answer)
Explanation: When estimating Eπ[h(X)]E_\pi[h(X)] with a correlated Markov chain, the variance of the sample mean is not simply Varπ(h)/n\text{Var}_\pi(h)/n. Instead, you must account for autocorrelation through the integrated autocorrelation time τ\tau, giving: Var(hˉn)Varπ(h)nτ,whereτ=1+2k=1ρk\text{Var}(\bar{h}_n) \approx \frac{\text{Var}_\pi(h)}{n} \cdot \tau, \quad \text{where} \quad \tau = 1 + 2\sum_{k=1}^{\infty} \rho_k With ρk=0.5k\rho_k = 0.5^k, the one-sided sum is k=10.5k=1\sum_{k=1}^{\infty} 0.5^k = 1, so τ=1+2(1)=3\tau = 1 + 2(1) = 3. Setting the Monte Carlo standard error (MCSE) 0.02\leq 0.02: τVarπ(h)n(0.02)2    n3×40.0004=30,000\frac{\tau \cdot \text{Var}_\pi(h)}{n} \leq (0.02)^2 \implies n \geq \frac{3 \times 4}{0.0004} = 30{,}000 This confirms D is correct. A is wrong because it ignores autocorrelation entirely, using n4/0.0004=10,000n \geq 4/0.0004 = 10{,}000. 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 (τ=1+1=2\tau = 1 + 1 = 2), yielding n=20,000n = 20{,}000. This forgets that the spectral variance formula requires doubling the lagged autocorrelation sum, so it underestimates τ\tau by half. C applies some inflated doubling incorrectly, arriving at τ=4\tau = 4 and n=40,000n = 40{,}000. There's no justification for replacing τ=3\tau = 3 with 44 — this overcorrects without theoretical basis. Study tip: Always memorize τ=1+2k=1ρk\tau = 1 + 2\sum_{k=1}^{\infty}\rho_k for geometric autocorrelations — the geometric series simplifies cleanly, making this a common exam calculation. Never treat MCMC draws as independent when autocorrelation is given.

Question 5

For each independent simulation replication, an output YY and a control variable CC are recorded. It is known that E[C]=μCE[C]=\mu_C, Var(Y)=25\operatorname{Var}(Y)=25, Var(C)=4\operatorname{Var}(C)=4, and Corr(Y,C)=0.6\operatorname{Corr}(Y,C)=0.6. Consider the estimator Yβ(CμC)\overline{Y}-\beta(\overline{C}-\mu_C).

Which coefficient is variance minimizing, and what is the resulting variance per replication before division by the number of replications?

  1. β=0.75\beta=0.75 and variance 1919, using the correlation divided by the control standard deviation
  2. β=1.50\beta=1.50 and variance 1616, using covariance divided by the control variance (correct answer)
  3. β=1.50\beta=-1.50 and variance 3434, because the control term is subtracted in the estimator
  4. β=3.00\beta=3.00 and variance 2525, using the output standard deviation divided by the control standard deviation
Explanation: Whenever you encounter a control variate problem, your instinct should be to minimize the variance of the adjusted estimator Yβ(CμC)\overline{Y} - \beta(\overline{C} - \mu_C). Since replications are independent, the variance of this estimator (per replication, before dividing by nn) is: Var(YβC)=Var(Y)2βCov(Y,C)+β2Var(C)\operatorname{Var}(Y - \beta C) = \operatorname{Var}(Y) - 2\beta\operatorname{Cov}(Y,C) + \beta^2\operatorname{Var}(C) To minimize, take the derivative with respect to β\beta and set it to zero: 2Cov(Y,C)+2βVar(C)=0    β=Cov(Y,C)Var(C)-2\operatorname{Cov}(Y,C) + 2\beta\operatorname{Var}(C) = 0 \implies \beta^* = \frac{\operatorname{Cov}(Y,C)}{\operatorname{Var}(C)} Now plug in the given values. Since Corr(Y,C)=0.6\operatorname{Corr}(Y,C) = 0.6, Var(Y)=25\operatorname{Var}(Y)=25, Var(C)=4\operatorname{Var}(C)=4, we get Cov(Y,C)=0.6254=0.6×5×2=6\operatorname{Cov}(Y,C) = 0.6\sqrt{25}\sqrt{4} = 0.6 \times 5 \times 2 = 6. Therefore β=6/4=1.50\beta^* = 6/4 = 1.50. The minimized variance is: 25[Cov(Y,C)]2Var(C)=25364=259=1625 - \frac{[\operatorname{Cov}(Y,C)]^2}{\operatorname{Var}(C)} = 25 - \frac{36}{4} = 25 - 9 = 16 This confirms B is correct. Choice A misuses the formula by dividing correlation by the control standard deviation (0.6/2=0.3×5=0.750.6/2 = 0.3 \times 5 = 0.75) — that's not the covariance-to-variance ratio. Choice C incorrectly flips the sign of β\beta; the subtraction in the estimator is already absorbed into the optimization setup. Choice D uses a ratio of standard deviations (5/2=2.505/2 = 2.50... or 25/4\sqrt{25}/\sqrt{4}), which is related to regression slope only if correlation were 1. Study tip: Always memorize β=Cov(Y,C)/Var(C)\beta^* = \operatorname{Cov}(Y,C)/\operatorname{Var}(C) and the resulting variance reduction formula Var(Y)(1ρ2)\operatorname{Var}(Y)(1 - \rho^2) — a quick sanity check here gives 25(10.36)=1625(1-0.36)=16 ✓.

Question 6

A population is divided into two strata with weights W1=0.8W_1=0.8 and W2=0.2W_2=0.2. The within-stratum standard deviations are σ1=1\sigma_1=1 and σ2=4\sigma_2=4. Independent simulation observations cost c1=1c_1=1 unit in stratum 11 and c2=4c_2=4 units in stratum 22. A stratified mean estimator is used under the budget constraint n1+4n2=600n_1+4n_2=600.

Ignoring integer-rounding issues in the optimization, which allocation minimizes the estimator's variance?

  1. n1=200n_1=200 and n2=100n_2=100, balancing weighted variability against square-root cost (correct answer)
  2. n1=120n_1=120 and n2=120n_2=120, applying ordinary Neyman allocation without cost adjustment
  3. n1=300n_1=300 and n2=75n_2=75, allocating observations in proportion to the stratum weights
  4. n1=400n_1=400 and n2=50n_2=50, allocating according to weighted stratum variances
Explanation: 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 Whσh/chW_h \sigma_h / \sqrt{c_h}, then scale to meet the budget. Compute the allocation weights:
  • Stratum 1: W1σ1/c1=0.8×1/1=0.8W_1\sigma_1/\sqrt{c_1} = 0.8 \times 1 / \sqrt{1} = 0.8
  • Stratum 2: W2σ2/c2=0.2×4/4=0.4W_2\sigma_2/\sqrt{c_2} = 0.2 \times 4 / \sqrt{4} = 0.4
The ratio is n1:n2=0.8:0.4=2:1n_1 : n_2 = 0.8 : 0.4 = 2:1. Now apply the budget constraint n1+4n2=600n_1 + 4n_2 = 600 with n1=2n2n_1 = 2n_2: substituting gives 2n2+4n2=6n2=6002n_2 + 4n_2 = 6n_2 = 600, so n2=100n_2 = 100 and n1=200n_1 = 200. This confirms answer A is correct. Answer B (n1=120,n2=120n_1=120, n_2=120) uses plain Neyman allocation — proportional to WhσhW_h\sigma_h — but ignores the cost differential entirely. This is a classic trap: Neyman allocation only minimizes variance under equal costs. Answer C (n1=300,n2=75n_1=300, n_2=75) 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 (n1=400,n2=50n_1=400, n_2=50) 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 chc_h differs across strata, you must include the 1/ch1/\sqrt{c_h} factor — forgetting it is the single most common error on optimal allocation problems.

Question 7

To estimate E[eU]E[e^U] for UUniform(0,1)U\sim\operatorname{Uniform}(0,1), an analyst generates one uniform draw UU and reports the antithetic-pair average {eU+e1U}/2\{e^U+e^{1-U}\}/2. Another analyst uses the average of eU1e^{U_1} and eU2e^{U_2} for two independent uniform draws.

Which statement correctly compares the two estimators?

  1. The antithetic estimator is biased because UU and 1U1-U are deterministically dependent
  2. The estimators have equal variance because both average exactly two uniform marginal draws
  3. The antithetic estimator has smaller variance because the two transformed outputs have negative covariance (correct answer)
  4. The antithetic estimator has zero variance because the two uniform inputs sum to 11
Explanation: 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 μ^A=eU+e1U2\hat{\mu}_A = \frac{e^U + e^{1-U}}{2}. Since 1UUniform(0,1)1-U \sim \text{Uniform}(0,1), both terms have the correct marginal distribution, so E[μ^A]=E[eU]=e1E[\hat{\mu}_A] = E[e^U] = e - 1—the estimator is unbiased. Its variance is 14(Var(eU)+Var(e1U)+2Cov(eU,e1U))\frac{1}{4}\left(\text{Var}(e^U) + \text{Var}(e^{1-U}) + 2\text{Cov}(e^U, e^{1-U})\right). The key insight: because exe^x is convex and monotone, when UU is large, 1U1-U is small, making eUe^U and e1Ue^{1-U} move in opposite directions. This produces a negative covariance, shrinking the variance below that of the independent-pair estimator μ^I=eU1+eU22\hat{\mu}_I = \frac{e^{U_1}+e^{U_2}}{2}, whose covariance term is zero. Answer C correctly identifies this mechanism. A is wrong because dependence does not imply bias—both UU and 1U1-U 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—eU+e1Ue^U + e^{1-U} still varies with UU (it equals 2cosh(U0.5)2\cosh(U - 0.5)), 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 UU and 1U1-U always achieve the latter.

Question 8

Let XX and YY be independent exponential random variables with rate 11. A crude Monte Carlo estimator of P(X+Y>2)P(X+Y>2) averages indicators of the event. A conditional Monte Carlo estimator instead conditions on the simulated value of XX.

Which quantity should be averaged over independent draws of XX to obtain the conditional estimator, and what variance guarantee does it satisfy?

  1. e(2X)I(X<2)e^{-(2-X)}\,I(X<2), with variance strictly smaller than the crude estimator for every integrand
  2. I(X2)+e(2X)I(X<2)I(X\geq 2)+e^{-(2-X)}\,I(X<2), with variance no larger than the crude estimator by the law of total variance (correct answer)
  3. I(X2)+e(2+X)I(X<2)I(X\geq 2)+e^{-(2+X)}\,I(X<2), with variance equal to the crude estimator because iterated expectation preserves the mean
  4. e2I(X<2)+I(X2)e^{-2}\,I(X<2)+I(X\geq 2), with variance no larger because it replaces the random variable YY by its unconditional mean
Explanation: Conditional Monte Carlo is a variance reduction technique based on the law of total variance: Var(Z)=Var(E[ZX])+E[Var(ZX)]\text{Var}(Z) = \text{Var}(E[Z|X]) + E[\text{Var}(Z|X)], which guarantees Var(E[ZX])Var(Z)\text{Var}(E[Z|X]) \leq \text{Var}(Z) always. The strategy is to replace a noisy indicator with its conditional expectation given observed information. For Z=I(X+Y>2)Z = I(X+Y>2) with YExp(1)Y \sim \text{Exp}(1) independent of XX, compute E[ZX]=P(Y>2XX)E[Z \mid X]= P(Y > 2-X \mid X). When X2X \geq 2, the event is certain: P(Y>2X)=1P(Y > 2-X) = 1. When X<2X < 2, you need P(Y>2X)=e(2X)P(Y > 2-X) = e^{-(2-X)} by the exponential survival function. This gives the conditional estimator I(X2)+e(2X)I(X<2)I(X \geq 2) + e^{-(2-X)}I(X < 2), averaged over draws of XX — exactly answer B. The law of total variance then guarantees variance no larger than the crude estimator. Choice A omits the I(X2)I(X \geq 2) term entirely, so it's a biased estimator — it assigns zero when X2X \geq 2 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 e(2+X)e^{-(2+X)} instead of e(2X)e^{-(2-X)}, 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 e(2X)e^{-(2-X)} with the constant e2e^{-2}, as if substituting X=0X=0, which is neither the conditional expectation nor an unbiased quantity. Your study tip: whenever you condition on a simulated variable, always write out E[I(event)observed]E[I(\text{event}) \mid \text{observed}] explicitly — identify each case (certain, impossible, or in-between) before writing the formula.

Question 9

The rare-event probability P(Z>5)P(Z>5) is to be estimated for ZN(0,1)Z\sim N(0,1). To generate more exceedances, independent observations XiX_i are sampled from the proposal distribution N(5,1)N(5,1).

Which sample average is an unbiased importance-sampling estimator of the rare-event probability?

  1. n1i=1nI(Xi>5)exp(5Xi+12.5)n^{-1}\sum_{i=1}^n I(X_i>5)\exp(-5X_i+12.5) (correct answer)
  2. n1i=1nI(Xi>5)exp(5Xi12.5)n^{-1}\sum_{i=1}^n I(X_i>5)\exp(5X_i-12.5)
  3. n1i=1nI(Xi>0)exp(5Xi+12.5)n^{-1}\sum_{i=1}^n I(X_i>0)\exp(-5X_i+12.5)
  4. n1i=1nI(Xi>5)exp(5Xi12.5)n^{-1}\sum_{i=1}^n I(X_i>5)\exp(-5X_i-12.5)
Explanation: 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 P(Z>5)=Ef[I(Z>5)]P(Z > 5) = E_f[I(Z > 5)] where ff is the standard normal density. Importance sampling rewrites this as Eg ⁣[I(X>5)f(X)g(X)]E_g\!\left[I(X > 5)\frac{f(X)}{g(X)}\right], where gg is the proposal density. Here f=N(0,1)f = N(0,1) and g=N(5,1)g = N(5,1), so the likelihood ratio is: f(x)g(x)=exp(x2/2)exp((x5)2/2)=exp ⁣(x22+(x5)22)=exp(5x+12.5)\frac{f(x)}{g(x)} = \frac{\exp(-x^2/2)}{\exp(-(x-5)^2/2)} = \exp\!\left(-\frac{x^2}{2} + \frac{(x-5)^2}{2}\right) = \exp(-5x + 12.5) The unbiased estimator is therefore n1i=1nI(Xi>5)exp(5Xi+12.5)n^{-1}\sum_{i=1}^n I(X_i > 5)\exp(-5X_i + 12.5), which is answer A. B flips the sign of the exponent, giving exp(5Xi12.5)\exp(5X_i - 12.5). This would correspond to the ratio g/fg/f rather than f/gf/g — it's the reciprocal of the correct weight and produces a heavily biased, explosive estimator. C uses the wrong indicator I(Xi>0)I(X_i > 0) instead of I(Xi>5)I(X_i > 5), so it estimates the wrong probability entirely — P(Z>0)=0.5P(Z > 0) = 0.5, not the rare-event probability. D uses exp(5Xi12.5)\exp(-5X_i - 12.5), with the wrong sign on the constant 12.5; this comes from misexpanding (x5)2(x-5)^2 and loses the cross-term correction. Study tip: Always expand the exponent in f(x)/g(x)f(x)/g(x) 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.

Question 10

A pilot simulation based on 400400 independent replications gives a sample variance of 99 for the output whose expectation is being estimated. The investigator treats this variance estimate as the planning value for a larger independent Monte Carlo run.

Using a normal approximation, what is the smallest total number of replications required for a two-sided 95%95\% Monte Carlo confidence interval to have half-width at most 0.100.10?

  1. 865865 replications, because the standard error itself must be at most 0.100.10
  2. 1,5371{,}537 replications, because the current interval width scales inversely with sample size
  3. 3,4583{,}458 replications, because the half-width scales inversely with the square root of sample size (correct answer)
  4. 13,83013{,}830 replications, because both endpoints contribute separately to the required precision
Explanation: 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 zα/2σnz_{\alpha/2} \cdot \frac{\sigma}{\sqrt{n}}, where z0.025=1.96z_{0.025} = 1.96, σ2\sigma^2 is the planning variance, and nn is the number of replications. Your goal is to solve for the smallest nn such that this half-width is at most the target. Here, the pilot study gives σ^2=9\hat{\sigma}^2 = 9, so σ^=3\hat{\sigma} = 3. Setting the half-width condition: 1.963n0.101.96 \cdot \frac{3}{\sqrt{n}} \leq 0.10 Solving: n1.96×30.10=58.8\sqrt{n} \geq \frac{1.96 \times 3}{0.10} = 58.8, so n58.82=3,457.44n \geq 58.8^2 = 3{,}457.44. Rounding up gives n=3,458n = 3{,}458, confirming C is correct. The half-width shrinks at rate 1/n1/\sqrt{n}, not 1/n1/n, which is the critical insight. Choice A confuses the half-width with the standard error itself — it skips multiplying by z0.025=1.96z_{0.025} = 1.96 and sets σ/n0.10\sigma/\sqrt{n} \leq 0.10, yielding only n900n \geq 900. That ignores the confidence coefficient entirely. Choice B applies an incorrect 1/n1/n scaling relationship instead of 1/n1/\sqrt{n}, 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 zz-multiplier (leading to A) or using nn instead of n\sqrt{n} as the denominator (leading to B or D).