Lably
Skip to content

Variance reduction

Mathematical procedure for reducing the variance of statistical estimators

  • 3 min read
  • 3 chapters

Related on Lably

Through Mathematics, Variance and Central limit theorem

For simulation with black-box models subset simulation and line sampling can also be used. Under these headings are a variety of specialized techniques; for example, particle transport simulations make extensive use of "weight windows" and "splitting/Russian roulette" techniques, which are a form of importance sampling.

Crude Monte Carlo simulation

Suppose one wants to compute z:=E(Z) with the random variable Z defined on the probability space (Ω,F,P). Monte Carlo does this by sampling i.i.d. copies Z1,...,ZR of Z and then to estimate z via the sample-mean estimator

z¯=1n∑i=1nZi

Under further mild conditions such as var(Z)<∞, a central limit theorem will apply such that for large n→∞, the distribution of z¯ converges to a normal distribution with mean z and standard error σ/n. Because the standard deviation only converges towards 0 at the rate n, implying one needs to increase the number of simulations (n) by a factor of 4 to halve the standard deviation of z¯, variance reduction methods are often useful for obtaining more precise estimates for z without needing very large numbers of simulations.

Sign in to keep reading

2 more chapters are free with a Lably account.

More in Statistics